𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Exact algorithms for routing problems under vehicle capacity constraints

✍ Scribed by Roberto Baldacci; Paolo Toth; Daniele Vigo

Publisher
Springer US
Year
2009
Tongue
English
Weight
705 KB
Volume
175
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Two exact algorithms for the vehicle rou
Two exact algorithms for the vehicle routing problem on trees
✍ Pontien Mbaraga; AndrΓ© Langevin; Gilbert Laporte πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 80 KB πŸ‘ 2 views

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 othe

An exact algorithm for the asymmetrical
An exact algorithm for the asymmetrical capacitated vehicle routing problem
✍ Gilbert Laporte; HΓ©lΓ¨ne Mercure; Yves Nobert πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 619 KB

The aim of this article is to develop an exact algorithm for the asymmetrical capacitated vehicle routing problem, i.e., the multiple traveling salesman problem subject to capacity restrictions. The problem is solved by means of a branch and bound tree in which subproblems are modified assignment pr