Dial-a-ride: A tentative resolution using a multi-objective resolution scheme based on ELS

Author

Lacomme, Philippe ; Quilliot, Alain ; Zhao, Xiagang

Author_Institution

Lab. d´´Inf. LIMOS, Aubiere, France

fYear

2009

fDate

6-9 July 2009

Firstpage

1100

Lastpage

1105

Abstract

The Dial-a-ride problem in designing vehicles trips to satisfy the pickup nodes and delivery nodes. Time-Windows are provided and represents user requirement in both pick-up nodes and delivery nodes. A fleet of homogeneous vehicles is assumed to be available at a depot node. The aim of DARP is to minimize cost and to improve quality of service. In this paper, the problem is multi-objective and an optimization scheme is defined to obtain satisfactory Pareto front. The local search strategy is based on Evolutionary Local Search (ELS) and the initial population is obtained thanks to a randomized greedy algorithm.

Keywords

Pareto distribution; evolutionary computation; greedy algorithms; randomised algorithms; transportation; Pareto front; delivery nodes; depot node; dial-a-ride problem; evolutionary local search; homogeneous vehicle; multiobjective resolution scheme; pickup nodes; quality of service; randomized greedy algorithm; time windows; vehicle trips; Costs; Greedy algorithms; Humans; NP-hard problem; Pareto optimization; Quality of service; Transportation; Vehicles; Dial-a-Ride problem; ELS; Split;

fLanguage

English

Publisher

ieee

Conference_Titel

Computers & Industrial Engineering, 2009. CIE 2009. International Conference on

Conference_Location

Troyes

Print_ISBN

978-1-4244-4135-8

Electronic_ISBN

978-1-4244-4136-5

Type

conf

DOI

10.1109/ICCIE.2009.5223774

Filename

5223774