Ant Colony Algorithms For The Vehicle Routing Problem With Time Window, Period And Multiple Depots

@Article{mft-202104-0004,

author="Agardi, Anita

and Kovacs, Laszlo

and Banyai, Tamas",

title="Ant Colony Algorithms For The Vehicle Routing Problem With Time Window, Period And Multiple Depots",

journal="Manufacturing Technology Journal",

year="2021",

volume="21",

number="4",

pages="422--433",

keywords="vehicle routing problem; ant colony algorithms; improvement algorithms; construction algorithms",

abstract="Vehicle Routing Problem is a common problem in logistics, which can simulate in-plant and out-plant material handling. In the article, we demonstrate a Vehicle Routing Problem, which contains period, time window and multiple depots. In this case, customers must be served from several depots. The position of the nodes (depots and customers), the demand and time window of the customers are known in advance. The number and capacity constraint of vehicles are predefined. The vehicles leave from one depot, visit some customers and then return to the depot. The above-described vehicle routing is solved with construction algorithms and Ant Colony algorithms. The Ant Colony algorithms are used to improve random solutions and solutions generated with construction algorithms. According to the test results the Elitist Strategy Ant System and the Rank-Based Version of Ant System algorithms gave the best solutions.",

issn="12132489",

doi="10.21062/mft.2021.054",

url="https://journalmt.com/artkey/mft-202104-0004.php",

url="https://doi.org/10.21062/mft.2021.054"

}