A Study of Inventory Routing Problem with Simultaneous Pickup and Delivery for the Distribution System by Applying Hybrid ImmunityTabu Search Algorithm
| Autor: | Jiun-De He, 何俊德 |
|---|---|
| Rok vydání: | 2012 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 100 Most literatures of Inventory-Routing problems find the solutions by simulation, rather than solve the real case problem of logistics firms. Furthermore, few of them consider pickup and delivery problems at the same time. Therefore, this research applies a real publishing logistics firm’s operating data to study the Inventory-Routing problem with simultaneous pickup and delivery (IRPSPD). We first develop a mathematical model for this proposed Inventory-Routing problem with simultaneous pickup and delivery (IRPSPD), then apply Savings method, 2-opt heuristic methods, and 1-1 interchange method to obtain the initial feasible solution, finally implement Hybrid Immunity Tabu Search Algorithm to find the optimal solution. The numerical examples are illustrated by applying this publishing logistics firm’s real operating data to acquire the optimal delivery routes, and related economic order quantities, optimal reorder points and customer service levels of the retail stores located in those proposed routes. Furthermore, the performance of this proposed method is compared with Savings method, heuristic approach, Tabu search and current routing planning implemented by this specific logistics company. Finally, the sensitivity analysis is also conducted base on parameters including the unit cost of returning goods, inventory carrying cost percentage, unit shortage cost, unit transportation cost, and vehicle capacity; the outcomes are showed to be very promising in many aspects and helpful to this logistics company for their future planning. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|