An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization

DOI10.1007/s00291-021-00656-7zbMath1486.90041OpenAlexW3212175929MaRDI QIDQ2125364

Arne Schulz, Christian Pfeiffer

Publication date: 14 April 2022

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-021-00656-7

zbMATH Keywords

dynamic programmingdial-a-rideadaptive large neighbourhood searchdemand responsive transport

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22) Dynamic programming (90C39) Traffic problems in operations research (90B20)

Related Items (1)

Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems

Uses Software

• irace

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Large neighborhood search for multi-trip vehicle routing
• An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
• An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays
• Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
• A note on ``Efficient feasibility testing for dial-a-ride problems
• A unified heuristic for a large class of vehicle routing problems with backhauls
• A general heuristic for vehicle routing problems
• A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
• Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
• Efficient feasibility testing for dial-a-ride problems
• The balanced maximally diverse grouping problem with block constraints
• The dial-a-ride problem: Models and algorithms
• Variable neighborhood search for the dial-a-ride problem
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
• An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Solving the Dial-a-Ride problem using genetic algorithms
• Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Dynamic programming based metaheuristics for the dial-a-ride problem

This page was built for publication: An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization