✦ LIBER ✦

Two exact algorithms for the vehicle routing problem on trees

✍ Scribed by Pontien Mbaraga; André Langevin; Gilbert Laporte

Publisher: John Wiley and Sons
Year: 1999
Tongue: English
Weight: 80 KB
Volume: 46
Category: Article
ISSN: 0894-069X
DOI: 10.1002/(sici)1520-6750(199902)46:1<75::aid-nav5>3.0.co;2-i

No coin nor oath required. For personal study only.

✦ Synopsis

This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacitated and time-constrained vehicle routing problems. One of the exact algorithms is based on the computation of bin packing lower bounds. The other uses column generation. The first algorithm performs better on problems containing small customer demands and in which all vehicles are identical. Otherwise, the second algorithm is more powerful and more versatile.

📜 SIMILAR VOLUMES

An exact algorithm for the batch sequenc

An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer

✍ A. Agnetis; F. Rossi; G. Gristina 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 295 KB 👁 2 views

This paper deals with the problem of makespan minimization in a flow shop with two machines when the input buffer of the second machine can only host a limited number of parts. Here we analyze the problem in the context of batch processing, i.e., when identical parts must be processed consecutively.