Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/8B88C9BC-6FD5-48EE-87DE-539B84EEBCA8 | ||
| Year | 2023 | ||
| Type of Item | Diploma Work | ||
| License |
|
||
| Bibliographic Citation | Pavlos-Georgios Michalakis, "Ant colony optimization for the close-open vehicle routing problem", Diploma Work, School of Production Engineering and Management, Technical University of Crete, Chania, Greece, 2023 https://doi.org/10.26233/heallink.tuc.98998 | ||
| Appears in Collections |
The close-open vehicle routing problem is a variation of the open vehicle routing problem vehicle routing problem. It is about a vehicle routing problem with limited capacity, transit and customer service times and multiple returns to the depot where, in addition, a vehicle may exhaust the available service time without an obligation to return to the depot, leaving the route 'open'. A fairly effective technique in solving vehicle routing problems is the ant colony optimization algorithm. This algorithm is based on the the way ants in a colony behave when searching for food. There are several variations of the ant colony optimization algorithm. The ant colony optimization algorithm can be used in combination with other local search algorithms, achieving better results.
Copyright © DIAS 2013
