• English
    • français
  • Help
  •  | 
  • Contact
  •  | 
  • About
  •  | 
  • Login
  • HAL portal
  •  | 
  • Pages Pro
  • EN
  •  / 
  • FR
View Item 
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A new distance measure based on the exchange ...
  • BibTeX
  • CSV
  • Excel
  • RIS

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] refId
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Jourdan, Laetitia [Auteur] refId
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Dhaenens, Clarisse [Auteur] refId
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Institution :
INRIA
Publication date :
2010-04-22
Keyword(s) :
distance
HFF-AVRP
HAL domain(s) :
Informatique [cs]/Mathématique discrète [cs.DM]
Informatique [cs]/Recherche opérationnelle [cs.RO]
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 >
Language :
Anglais
Collections :
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Source :
Harvested from HAL
Files
Thumbnail
  • https://hal.inria.fr/inria-00475710/document
  • Open access
  • Access the document
Thumbnail
  • https://hal.inria.fr/inria-00475710/document
  • Open access
  • Access the document
Thumbnail
  • https://hal.inria.fr/inria-00475710/document
  • Open access
  • Access the document
Université de Lille

Mentions légales
Université de Lille © 2017