Resolving Vehicle Routing Problem for Reverse Logistics using Edge Coloring

• Main Authors: Yi-Xiang Liao, 廖翌翔
• Other Authors: Wei-Min Jeng
• Format: Others
• Language: zh-TW
• Published: 2008
• Online Access: http://ndltd.ncl.edu.tw/handle/10614347090410814864

碩士 === 東吳大學 === 資訊科學系 === 96 === The vehicle routing problem with time windows constraints belongs to an optimization problem with a constraint assembly of large scale, nonlinear and mixed-integer, and while the problem scale is becoming larger, the operating time needed for a solution is becoming longer as well, or even there is probably no way to obtain the optimum solution. Currently, the vehicle routing problems mostly focus on the field of forward logistics, not much on the studies of reverse logistics. Therefore, the present study presents an Iterative Heuristic Algorithm combined with coloring theory and minimum cost algorithm strategy, utilizing the concept of vertex coloring in the coloring theory and link defining constraints in the route planning so as to construct a route map graph, meanwhile, performing a coloring ocess on this graph along with to the Minimum Cost Algorithm in order to compute a service route of minimum total cost containing the original travel cost plus a penalty cost which was generated due to the violation oftime windows, so that it can be used as an important basis for planning the vehicle routing in reverse logistics, and in addition, utilizing the Iterative Algorithm Method to improve the solution quality and efficiency.