Vehicle Routing Problem with Time Windows for Perishable Products
| Autor: | Thi Thuy Linh Nguyen, 阮書琳 |
|---|---|
| Rok vydání: | 2016 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 104 This study presents a variant of Vehicle Routing Problem with Time Windows (VRPTW) by considering the delivery process of perishable products. The quality and quantity of perishable products are critical when they decay while in transit. Due to this property- the product freshness as a function of time, each vehicle must finish the delivery process to ensure that products are still in good condition. The problem is called the Vehicle Routing Problem with Time Windows for Perishable Products (VRPTWPP). The objective of VRPTWPP is to find a set of delivery routes to serve customers with known geographical locations and demands while minimizing total travel cost under time window restrictions, product shelf-life, and loading and unloading service time restrictions at customer sites. A mixed integer programming model is formulated for the problem and a Simulated Annealing (SA) heuristic is developed to solve the proposed model. The proposed SA algorithm is tested on small and large size VRPTWPP instances adapted from well-known VRPTW benchmark data. Results shows that the proposed SA algorithm efficiently and effectively solves the VRPTWPP. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|