✦ LIBER ✦

A memetic algorithm for the open capacitated arc routing problem

✍ Scribed by Fung, Richard Y.K.; Liu, Ran; Jiang, Zhibin

Book ID: 118251498
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 452 KB
Volume: 50
Category: Article
ISSN: 1366-5545
DOI: 10.1016/j.tre.2012.11.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Memetic Algorithm for Periodic Capacit

A Memetic Algorithm for Periodic Capacitated Arc Routing Problem

✍ Yi Mei; Ke Tang; Xin Yao 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 461 KB

Decomposition-Based Memetic Algorithm fo

Decomposition-Based Memetic Algorithm for Multiobjective Capacitated Arc Routing Problem

✍ Yi Mei; Ke Tang; Xin Yao 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 1019 KB

BRKGA Algorithm for the Capacitated Arc

BRKGA Algorithm for the Capacitated Arc Routing Problem

✍ C. Martinez; I. Loiseau; M.G.C. Resende; S. Rodriguez 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 750 KB

Memetic Algorithm With Extended Neighbor

Memetic Algorithm With Extended Neighborhood Search for Capacitated Arc Routing Problems

✍ Ke Tang; Yi Mei; Xin Yao 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 322 KB

Competitive Memetic Algorithms for Arc R

Competitive Memetic Algorithms for Arc Routing Problems

✍ Philippe Lacomme; Christian Prins; Wahiba Ramdane-Cherif 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 247 KB

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.,