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

Anita Agárdi, László Kovács, Tamás Bányai
Article abstract Keywords 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.
more » ... e 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. The VRP is a logistical problem, which deals with the delivery and picks up the products. In case of the basic problem the position of one depot, the position and demand of the customers, the number and capacity constraint of the transportation units (vehicles) are known in advance. The vehicles start their route at the depot. After that, visits some customers (satisfy their demand) and then return to the depot. The objective function is the minimization of the length of the route. Over the years, many VRP variations have been developed that adapt to each logistics task. In the following, some type of Vehicle Routing Problems are described. Capacity Constrained VRP [1] is a type when the vehicles have some capacity limit. The Single Depot VRP [2] is a VRP when the vehicles leave from a single depot. In case of Multi-Depot VRP [2], there are multiple depots. The vehicles leave the route from a depot, and after visited some customers, the vehicles return to the depot, from which they leaved. In the case of VRP with Inter-Depot Routes [3], the vehicles can return to any of the depots. Open VRP [4] is a type when the vehicles do not have to return to the depots. In the case of Environmentally
doi:10.21062/mft.2021.054 fatcat:zgbmxmw4kzgutnkbisc2dwt7bm