Solving the Multi-item Capacitated Location Routing Problem with Stochastic Demand and Pickup-Delivery Routes.

• Main Authors: Yue-Han Shiue, 薛月涵
• Other Authors: Shan-Huen Huang
• Format: Others
• Language: zh-TW
• Published: 2013
• Online Access: http://ndltd.ncl.edu.tw/handle/19419517641623214878

碩士 === 國立高雄第一科技大學 === 運籌管理研究所 === 101 === This paper considers an advanced capacitated location routing problem with pickup and delivery routes in which each customer contains stochastic multi-item demands. The pickup and delivery services need two fleets of vehicles and will form two different sets of routes. In addition, the stochastic multi-item demands will makes the vehicle routing part a multi-compartment vehicle routing problem with stochastic demand. To solve this combinatorial problem, a new solving process that employed Tabu search is proposed in this research. This proposed approach contains three stages including location selection, customer assignment, vehicle routing. The innovative concept is to divide all customers into assignment determined and assignment undetermined groups to narrow down the search area on solution domain so that the TABU search can be more effective and efficient. Two sets of benchmarks are generated to verify the quality of the proposed method. According to the output results of experiments, the proposed solving process can solve the problems and yield good solutions in reasonable computing time.