✦ LIBER ✦

Augment-insert algorithms for the capacitated arc routing problem

✍ Scribed by Wen Lea Pearn

Book ID: 107950872
Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 1013 KB
Volume: 18
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(91)90089-a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A parallel insert method for the capacit

A parallel insert method for the capacitated arc routing problem

✍ Luc Chapleau; Jacques A. Ferland; Guy Lapalme; Jean-Marc Rousseau 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 317 KB

Heuristics for the periodic capacitated

Heuristics for the periodic capacitated arc routing problem

✍ Feng Chu; Nacima Labadi; Christian Prins 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 372 KB

New lower bounds for the Capacitated Arc

New lower bounds for the Capacitated Arc Routing Problem

✍ Wen Lea Pearn 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 518 KB

An improved heuristic for the capacitate

An improved heuristic for the capacitated arc routing problem

✍ Luís Santos; João Coutinho-Rodrigues; John R. Current 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 179 KB

The capacitated arc routing problem with

The capacitated arc routing problem with intermediate facilities

✍ Gianpaolo Ghiani; Gennaro Improta; Gilbert Laporte 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB

The capacitated arc routing problem with

The capacitated arc routing problem with refill points

✍ Alberto Amaya; André Langevin; Martin Trépanier 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 174 KB

This article introduces the capacitated arc routing problem with refill points (CARP-RP). The vehicle servicing arcs must be refilled on the spot by using a second vehicle. The problem consists on simultaneously determining the vehicles routes that minimize the total cost. An integer linear programm