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...
Bewaard in:
| Gepubliceerd in: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| Hoofdauteurs: | , |
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
International Journal of Combinatorial Optimization Problems and Informatics
2012
|
| Onderwerpen: | |
| Online toegang: | https://www.redalyc.org/articulo.oa?id=265224452002 |
| Tags: |
Geen labels, Wees de eerste die dit record labelt!
|