Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem

DOI10.1016/J.COR.2022.105938OpenAlexW4286256330MaRDI QIDQ2676342FDOQ2676342

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

zbMATH Keywords

meta-heuristicsmixed integer programmingroutingdial-a-ride problemtime-dependent travel time

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Time dependent vehicle routing problem with a multi ant colony system
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• Vehicle dispatching with time-dependent travel times
• Dynamic programming based metaheuristics for the dial-a-ride problem
• Multi-objective optimization models for patient allocation during a pandemic influenza outbreak
• A fast solution method for the time-dependent orienteering problem
• Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
• Orienteering problem: a survey of recent variants, solution approaches and applications
• The dial-A-ride problem with transfers
• Minimum cost VRP with time-dependent speed data and congestion charge
• Solving the stochastic time-dependent orienteering problem with time windows
• A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
• A dynamic vehicle routing problem with time-dependent travel times
• Time-dependent routing problems: a review
• Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
• An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
• The pickup and delivery problem with time windows and occasional drivers
• Home health care routing and scheduling: a review
• A hybrid algorithm for time-dependent vehicle routing problem with time windows
• The time-dependent capacitated profitable tour problem with time windows and precedence constraints
• 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
• Tabu search for the time-dependent vehicle routing problem with time windows on a road network

Cited In (3)

• A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
• Hybrid column generation and large neighborhood search for the dial-a-ride problem
• An adaptive large neighborhood search heuristic for the share-a-ride problem

Uses Software

• irace

Recommendations

• Variable neighborhood search for the dial-a-ride problem 👍 👎
• Hybrid column generation and large neighborhood search for the dial-a-ride problem 👍 👎
• Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests 👍 👎
• An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows 👍 👎
• A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem 👍 👎
• A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM 👍 👎
• An adaptive large neighborhood search heuristic for the share-a-ride problem 👍 👎
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows 👍 👎
• An adaptive large neighborhood search algorithm for vehicle routing problem with multiple time windows constraints 👍 👎

This page was built for publication: Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2676342)