Comparison of neighborhoods for the HFF-AVRP

Author

Marmion, Marie-Eléonore ; Humeau, Jérémie ; Jourdan, Laetitia ; Dhaenens, Clarisse

Author_Institution

INRIA, Univ. de Lille 1, Villeneuve-d´´Ascq, France

fYear

2010

fDate

16-19 May 2010

Firstpage

1

Lastpage

7

Abstract

Vehicle Routing Problems (VRP) are widely studied as they represent challenges for the future. However, most of the routing problems encountered in the literature are quite far from real life problems. Therefore, this work will be dedicated to the Heterogeneous Fixed Fleet Asymmetric Vehicle Routing Problem (HFF-AVRP), a variant of the VRP, which is more common in real life distribution management than the basic VRP. HFF-AVRP is a NP-hard combinatorial optimization problem. Heuristics and in particular meta-heuristics are then candidate methods to solve such problems. As these methods are very sensitive to neighborhoods, we propose in this article to examine two classical neighborhoods associated to this problem in order to analyze their performances.

Keywords

combinatorial mathematics; computational complexity; optimisation; transportation; HFF-AVRP; NP hard combinatorial optimization problem; distribution management; neighborhoods comparison; vehicle routing problems; Benchmark testing; Genetic algorithms; Indexes; Optimization methods; Routing; Search methods; Vehicles; HFF-AVRP; metaheuristics; neighborhood;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Systems and Applications (AICCSA), 2010 IEEE/ACS International Conference on

Conference_Location

Hammamet

Print_ISBN

978-1-4244-7716-6

Type

conf

DOI

10.1109/AICCSA.2010.5586979

Filename

5586979