A hybrid heuristic method for the periodic inventory routing problem

International Journal of Advanced Manufacturing Technology

Volumn 85, Issue 9-12, 2016, Pages 2345-2352

  Liu, Shu Chu ^a   Lu, Ming Che ^a   Chung, Chih Hung ^a  

^a NATIONAL PINGTUNG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Hybrid heuristic method; Large neighborhood search (LNS); NP hard problem; Particle swarm optimization (PSO); Periodic inventory routing problem (PIRP)

Indexed keywords

COMPUTATIONAL COMPLEXITY; NUMBER THEORY; OPTIMIZATION; PARTICLE SWARM OPTIMIZATION (PSO); POLYNOMIAL APPROXIMATION; SIMULATED ANNEALING; TABU SEARCH;

COMBINATORIAL PROBLEM; HYBRID HEURISTICS; INVENTORY POLICIES; INVENTORY ROUTING PROBLEMS; LARGE NEIGHBORHOOD SEARCH; LOCAL OPTIMAL SOLUTION; LOCAL OPTIMALITY; POLYNOMIAL-TIME;

HEURISTIC METHODS;

EID: 84947438640     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-015-8081-3     Document Type: Article

References (31)

1. Anderson H, Hoff A, Christiansen M, Hasle G, Lokketangen A (2010) Industrial aspect and literature survey: combined inventory management and routing. Comput Oper Res 37:1515–1536
2. Chih M (2015) Self-adaptive check and repair operator-based particle swarm optimization for the multidimensional knapsack problem. Appl Soft Comput 26:378–389
3. Choong F, Phon-Amnuaisuk S, Alias MY (2011) Metaheuristic methods in hybrid flow shop scheduling problem. Expert Syst Appl 38:10787–10793
4. Federgruen A, Zipkin P (1984) A combined vehicle routing and inventory allocation problem. Oper Res 32:1019–1037
5. Fu C, Fu Z (2010) Optimization on stochastic inventory-routing problem in multi-cycle two-echelon system. Comput Eng Appl 46:198–201
6. Gaur V, Fisher ML (2004) A periodic inventory routing problem at a supermarket chain. Oper Res 52:813–822
7. Golden B, Assad A, Dahl R (1984) Analysis of a large scale vehicle routing problem with an inventory component. Large Scale Syst 7:181–190
8. Hansen P, Mladenović N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130:449–467
9. Hansen P, Mladenović N (2010) Variable neighborhood search: methods and applications. Ann Oper Res 175:367–407
10. Jordehi AR, Jasni J (2013) Parameter selection in particle swarm optimisation: a survey. J Exp Theoret Artif Intell 24:527–542
11. Kiranyaz S, Pulkkinen J, Gabbouj M (2011) Multi-dimensional particle swarm optimization in dynamic environments. Expert Syst Appl 38:2212–2223
12. Küçükoğlu İ, Öztürk N (2015) An advanced hybrid meta-heuristic algorithm for the vehicle routing problem with backhauls and time windows. Comput Ind Eng 86:60–68
13. Lee YH, Jung JW, Lee KM (2006) Vehicle routing scheduling for cross-docking in the supply chain. Comput Ind Eng 51:247–256
14. Li JQ, Pan QK, Liang YC (2010) An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems. Comput Ind Eng 59:647–662
15. Liu S-C, Chen A-Z (2012) Variable neighborhood search for the inventory routing and scheduling problem in a supply chain. Expert Syst Appl 39:4149–4159
16. Liu S-C, Lin C-C (2005) A heuristic method for the combined location routing and inventory problem. Int J Adv Manuf Technol 26:372–381
17. Marinakis Y, Marinaki M, Dounias G (2010) A hybrid particle swarm optimization algorithm for the vehicle routing problem. Eng Appl Artif Intell 23:463–472
18. Mirabi M (2014) A hybrid electromagnetism algorithm for multi-depot periodic vehicle routing problem. Int J Adv Manuf Technol 71:509–518
19. Miyamoto Y, Kubo M (2001) Case study: the inventory routing for vending machines. J Oper Res Soc Jpn 44:378–389
20. Moin NH, Salhi S (2007) Inventory routing problems: a logistical overview. J Oper Res Soc 58:1185–1194
21. Qin L, Miao L, Qing FR, Zhang Y (2014) A local search method for periodic inventory routing problem. Expert Syst Appl 41:765–778
22. Shi Y, Eberhart R (1998) A modified particle swarm optimizer. IEEE World Congress on Computational Intelligence, Anchorage, AK, pp 69–73
23. Sindhuchao S, Romeijn HE, Akcali E, Boondiskulchok R (2005) An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity. J Glob Optim 32:93–118
24. Tasgetiren MF, Liang Y-C, Sevkli M, Gencyilmaz G (2007) A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. Eur J Oper Res 177:1930–1947
25. Vidal T, Crainic TG, Gendreau M, Prins C (2013) Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur J Oper Res 231:1–21
26. Wang Y, Ma X, Xu M, Liu Y, Wang Y (2015) Two-echelon logistics distribution region partitioning problem based on a hybrid particle swarm optimization–genetic algorithm. Expert Syst Appl 42:5019–5031
27. Wei L, Zhang Z, Zhang D, Lim A (2015) A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints. Eur J Oper Res 243:798–814
28. Zachariadis EE, Tarantilis CD, Kiranoudis CT (2014) An integrated local search method for inventory and routing decisions. Expert Syst Appl 36:10239–10248
29. Zhang Y, Qi M, Miao L, Liu E (2014) Hybrid metaheuristic solutions to inventory location routing problem. Transp Res E 70:305–323
30. Zhao Q, Wang SY, Lai KK (2007) A partition approach to the inventory/routing problem. Eur J Oper Res 177:786–802
31. Zhao Q, Chen S, Zang C (2008) Model and algorithm for inventory/routing decision in a three-echelon logistics system. Eur J Oper Res 191:623–635