𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solving the p-Center problem with Tabu Search and Variable Neighborhood Search

✍ Scribed by Nenad Mladenović; Martine Labbé; Pierre Hansen

Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
306 KB
Volume
42
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Tabu search heuristic for the vehicle
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
✍ Michel Gendreau; Manuel Iori; Gilbert Laporte; Silvaro Martello 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 233 KB

## Abstract This article addresses the well‐known Capacitated Vehicle Routing Problem (CVRP), in the special case where the demand of a customer consists of a certain number of two‐dimensional weighted items. The problem calls for the minimization of the cost of transportation needed for the delive

Large-scale local search heuristics for
Large-scale local search heuristics for the capacitated vertex p-center problem
✍ Maria Paola Scaparra; Stefano Pallottino; Maria Grazia Scutellà 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB

## Abstract This article investigates the application of very large neighborhood search techniques for solving the capacitated vertex __p__‐center problem. We characterize a local search neighborhood in terms of path and cyclic exchanges of customers among facilities, and exploit principles borrowe

Erratum: A Tabu search heuristic for the
Erratum: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
✍ Michel Gendreau; Manuel Iori; Gilbert Laporte; Silvano Martello 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 45 KB

In the article, "A Tabu Search Heuristic for the Vehicle Routing Problem with Two-Dimensional Loading Constraints" by M. Gendreau et al., which appeared in the January issue of Networks (Networks 51 (2008), 4-18), the last author's name was misspelled. Silvano Martello's name was inadvertently spell

A branch-and-price-based large neighborh
A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
✍ Eric Prescott-Gagnon; Guy Desaulniers; Louis-Martin Rousseau 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB

## Abstract Given a fleet of vehicles assigned to a single depot, the vehicle routing problem with time windows (VRPTW) consists of determining a set of feasible vehicle routes to deliver goods to a set of customers while minimizing, first, the number of vehicles used and, second, total distance tr