𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem

✍ Scribed by G. Laporte; Y. Nobert; S. Taillefer

Publisher
Elsevier Science
Year
1987
Weight
771 KB
Volume
9
Category
Article
ISSN
0270-0255

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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