Titre :

A new distance measure based on the exchange operator for the HFF-AVRP

Auteur(s) :

Kessaci, Marie-Eleonore [Auteur]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Jourdan, Laetitia [Auteur]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Dhaenens, Clarisse [Auteur]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]

Institution :

INRIA

Date de publication :

2010-04-22

Mot(s)-clé(s) :

distance
HFF-AVRP

Discipline(s) HAL :

Informatique [cs]/Mathématique discrète [cs.DM]
Computer Science [cs]/Operations Research [math.OC]
Informatique [cs]/Algorithme et structure de données [cs.DS]

Résumé en anglais : [en]

The Heterogeneous Fixed Fleet Asymmetric Vehicle Routing Prob- lem (HFF-AVRP) is a N P-hard optimization problem. Instances analysis and in particular, fitness landscape analysis, may help problem solving. Such anal- ysis ...
Lire la suite >The Heterogeneous Fixed Fleet Asymmetric Vehicle Routing Prob- lem (HFF-AVRP) is a N P-hard optimization problem. Instances analysis and in particular, fitness landscape analysis, may help problem solving. Such anal- ysis require the definition of a distance between feasible solutions. Such a dis- tance does not exist for the HFF-AVRP and this report aims at proposing a new distance measure defined from the exchange operator. In order to compute the exchange-distance between two solutions, four algorithms are suggested and then experimented. One of them is proved to be robust and to give the exact distance whereas others only compute an upper bound.Lire moins >

Langue :

Anglais

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL