Title :
Cost balancing act of vehicle number to solve the Vehicle Routing Problem with time windows
Author :
Zelenka, Jan ; Didekova, Z.
Author_Institution :
Inst. of Inf., Bratislava, Slovakia
Abstract :
The Vehicle Routing Problem lies at the heart of distribution management. There are several versions of the problem, and a wide variety of exact and approximate algorithms have been proposed for its solution. This paper introduces a decision-making approach for selecting the optimal number of vehicles used in solving the vehicle routing problem with (without) time conditions. To solve the VRP problem, we use and modify the Ant Colony Optimization (ACO) algorithm.
Keywords :
ant colony optimisation; decision making; vehicle routing; ACO algorithm; VRP problem; ant colony optimization; approximate algorithms; cost balancing act; decision-making approach; distribution management; optimal vehicle number; time conditions; time windows; vehicle routing problem; Equations; Mathematical model; Online banking; Routing; Simulation; Vehicles;
Conference_Titel :
Intelligent Engineering Systems (INES), 2013 IEEE 17th International Conference on
Conference_Location :
San Jose
Print_ISBN :
978-1-4799-0828-8
DOI :
10.1109/INES.2013.6632829
