| Summary: | 碩士 === 東吳大學 === 資訊管理學系 === 99 === Vehicle routing problem with time window has been the focus of many researchers recently and also proved to be NP-hard. In this thesis, a variety of heuristics are introduced and Solomon problems are used as basis for research. Through the detailed analysis of the customers’ geographical and time windows information, computations are made to generate dynamic parameters. Moreover, this research imported these parameters into a sequential tour-building algorithm for solutions. The results are further transformed to map the problem data. Finally, through the graphical display and chart analysis, the visualized solutions are presented to the users.
|
|---|
