%0 Journal Article
%T Two-Phase Heuristic for the Vehicle Routing Problem with Time Windows
%A S¨˘ndor Csisz¨˘r
%J Acta Polytechnica Hungarica
%D 2007
%I ?buda University
%X The subject of the paper is a complete solution for the vehicle routing problemwith time windows, an industrial realization of an NP hard combinatorial optimizationproblem. The primary objective ¨Cthe minimization of the number of routes- is aimed in thefirst phase, the secondary objective ¨Cthe travel distance minimization- is going to berealized in the second phase by tabu search. The initial route construction applies aprobability density function for seed selection. Guided Route Elimination procedure wasalso developed. The solution was tested on the Solomon Problem Set and seems to be verycompeitive with the best heuristics published in the latest years (2003-2005).
%K Metaheuristics
%K Vehicle routing problem
%K Time windows
%K Tabu search
%K Combinatorial optimization
%U http://uni-obuda.hu/journal/Csiszar_10.pdf