MyJournals Home  

RSS FeedsAlgorithms, Vol. 12, Pages 39: A Hybrid Adaptive Large Neighborhood Heuristic for a Real-Life Dial-a-Ride Problem (Algorithms)

 
 

18 february 2019 23:03:39

 
Algorithms, Vol. 12, Pages 39: A Hybrid Adaptive Large Neighborhood Heuristic for a Real-Life Dial-a-Ride Problem (Algorithms)
 


The transportation of elderly and impaired people is commonly solved as a Dial-A-Ride Problem (DARP). The DARP aims to design pick-up and delivery vehicle routing schedules. Its main objective is to accommodate as many users as possible with a minimum operation cost. It adds realistic precedence and transit time constraints on the pairing of vehicles and customers. This paper tackles the DARP with time windows (DARPTW) from a new and innovative angle as it combines hybridization techniques with an adaptive large neighborhood search heuristic algorithm. The main objective is to improve the overall real-life performance of vehicle routing operations. Real-life data are refined and fed to a hybrid adaptive large neighborhood search (Hybrid-ALNS) algorithm which provides a near-optimal routing solution. The computational results on real-life instances, in the Canadian city of Vancouver and its region, and DARPTW benchmark instances show the potential improvements achieved by the proposed heuristic and its adaptability.


 
64 viewsCategory: Informatics
 
Algorithms, Vol. 12, Pages 40: An INS-UWB Based Collision Avoidance System for AGV (Algorithms)
Algorithms, Vol. 12, Pages 38: A Two-Level Rolling Optimization Model for Real-time Adaptive Signal Control (Algorithms)
 
 
blog comments powered by Disqus


MyJournals.org
The latest issues of all your favorite science journals on one page

Username:
Password:

Register | Retrieve

Search:

Informatics


Copyright © 2008 - 2024 Indigonet Services B.V.. Contact: Tim Hulsen. Read here our privacy notice.
Other websites of Indigonet Services B.V.: Nieuws Vacatures News Tweets Nachrichten