𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for node-capacitated ring routing

✍ Scribed by András Frank; Zoltán Király; Balázs Kotnyek

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
158 KB
Volume
35
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

✦ Synopsis

A strongly polynomial time algorithm is described to solve the node-capacitated routing problem in an undirected ring network.

📜 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

Edge assembly-based memetic algorithm fo
Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
✍ Yuichi Nagata; Olli Bräysy 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB

## Abstract Vehicle routing problems are at the heart of most decision support systems for real‐life distribution problems. In vehicle routing problem a set of routes must be determined at lowest total cost for a number of resources (i.e., fleet of vehicles) located at one or several points (e.g.,