Splitting algorithms for the multiple depot arc routing problem: application by ant colony optimization

This paper handles the Capacitated Arc Routing Problem with Multiple Depots (MDCARP). The well known CARP problem consists of designing a set of vehicle trips, so that each vehicle starts and ends at the single depot. The MDCARP on a mixed graph involves the assignment of tasks (arcs and edges), whi...

Descrizione completa

Salvato in:
Dettagli Bibliografici
Pubblicato in:International Journal of Combinatorial Optimization Problems and Informatics
Autori principali: Ali Kansou, Adnan Yassine
Natura: Artigo
Lingua:Inglês
Pubblicazione: International Journal of Combinatorial Optimization Problems and Informatics 2012
Soggetti:
Computación
MDCARP problem
insertion heuristic
ant colony optimization
Capacitated arc routing problem
Accesso online:https://www.redalyc.org/articulo.oa?id=265224452002
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !

Documenti analoghi