Motorcycle-courier Routing Problems in Urban Areas – Multi-objective m-TSP with Time Windows

• Main Authors: Hui-Mei Yen, 顏慧美
• Other Authors: Tsung-Sheng Chang
• Format: Others
• Language: zh-TW
• Published: 2009
• Online Access: http://ndltd.ncl.edu.tw/handle/92114524897916044801

碩士 === 國立東華大學 === 全球運籌管理研究所 === 97 === The Motorcycle-courier is a new type of express service which develops due to the commercial characteristics of urban districts. In this thesis, we focus on the Motorcycle-courier industry and discuss how to plan distribution routes inside a specific district for the Motorcycle-courier based on the road network of Taipei City. In our research, we need to use a fixed number of motorcycles and to satisfy all customer time windows to establish the distribution routes with both balanced workload objective and minimum total working time objective. We utilize the difference between the maximum and minimum motorcycle working time to represent the value of balanced workload. We must note that the concept of balanced workload is rarely discussed in the related routing problems. There are two main topics in this research, that is: (1) we can reduce the size of the problem by combining customer nodes which are on the same side of one road segment and having the overlapping time windows, and (2) we can solve the multi-objective multiple traveling salesman problem with time windows by the information we obtained from (1). Then we aim at the two topics to not only develop mathematical models but also apply the Merge algorithm and Multi-Objective Scatter Search (MOSS) to solve the topics. From the MOSS, we can obtain a set of Pareto solutions and can provide decision makers to decide the suitable distribution plan. In the MOSS, we apply the Multi-objective Tabu Search (MOTS) as a local search tools; we further combine a Pseudo-exchange method to enhance the improvement method of MOSS. Testing results show that our algorithms have the ability to solve the two topics efficiently.