Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
From MaRDI portal
Publication:2676342
Recommendations
- A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
- An adaptive large neighborhood search heuristic for the share-a-ride problem
- Variable neighborhood search for the dial-a-ride problem
- A hybrid greedy randomized adaptive search heuristic to solve the dial-a-ride problem
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
- 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
Cites work
- A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
- A dynamic vehicle routing problem with time-dependent travel times
- A fast solution method for the time-dependent orienteering problem
- A hybrid algorithm for time-dependent vehicle routing problem with time windows
- A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
- An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
- An assign-and-route matheuristic for the time-dependent inventory routing problem
- Dynamic programming based metaheuristics for the dial-a-ride problem
- Home health care routing and scheduling: a review
- Minimum cost VRP with time-dependent speed data and congestion charge
- Multi-objective optimization models for patient allocation during a pandemic influenza outbreak
- Multi-trip time-dependent vehicle routing problem with time windows
- Orienteering problem: a survey of recent variants, solution approaches and applications
- Solving the stochastic time-dependent orienteering problem with time windows
- Tabu search for the time-dependent vehicle routing problem with time windows on a road network
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- The dial-A-ride problem with transfers
- The pickup and delivery problem with time windows and occasional drivers
- The time-dependent capacitated profitable tour problem with time windows and precedence constraints
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Time dependent vehicle routing problem with a multi ant colony system
- Time-dependent routing problems: a review
- Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
- Vehicle dispatching with time-dependent travel times
Cited in
(4)- A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
- An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
- An adaptive large neighborhood search heuristic for the share-a-ride problem
- Hybrid column generation and large neighborhood search 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2676342)
