Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
From MaRDI portal
Publication:2676342
DOI10.1016/J.COR.2022.105938OpenAlexW4286256330MaRDI QIDQ2676342
Ruixue Gu, Zhenzhen Zhang, Jingyi Zhao, Mark Poon
Publication date: 27 September 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105938
Uses Software
Cites Work
- Orienteering problem: a survey of recent variants, solution approaches and applications
- The dial-A-ride problem with transfers
- Multi-objective optimization models for patient allocation during a pandemic influenza outbreak
- Minimum cost VRP with time-dependent speed data and congestion charge
- A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
- Time-dependent routing problems: a review
- An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
- Home health care routing and scheduling: a review
- The time-dependent capacitated profitable tour problem with time windows and precedence constraints
- Solving the stochastic time-dependent orienteering problem with time windows
- A dynamic vehicle routing problem with time-dependent travel times
- Vehicle dispatching with time-dependent travel times
- The pickup and delivery problem with time windows and occasional drivers
- A hybrid algorithm for time-dependent vehicle routing problem with time windows
- Tabu search for the time-dependent vehicle routing problem with time windows on a road network
- A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
- Multi-trip time-dependent vehicle routing problem with time windows
- An assign-and-route matheuristic for the time-dependent inventory routing problem
- A fast solution method for the time-dependent orienteering problem
- Time dependent vehicle routing problem with a multi ant colony system
- Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Dynamic programming based metaheuristics for the dial-a-ride problem
This page was built for publication: Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
