✦ LIBER ✦

Competitive Memetic Algorithms for Arc Routing Problems

✍ Scribed by Philippe Lacomme; Christian Prins; Wahiba Ramdane-Cherif

Book ID: 111570899
Publisher: Springer US
Year: 2004
Tongue: English
Weight: 247 KB
Volume: 131
Category: Article
ISSN: 0254-5330
DOI: 10.1023/b:anor.0000039517.35989.6d

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

A memetic algorithm for the open capacit

A memetic algorithm for the open capacitated arc routing problem

✍ Fung, Richard Y.K.; Liu, Ran; Jiang, Zhibin 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 452 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

Evolutionary algorithms for periodic arc

Evolutionary algorithms for periodic arc routing problems

✍ Philippe Lacomme; Christian Prins; Wahiba Ramdane-Chérif 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 376 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.,