全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Two-Phase Heuristic for the Vehicle Routing Problem with Time Windows

Keywords: Metaheuristics , Vehicle routing problem , Time windows , Tabu search , Combinatorial optimization

Full-Text   Cite this paper   Add to My Lib

Abstract:

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 –the minimization of the number of routes- is aimed in thefirst phase, the secondary objective –the 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).

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133