Results 11 to 20 of about 6,794 (285)
Hybrid adaptive large neighborhood search algorithm for the mixed fleet heterogeneous dial-a-ride problem [PDF]
The mixed fleet heterogeneous dial-a-ride problem (MF-HDARP) consists of designing vehicle routes for a set of users by using a mixed fleet including both heterogeneous conventional and alternative fuel vehicles. In addition, a vehicle is allowed to refuel from a fuel station to eliminate the risk of running out of fuel during its service.
Mohamed Amine Masmoudi +3 more
openaire +3 more sources
Vehicle Routing Problem with Reverse Cross-Docking: An Adaptive Large Neighborhood Search Algorithm
Cross-docking is a logistics strategy that aims at less transportation costs and fast customer deliveries. Incorporating an efficient vehicle routing could increase the benefits of the cross-docking. In this paper, the vehicle routing problem with reverse cross-docking (VRP-RCD) is studied.
Aldy Gunawan +3 more
openaire +4 more sources
Bi-Objective Adaptive Large Neighborhood Search Algorithm for the Healthcare Waste Periodic Location Inventory Routing Problem. [PDF]
There has been an unexpected increase in the amount of healthcare waste during the COVID-19 pandemic. Managing healthcare waste is vital, as improper practices in the waste system can lead to the further spread of the virus.
Aydemir-Karadag A.
europepmc +2 more sources
Compared to fossil fuel-based internal combustion vehicles, electric vehicles with lower local pollution and noise are becoming more and more popular in urban logistic distribution.
Dan Wang, Weibo Zheng, Hong Zhou
doaj +2 more sources
International Timetabling Competition 2011: An Adaptive Large Neighborhood Search algorithm [PDF]
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 +2 more sources
An Adaptive Large Neighborhood Search Algorithm for the Multi-mode RCPSP [PDF]
We present an Adaptive Large Neighborhood Search algorithm for the Multi-mode Resource-Constrained Project Scheduling Problem (MRCPSP). We incorporate techniques for deriving additional precedence relations and propose a new method, so-called mode-diminution, for removing modes during execution.
Muller, Laurent Flindt
openaire +2 more sources
This paper addresses the challenge of rising operational costs in last-mile delivery caused by end-customer no-shows. The study proposes a collaborative operational framework for last-mile delivery that accommodates roaming customers, enabling them to be serviced by multiple depots as they transition between different locations.
Yandong He +3 more
openaire +2 more sources
In container sea–rail combined transport, the railway yard in an automated container terminal (RYACT) is the link in the whole logistics transportation process, and its operation and scheduling efficiency directly affect the efficiency of logistics.
Hongbin Chen, Wei Liu
doaj +2 more sources
A hybrid adaptive large neighborhood search algorithm applied to a lot-sizing problem [PDF]
This paper presents a hybrid of a general heuristic framework that has been successfully applied to vehicle routing problems and a general purpose MIP solver. The framework uses local search and an adaptive procedure which choses between a set of large neighborhoods to be searched.
Muller, Laurent Flindt +1 more
openaire +2 more sources
In order to tackle the congestion and environmental issues, customized bus services are proposed and deployed in metropolitan areas. As emerging public transportation services, customized bus services bring passengers more convenience and accessibility ...
Jiuyu An +4 more
core +1 more source

