| Attributes | Values |
|---|
| rdf:type
| |
| rdfs:seeAlso
| |
| Description
| - The Multi-Depot Vehicle Routing Problem with Time Windows (MDVRP-TW) is a well-known optimization problem with many practical applications in a wide range of domains. The prima-ry goal is to find optimal routes for a set of vehicles starting from multiple depots to a number of customers. Each customer should be served only once and each vehicle returns to the origi-nal depot after visiting all customers along its route. Each vehicle can visit a customer only dur-ing its particular predefined time window. Also the condition of maximum vehicles’ load has to be met. There are many heuristic and metaheuristic algorithms proposed for this problem solu-tion (e.g. tabu search, simulated annealing, genetic algorithms) as this is a NP-hard problem and, therefore, exact methods are not feasible for more complex solutions. Another possibility is to apply the Ant Colony Optimization (ACO) theory to this problem. The authors successfully managed to adapt the ACO algorithm for the MDVRP-TW problem. The algorithm has been verified on a set of Cordeau’s test instances. In all tested cases, the solution found by our algo-rithm compared with the best solution known so far is not worse than 8%. In addition, the great advantage is that the algorithm is very fast as the key processes can be executed in parallel (e.g. on multiple cores of a processor). The article presents an original solution of authors to the MDVRP-TW problem via the ACO algorithm in detail. The first part deals with the algorithm including its principles and parameters. Then several examples and experiments are shown. The last part of the article shows conclusions and future work of the authors.
- The Multi-Depot Vehicle Routing Problem with Time Windows (MDVRP-TW) is a well-known optimization problem with many practical applications in a wide range of domains. The prima-ry goal is to find optimal routes for a set of vehicles starting from multiple depots to a number of customers. Each customer should be served only once and each vehicle returns to the origi-nal depot after visiting all customers along its route. Each vehicle can visit a customer only dur-ing its particular predefined time window. Also the condition of maximum vehicles’ load has to be met. There are many heuristic and metaheuristic algorithms proposed for this problem solu-tion (e.g. tabu search, simulated annealing, genetic algorithms) as this is a NP-hard problem and, therefore, exact methods are not feasible for more complex solutions. Another possibility is to apply the Ant Colony Optimization (ACO) theory to this problem. The authors successfully managed to adapt the ACO algorithm for the MDVRP-TW problem. The algorithm has been verified on a set of Cordeau’s test instances. In all tested cases, the solution found by our algo-rithm compared with the best solution known so far is not worse than 8%. In addition, the great advantage is that the algorithm is very fast as the key processes can be executed in parallel (e.g. on multiple cores of a processor). The article presents an original solution of authors to the MDVRP-TW problem via the ACO algorithm in detail. The first part deals with the algorithm including its principles and parameters. Then several examples and experiments are shown. The last part of the article shows conclusions and future work of the authors. (en)
|
| Title
| - Ant Colony Optimization Algorithm for Multi-Depot Vehicle Routing Problem with Time Windows
- Ant Colony Optimization Algorithm for Multi-Depot Vehicle Routing Problem with Time Windows (en)
|
| skos:prefLabel
| - Ant Colony Optimization Algorithm for Multi-Depot Vehicle Routing Problem with Time Windows
- Ant Colony Optimization Algorithm for Multi-Depot Vehicle Routing Problem with Time Windows (en)
|
| skos:notation
| - RIV/60162694:G42__/14:00519227!RIV15-MO0-G42_____
|
| http://linked.open...avai/riv/aktivita
| |
| http://linked.open...avai/riv/aktivity
| |
| http://linked.open...vai/riv/dodaniDat
| |
| http://linked.open...aciTvurceVysledku
| |
| http://linked.open.../riv/druhVysledku
| |
| http://linked.open...iv/duvernostUdaju
| |
| http://linked.open...titaPredkladatele
| |
| http://linked.open...dnocenehoVysledku
| |
| http://linked.open...ai/riv/idVysledku
| - RIV/60162694:G42__/14:00519227
|
| http://linked.open...riv/jazykVysledku
| |
| http://linked.open.../riv/klicovaSlova
| - Multi-Depot Vehicle Routing Problem with Time Windows; Ant Colony Optimization; Nature-inspired Algorithm (en)
|
| http://linked.open.../riv/klicoveSlovo
| |
| http://linked.open...ontrolniKodProRIV
| |
| http://linked.open...v/mistoKonaniAkce
| |
| http://linked.open...i/riv/mistoVydani
| |
| http://linked.open...i/riv/nazevZdroje
| - International Conference on Engineering and Applied Sciences Optimization (OPT-i 2014)
|
| http://linked.open...in/vavai/riv/obor
| |
| http://linked.open...ichTvurcuVysledku
| |
| http://linked.open...cetTvurcuVysledku
| |
| http://linked.open...UplatneniVysledku
| |
| http://linked.open...iv/tvurceVysledku
| |
| http://linked.open...vavai/riv/typAkce
| |
| http://linked.open.../riv/zahajeniAkce
| |
| issn
| |
| number of pages
| |
| http://purl.org/ne...btex#hasPublisher
| - National Technical University of Athens
|
| https://schema.org/isbn
| |
| http://localhost/t...ganizacniJednotka
| |
![[RDF Data]](/fct/images/sw-rdf-blue.png)
![[cxml]](/fct/images/cxml_doc.png)
![[csv]](/fct/images/csv_doc.png)
![[text]](/fct/images/ntriples_doc.png)
![[turtle]](/fct/images/n3turtle_doc.png)
![[ld+json]](/fct/images/jsonld_doc.png)
![[rdf+json]](/fct/images/json_doc.png)
![[rdf+xml]](/fct/images/xml_doc.png)
![[atom+xml]](/fct/images/atom_doc.png)
![[html]](/fct/images/html_doc.png)