✦ LIBER ✦

A heuristic and lower bound for a multi-depot routing problem

✍ Scribed by Robert T. Sumichras; Ina S. Markham

Book ID: 107950939
Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 653 KB
Volume: 22
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(94)00083-k

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Heuristic and lower bound for a stochast

Heuristic and lower bound for a stochastic location-routing problem

✍ Maria Albareda-Sambola; Elena Fernández; Gilbert Laporte 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 311 KB

A tabu search heuristic for the multi-de

A tabu search heuristic for the multi-depot vehicle routing problem

✍ Jacques Renaud; Gilbert Laporte; Fayez F. Boctor 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 605 KB

A tabu search heuristic for periodic and

A tabu search heuristic for periodic and multi-depot vehicle routing problems

✍ Cordeau, Jean-Fran�ois; Gendreau, Michel; Laporte, Gilbert 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 1 views

We propose a tabu search heuristic capable of solving three well-known routing problems: the periodic vehicle routing problem, the periodic traveling salesman problem, and the multi-depot vehicle routing problem. Computational experiments carried out on instances taken from the literature indicate t

A two-phase heuristic method for the mul

A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration

✍ S.C. Liu; S.B. Lee 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 386 KB

Heuristic and exact algorithms for the m

Heuristic and exact algorithms for the multi-pile vehicle routing problem

✍ Fabien Tricoire; Karl F. Doerner; Richard F. Hartl; Manuel Iori 📂 Article 📅 2009 🏛 Springer 🌐 German ⚖ 348 KB

A multi-phase constructive heuristic for

A multi-phase constructive heuristic for the vehicle routing problem with multiple trips

✍ R.J Petch; S Salhi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 918 KB

An extension to the classical vehicle routing problem where vehicles can be assigned more than one route within a working time period is investigated. A multi-phase constructive heuristic, which is enhanced by suitable data structure, is proposed. Results are given comparing to benchmarks from the l