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

Authors:
Sophie N. Parragh;Karl F. Doerner;Richard F. Hartl;Xavier Gandibleux
Affiliations:
Department of Business Administration, University of Vienna, Bruenner Strasse 72, 1210 Vienna, Austria;Department of Business Administration, University of Vienna, Bruenner Strasse 72, 1210 Vienna, Austria;Department of Business Administration, University of Vienna, Bruenner Strasse 72, 1210 Vienna, Austria;Laboratoire d'Informatique de Nantes Atlantique, Université de Nantes, 2, rue de la Houssiniere BP 92208, 44322 Nantes, France
Venue:
Networks - Route 2007
Year:
2009

Citing 0
Cited 4

A GRASP with evolutionary path relinking for the truck and trailer routing problem

Computers and Operations Research
Solving a dial-a-ride problem with a hybrid evolutionary multi-objective approach: Application to demand responsive transport

Applied Soft Computing
Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints

OR Spectrum
Customer-oriented school bus operations for childcare centers in Korea

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article, we develop a heuristic two-phase solution procedure for the dial-a-ride problem with two objectives. Besides the minimum cost objective a client centered objective has been defined. Phase one consists of an iterated variable neighborhood search-based heuristic, generating approximate weighted sum solutions; phase two is a path relinking module, computing additional efficient solutions. Results for two sets of benchmark instances are reported. For the smaller instances, exact efficient sets are generated by means of the ε-constraint method. Comparison shows that the proposed two-phase method is able to generate high-quality approximations of the true Pareto frontier. © 2009 Wiley Periodicals, Inc. NETWORKS, 2009