A Study of Multi-depot Vehicle Routing Problem with Time Windows Constraint and Logistics Outsourcing Strategies

• Main Authors: Chiung-Hsuan Huang, 黃瓊萱
• Other Authors: Chih-Peng Chu
• Format: Others
• Language: zh-TW
• Published: 2007
• Online Access: http://ndltd.ncl.edu.tw/handle/6u6w3k

碩士 === 國立東華大學 === 全球運籌管理研究所 === 95 === With consideration to determinate delivery time of CVS, thesis models consider Hard Time Window constraints. Furthermore, fewer stores are located in farther areas from Distribution Center, so delivery cost of dealer’s acquisition vehicles back to original Distributer Center would not be economical. To solve this problem, a strategy is to let some store’s demands delivered by outsourcing logistics. Some store’s partial demands are delivered by both dealer’s acquisition vehicles and outsourcing logistics would surely have less delivery cost. Likely, we would also observe multiple distribution centers’ delivery combinations, which store would be served by acquisition vehicles with how much demand and how much demand might be outsourcing as well. For solving the problem, we propose liner programming models with solver of Lingo8.0 and MS Excel 2003. Besides, we also depitch demand and outsourcing delivery cost’s sensitivity analyses.