A new distance measure based on the exchange ...
Document type :
Rapport de recherche
Title :
A new distance measure based on the exchange operator for the HFF-AVRP
Author(s) :
Kessaci, Marie-Eleonore [Auteur]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Jourdan, Laetitia [Auteur]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Dhaenens, Clarisse [Auteur]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]

Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Jourdan, Laetitia [Auteur]

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

Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Institution :
INRIA
Publication date :
2010-04-22
Keyword(s) :
distance
HFF-AVRP
HFF-AVRP
HAL domain(s) :
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]
Computer Science [cs]/Operations Research [math.OC]
Informatique [cs]/Algorithme et structure de données [cs.DS]
English abstract : [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 ...
Show more >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.Show less >
Show more >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.Show less >
Language :
Anglais
Collections :
Source :
Files
- https://hal.inria.fr/inria-00475710/document
- Open access
- Access the document
- https://hal.inria.fr/inria-00475710/document
- Open access
- Access the document
- https://hal.inria.fr/inria-00475710/document
- Open access
- Access the document
- document
- Open access
- Access the document
- RR-7263.pdf
- Open access
- Access the document