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...
保存先:
| 出版年: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| 主要な著者: | , |
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
International Journal of Combinatorial Optimization Problems and Informatics
2012
|
| 主題: | |
| オンライン･アクセス: | https://www.redalyc.org/articulo.oa?id=265224452002 |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|