✦ LIBER ✦

A novel membrane algorithm for capacitated vehicle routing problem

✍ Scribed by Niu, Yunyun; Wang, Shuo; He, Juanjuan; Xiao, Jianhua

Book ID: 121802990
Publisher: Springer
Year: 2014
Tongue: English
Weight: 719 KB
Volume: 19
Category: Article
ISSN: 1432-7643
DOI: 10.1007/s00500-014-1266-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimised crossover genetic algorithm fo

Optimised crossover genetic algorithm for capacitated vehicle routing problem

✍ Habibeh Nazif; Lai Soon Lee 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 324 KB

A branch and bound algorithm for the cap

A branch and bound algorithm for the capacitated vehicle routing problem

✍ G. Laporte; Y. Nobert 📂 Article 📅 1983 🏛 Springer 🌐 German ⚖ 643 KB

EVE-OPT: a hybrid algorithm for the capa

EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem

✍ Guido Perboli; Ferdinando Pezzella; Roberto Tadei 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 420 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

A new branch-and-cut algorithm for the c

A new branch-and-cut algorithm for the capacitated vehicle routing problem

✍ Jens Lysgaard; Adam N. Letchford; Richard W. Eglese 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 203 KB