A novel heuristic method to solve the capacitated arc routing problem
The capacitated arc routing problem is one of the most important routing problems with many applications in real world situations such as snow removing, winter gritting, refuse collection, etc. Since this problem is NP-hard, many of researchers have been developed numerous heuristics and metaheurist...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Growing Science
2012-10-01
|
Series: | International Journal of Industrial Engineering Computations |
Subjects: | |
Online Access: | http://www.growingscience.com/ijiec/Vol3/IJIEC_2012_58.pdf |