MA-ABC: a memetic algorithm optimizing attractiveness, balance, and cost for capacitated Arc routing problems
Abstract
References
Index Terms
- MA-ABC: a memetic algorithm optimizing attractiveness, balance, and cost for capacitated Arc routing problems
Recommendations
Memetic algorithm with extended neighborhood search for capacitated arc routing problems
The capacitated arc routing problem (CARP) has attracted much attention during the last few years due to its wide applications in real life. Since CARP is NP-hard and exact methods are only applicable to small instances, heuristic and metaheuristic ...
Decomposition-Based Memetic Algorithm for Multiobjective Capacitated Arc Routing Problem
The capacitated arc routing problem (CARP) is a challenging combinatorial optimization problem with many real-world applications, e.g., salting route optimization and fleet management. There have been many attempts at solving CARP using heuristic and ...
A genetic algorithm for a bi-objective capacitated arc routing problem
The capacitated arc routing problem (CARP) is a very hard vehicle routing problem for which the objective-in its classical form-is the minimization of the total cost of the routes. In addition, one can seek to minimize also the cost of the longest ...
Comments
Information & Contributors
Information
Published In

Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 103Total Downloads
- Downloads (Last 12 months)6
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in