Results 61 to 70 of about 8,476 (163)
Order fulfillment planning with crowdsourcing integration
E-commerce has experienced rapid growth over the past decade, creating new challenges for last-mile and same-day delivery services. In response to the explosive increase in online orders and the emerging role of crowdsourcing in urban logistics, we ...
Xuejing Cao, Zhongmin Da, Xuefei Wang
doaj +1 more source
Adaptive large neighborhood search for the commodity constrained split delivery VRP
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gu, Wenjuan +3 more
openaire +4 more sources
This paper aims to address the time-dependent multi-depot vehicle routing problem with time windows (MDVRPTW) in urban cold chain logistics under a dynamic road network.
Xiaochun Yang, Huiyuan Jiang
doaj +1 more source
This research introduces an advanced attention-driven model designed to optimize mobile shelf warehouse order-picking. Our model incorporates an enhanced masking mechanism and context-aware decoder, streamlining the order-picking process. In essence, our
Jiawei Zhang +4 more
doaj +1 more source
ParBalans: Parallel Multi-Armed Bandits-based Adaptive Large Neighborhood Search
Solving Mixed-Integer Programming (MIP) problems often requires substantial computational resources due to their combinatorial nature. Parallelization has emerged as a critical strategy to accelerate solution times and enhance scalability to tackle large, complex instances.
Yilmaz, Alican +3 more
openaire +2 more sources
An improved large neighborhood search algorithm for solving dynamic pickup and delivery problems
The large-scale dynamic pickup and delivery problem (DPDP), characterized by a vast number of orders, complex constraints, and the uncertainties introduced by its dynamic nature, poses significant challenges to existing vehicle routing algorithms ...
Qingxia Shang +6 more
doaj +1 more source
The efficiency of collecting and distributing goods has been improved by establishing railway lines that serve new automated container terminals (ACTs) and by constructing central railway stations close to ports.
Hongbin Chen, Wei Liu
doaj +1 more source
Time-dependent vehicle routing problem with time windows (TDVRPTW) is a pivotal problem in logistics domain. In this study, a special case of TDVRPTW with temporal-spatial distance (TDVRPTW-TSD) is investigated, which objectives are to minimize the total
Jia-ke Li, Jun-qing Li, Ying Xu
doaj +1 more source
International Timetabling Competition 2011: An Adaptive Large Neighborhood Search algorithm
An algorithm based on Adaptive Large Neighborhood Search (ALNS) for solving the generalized High School Timetabling problem in XHSTT-format (Post et al (2012a)) is presented. This algorithm was among the nalists of round 2 of the International Timetabling Competition 2011 (ITC2011). For problem description and results we refer to Post et al (2012b).
Sørensen, Matias +2 more
openaire +1 more source
Adaptive large neighborhood search for bicycle repositioning
Vergeylen, Nicholas +2 more
openaire +2 more sources

