Solving the p-center problem with tabu search and variable neighborhood search - Laboratoire d'informatique de l'école polytechnique Accéder directement au contenu
Article Dans Une Revue Networks Année : 2003

Solving the p-center problem with tabu search and variable neighborhood search

Résumé

The p-Center problem consists of locating p facilities and assigning clients to them in order to minimize the maximum distance between a client and the facility to which he or she is allocated. In this paper, we present a basic Variable Neighborhood Search and two Tabu Search heuristics for the p-Center problem without the triangle inequality. Both proposed methods use the 1-interchange (or vertex substitution) neighborhood structure. We show how this neighborhood can be used even more efficiently than for solving the p-Median problem. Multistart 1-interchange, Variable Neighborhood Search, Tabu Search, and a few early heuristics are compared on small- and large-scale test problems from the literature.

Dates et versions

hal-01255590 , version 1 (13-01-2016)

Identifiants

Citer

Nenad Mladenovic, Martine Labbé, Pierre Hansen. Solving the p-center problem with tabu search and variable neighborhood search. Networks, 2003, 42 (1), pp.48-64. ⟨10.1002/net.10081⟩. ⟨hal-01255590⟩
115 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More