Probabilistic traveling salesman problem with route duration restrictions

• Main Authors: Chiu-Kan Kuo, 郭秋泔
• Other Authors: Wei-Ming Wu
• Format: Others
• Language: zh-TW
• Published: 2004
• Online Access: http://ndltd.ncl.edu.tw/handle/92026628861996847528

碩士 === 國立高雄第一科技大學 === 運輸倉儲營運所 === 92 === For international express service industry, it is very import to delivery good efficiently. The efficiency of pick-up service is mainly influenced by the courier service route design and duty area partition. The presence of uncertain customer demand creates the need to design a priori tour instead of finding optimal tour everyday. This thesis focuses on route design for courier service. The objective is to minimize the probability of that the total tour duration exceeds the given duration constraints, with the strategy of service a random subset of customers in the same order as they appear in the a priori tour. This thesis clarifies the meanings of “Probabilistic Traveling Salesman Problem with Route Duration Restrictions (PTSP-DC)”and develops a mathematical model, as well as computationally feasible methods for obtains solutions in realistic situations. In a series of test problem, we solve this problem by Genetic Algorithms to produce a good approximate solution in a short time. In the case study, we find that the solution of PTSP-DC is not only better than the solution of PTSP but also the solution of TSP, in terms of the probability of that the total tour duration exceeds the given duration constraints.