✦ LIBER ✦

New exact method for large asymmetric distance-constrained vehicle routing problem

✍ Scribed by Almoustafa, Samira; Hanafi, Said; Mladenović, Nenad

Book ID: 118150461
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 538 KB
Volume: 226
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2012.11.040

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two exact algorithms for the distance-co

Two exact algorithms for the distance-constrained vehicle routing problem

✍ Gilbert Laporte; Martin Desrochers; Yves Nobert 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 530 KB

Heuristics for Large Constrained Vehicle

Heuristics for Large Constrained Vehicle Routing Problems

✍ Yves Caseau; François Laburthe 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 117 KB

Approximation algorithms for distance co

Approximation algorithms for distance constrained vehicle routing problems

✍ Viswanath Nagarajan; R. Ravi 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 104 KB

A branch-and-bound algorithm for the asy

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

✍ G. Laporte; Y. Nobert; S. Taillefer 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 771 KB

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

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