A heuristic two-phase solution approach for the multi-objective dial-a-ride problem

DOI10.1002/net.20335zbMath1204.90096OpenAlexW4232385207WikidataQ59389687 ScholiaQ59389687MaRDI QIDQ3057122

Karl F. Doerner, Sophie N. Parragh, Xavier Gandibleux, Richard F. Hartl

Publication date: 24 November 2010

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20335

zbMATH Keywords

variable neighborhood searchpath relinkingbi-objective optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (17)

An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization ⋮ Event-based MILP models for ridepooling applications ⋮ The multi-objective generalized consistent vehicle routing problem ⋮ Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation ⋮ Multi-directional local search ⋮ Variable neighborhood search for the dial-a-ride problem ⋮ A matheuristic for tri-objective binary integer linear programming ⋮ The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment ⋮ Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems ⋮ A deterministic annealing local search for the electric autonomous dial-a-ride problem ⋮ Typology and literature review for dial-a-ride problems ⋮ A GRASP with evolutionary path relinking for the truck and trailer routing problem ⋮ Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints ⋮ Dynamic courier routing for a food delivery service ⋮ A survey on the applications of variable neighborhood search algorithm in healthcare management ⋮ Benchmarking online dispatch algorithms for emergency medical services ⋮ Objectives and methods in multi-objective routing problems: a survey and classification scheme

Uses Software

• SPEA2

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Pareto ant colony optimization: a metaheuristic approach to multiobjective portfolio selection
• Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
• Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
• The bi-objective covering tour problem
• The pickup and delivery problem: Faces and branch-and-cut algorithm
• Computation of ideal and Nadir values and implications for their use in MCDM methods.
• A population-based algorithm for solving linear assignment problems with two objectives
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• Ejection chains, reference structures and alternating path methods for traveling salesman problems
• Two phase algorithms for the bi-objective assignment problem
• The dial-a-ride problem: Models and algorithms
• Multi-objective vehicle routing problems
• Path relinking for the vehicle routing problem
• A genetic algorithm for a bi-objective capacitated arc routing problem
• An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• GRASP with Path Relinking for Three-Index Assignment
• Tabu search for a multi-objective routing problem
• 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: II. Routing
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• Heuristic Algorithms for the Handicapped Persons Transportation Problem
• A GRASP with path-relinking for private virtual circuit routing
• The General Pickup and Delivery Problem
• Multi‐objective combinatorial optimization problems: A survey
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows

This page was built for publication: A heuristic two-phase solution approach for the multi-objective dial-a-ride problem