Show simple item record

dc.contributorGlardon, Rémy
dc.contributorZufferey, Nicolas
dc.contributor.authorFarres Rocabert, Jaime
dc.description.abstractThe algorithm developed in this work differs strongly from the other Ant algorithms in the literature both in the approach and in new elements introduced. For the way the solutions are built, the algorithm is called Extending Ant algorithm. The high-level procedure that governs the algorithm is quite classical (see Algorithm 1): in each generation, several feasible solutions are built; then, for the best solutions of the generation, three classical Local Search methods are applied (2-opt and forward and backward Or-exchange); and these solutions are used to update the Trail system indicating the likelihood of two customers being consecutive in the best solution. In addition, the minTrails value (used as threshold to switch to the 2nd phase of the construction procedure) and the probabilities for each route of the best solution to be copied into new solutions (at the beginning of the construction of every solution) are computed.
dc.publisherUniversitat Politècnica de Catalunya
dc.publisherÉcole Polytechnique Fédérale de Lausanne
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Optimització
dc.subject.lcshAnt algorithms
dc.titleUnconventional ant algorithms for vehicle routing
dc.typeBachelor thesis
dc.subject.lemacAlgorismes de formigues
dc.rights.accessRestricted access - author's decision
dc.audience.mediatorEscola Tècnica Superior d'Enginyeria Industrial de Barcelona
dc.provenanceAquest document conté originàriament altre material i/o programari no inclòs en aquest lloc web
dc.contributor.covenanteeÉcole polytechnique fédérale de Lausanne

Files in this item


This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder