The full text of this article

 

New upper bounds for the multi-depot capacitated arc routing problem
by Ali Kansou, Adnan Yassine
International Journal of Metaheuristics (IJMHEUR), Vol. 1, No. 1, 2010

 

Abstract: The multi-depot capacitated arc routing problem (MD-CARP) generalises the well-known capacitated arc routing problem (CARP) by extending the single depot to a multi-depot network. The CARP consists of designing a set of vehicle trips, so that each vehicle starts and ends at the single depot. The MD-CARP involves the assignment of edges, which have to be served, to depots and the determination of vehicle trips for each depot. The first proposed work is based on ant colony optimisation (ACO) combined with an insertion heuristic: the ACO is used to optimise the order of insertion of the edges and the heuristic is devoted to inserting each edge in the solution. The second one is a memetic algorithm based on a special crossover. The computational results on benchmark instances show the satisfactory quality of the proposed methods and the superiority of the memetic algorithm compared to the ACO method.

Online publication date: Sat, 08-May-2010

 

is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

 
Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

 
Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Metaheuristics (IJMHEUR):
Login with your Inderscience username and password:

 

    Username:        Password:         

Forgotten your password?


 
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

 
If you still need assistance, please email subs@inderscience.com