Abstract
The purpose of this paper is to determine the route of the vehicle routing problem with backhauls (VRPB), delivering new items and picking up the reused items or wastes, and resolve the inventory control decision problem simultaneously since the regular VRPB does not. Both the vehicle routing decision for delivery and pickup, and the inventory control decision affect each other and must be considered together. Hence, a mathematical model of vehicle routing problem with backhauls and inventory (VRPBI) is proposed. Since finding the optimal solution(s) for VRPBI is a NP-hard problem, this paper proposes a heuristic method, variable neighborhood tabu search (VNTS), adopting six neighborhood searching approaches to obtain the optimal solution. Moreover, this paper compares the proposed heuristic method with two other existing heuristic methods. The experimental results indicate that the proposed method is better than the two other methods in terms of average logistic cost (transportation cost and inventory cost).
Similar content being viewed by others
Abbreviations
- N:
-
Number of customers
- K:
-
Number of vehicles (or routes)
- b :
-
Vehicle capacity
- MaxSup :
-
Vehicle service capacity
- c :
-
Cost of dispatching vehicles
- cm :
-
Traveling cost/unit distance
- A d :
-
Delivery ordering cost/each order
- A r :
-
Pick-up ordering cost/each order
- h d :
-
Delivery holding cost/unit time/unit product
- h r :
-
Pick-up holding cost/unit time/unit product
- hs :
-
Delivery shortage cost/each time
- T p :
-
Pick-up shortage cost/each time
- g :
-
Index of customers (1 ≤ g ≤ N)
- h :
-
Index of customers (1 ≤ h ≤ N)
- i :
-
Index of customers (1 ≤ i ≤ N)
- k :
-
Index of vehicles or routes (1 ≤ k ≤ K)
- V k :
-
Customer set for route k (1 ≤ k ≤ K)
- Dis kgh :
-
Total distance for route k
- Q dkgh :
-
Number of units (delivery order quantity) serviceable for route k during each production run
- Q rkgh :
-
Number of units (pick-up order quantity) recoverable for route k during each production run
- UL kgh :
-
Average delivery demand for route k during lead time
- pl kgh :
-
Average pick-up demand for route k during lead time
- D kgh :
-
Total delivery demand for route k
- P kgh :
-
Total pick-up demand for route k
- D h :
-
Delivery demand for customer h
- P h :
-
Pick-up demand for customer h
- d h :
-
Delivery order quantity during each production run for customer h
- p h :
-
Pick-up order quantity during each production run for customer h
- R kgh :
-
Order-up-to level for delivery replenishment of route k
- PR kgh :
-
Order-up-to level for pick-up replenishment of route k
- f k :
-
The ratio of pick-up and delivery demands (or pick-up and delivery order quantity) for route k \({f_k =\frac{\sum\nolimits_g \sum\nolimits_h {P_{kgh}}} {\sum\nolimits_g \sum\nolimits_h D_{kgh}} = \frac{\sum\nolimits_g \sum\nolimits_h Q_{rkgh}} {\sum\nolimits_g \sum\nolimits_h Q_{dkgh}} }\)
- B(R kgh ):
-
Expected delivery shortage number for route k during each production run
- B(PR kgh ):
-
Expected pick-up shortage number for route k during each production run
- f L (x):
-
Probability density function for customer’s delivery demand, x, of each route during lead time L
- f L (y):
-
Probability density function for customer’s pick-up demand, y, of each route during lead time L
- x kgh :
-
1, if point g immediately precedes point h on route k; 0, otherwise
References
Alshamrani A., Mathur K., Ballou R.H. (2007) Reverse logistics: simultaneous design of delivery routes and returns strategies. Computers & Operations Research 34(2): 595–619
Baker B.M., Ayechew M.A. (2003) A genetic algorithm for the vehicle routing problem. Computers & Operations Research 30(5): 787–800
Bent R., Hentenryck P.V. (2006) A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Computers & Operations Research 33(4): 875–893
Bianchessi N., Righini G. (2007) Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Computers & Operations Research 34(2): 578–594
Brandao J. (2004) A tabu search algorithm for the open vehicle routing problem. European Journal of Operational Research 157(3): 552–564
Brandao J. (2006) A new tabu search algorithm for the vehicle routing problem with backhauls. European Journal of Operational Research 173(2): 540–555
Buscher U., Lindner G. (2007) Optimizing a production system with rework and equal sized batch shipments. Computers & Operations Research 34(2): 515–535
Cassani, L., & Righini, G. (2004). Heuristic algorithms for the TSP with rear-loading. Proceedings of the 35th Annual Conference of the Italian Operational Research Society, Lecce, Italy.
Chen J.F., Wu T.H. (2006) Vehicle routing problem with simultaneous deliveries and pickups. Journal of the Operational Research Society 57(5): 579–587
Crispim J., Brandao J. (2005) Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls. Journal of the Operational Research Society 56(11): 1296–1302
Dethloff J. (2001) Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up. OR Spectrum 23(1): 79–96
Fleischmann M., Kuik R. (2003) On optimal inventory control with independent stochastic item returns. European Journal of Operational Research 151(1): 25–37
Gendreau M., Guertin F., Potvin J.-Y., Seguin R. (2006) Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transportation Research 14(3): 157–174
Georgiadis P., Vlachos D. (2004) The effect of environmental parameters on product recovery. European Journal of Operational Research 157(2): 449–464
Guide V.D.R., Srivastava R. (1997) Repairable inventory theory: models and applications. European Journal of Operational Research 102(1): 1–20
Hadely G., Whitin T. (1963) Analysis of Inventory Systems. Prentice Hall, USA
Herer Y.T., Levy R. (1997) The metered inventory routing problem, an integrative heuristic algorithm. International Journal of Production Economics 51(1): 69–81
Hernandez-Perez H., Salazar-Gonzalez J.-J. (2004) Heuristics for the one-commodity pickup-and-delivery traveling salesman problem. Transportation Science 38(2): 245–255
Kara S., Rugrungruang F., Kaebernick H. (2007) Simulation modeling of reverse logistics networks. International Journal of Production Economics 106(1): 61–69
Koh S.-G., Hwang H., Sohn K.-I., Ko C.-S. (2002) An optimal ordering and recovery policy for reusable items. Computers & Industrial Engineering 43(1–2): 59–73
Lenstra J.K., Rinnooy Kan A.H.G. (1981) Complexity of vehicle routing and scheduling problems. Networks 11(2): 221–227
Olli B. (2003) A Reactive Variable neighborhood search for the vehicle-routing problem with time windows. INFORMS Journal on Computing 15(2): 347–357
Mabini M.C., Pintelon L.M., Gelders L.F. (1992) EOQ type formulations for controlling repairable inventories. International Journal of Production Economics 28(1): 21–33
Ropke S., Pisinger D. (2006) A unified heuristic for a large class of vehicle routing problems with backhauls. European Journal of Operational Research 171(3): 750–775
Savelsbergh M., Song J.-H. (2007) Inventory routing with continuous moves. Computers & Operations Research 34(6): 1744–1763
Song J.-H., Savelsbergh M. (2007) Performance measurement for inventory routing. Transportation Science 41(1): 44–54
Tang Montane F.A., Galvao R.D. (2006) A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Computers & Operations Research 33(3): 595–619
Teunter R. (2004) Lot-sizing for inventory systems with product recovery. Computers & Industrial Engineering 46(3): 431–441
Toth P., Vigo D. (1999) A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls. European Journal of Operational Research 113(3): 528–543
Van Breedam A. (2001) Comparing descent heuristics and metaheuristics for the vehicle routing problem. Computers & Operations Research 28(4): 289–315
Wade A.C., Salhi S. (2002) An investigation into a new class of vehicle routing problem with backhauls. Omega 30(6): 479–487
Zhong Y., Cole M.H. (2005) A vehicle routing problem with backhauls and time windows: a guided local search solution. Transportation Research 41(2): 131–144
Zhou Y.W., Wang S.D. (2007) Optimal production and shipment models for a single-vendor-single-buyer integrated system. European Journal of Operational Research 180(2): 309–328
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liu, SC., Chung, CH. A heuristic method for the vehicle routing problem with backhauls and inventory. J Intell Manuf 20, 29–42 (2009). https://doi.org/10.1007/s10845-008-0101-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10845-008-0101-9