Probabilistic Multiple Traveling Salesman Problem with Route Duration Restrictions—Route Design of international express couriers

• Main Authors: Jung-Hua Wei, 魏榮樺
• Other Authors: Jeng-Rong Lin
• Format: Others
• Language: zh-TW
• Published: 2004
• Online Access: http://ndltd.ncl.edu.tw/handle/71782424398869567060

碩士 === 國立嘉義大學 === 運輸與物流工程研究所 === 94 === The purpose of this study is to plan tour for probabilistic traveling salesman problem with route duration restrictions. First and last, the purpose is to minimize cost, and routing plan which is the strategy of service a random subset of customers in the same orders as they appear in a priori tour. In this thesis, we formulate a model and use exhaust to deal with the probability of delay and routing of the expect length in single salesman. With the rise of customer, exhaust cannot be solved problem and assume the expect length to be a normal distribution. Under this case, we use the method of simulation to get appropriate sample to stand for population and use Chi Square to test to goodness of fit. In the routing plan of single salesman and multi salesman, we solve this problem by Genetic Algorithm and discuss the routing under then different penalty cost.