✦ LIBER ✦

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

✍ Scribed by R.J Petch; S Salhi

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 918 KB
Volume: 133
Category: Article
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(03)00434-7

No coin nor oath required. For personal study only.

✦ Synopsis

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 literature.

📜 SIMILAR VOLUMES

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 bi-criteria heuristic for the vehicle

A bi-criteria heuristic for the vehicle routing problem with time windows

✍ H.R.G. Van Landeghem 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 606 KB

A tabu search algorithm for the multi-tr

A tabu search algorithm for the multi-trip vehicle routing and scheduling problem

✍ José Brandão; Alan Mercer 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 907 KB

This paper describes a novel tabu search heuristic for the multi-trip vehicle routing and scheduling problem (MTVRSP). The method was developed to tackle real distribution problems, taking into account most of the constraints that appear in practice. In the MTVRSP, besides the constraints that are c

An overview of a heuristic for vehicle r

An overview of a heuristic for vehicle routing problem with time windows

✍ Fuh-hwa Franklin Liu; Sheng-yuan Shen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 321 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 reactive tabu search meta-heuristic fo

A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls

✍ Ibrahim H. Osman; Niaz A. Wassan 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 195 KB

The vehicle routing problem with back-hauls involves the design of a set of minimum cost routes, originating and terminating at a central depot, for a set of vehicles to service a set of customers with known quantities to be either delivered or collected. This paper describes two route-construction