Effective local search approaches for the single-vehicle cyclic inventory routing problem

International Journal of Services Operations and Informatics

Volumn 7, Issue 4, 2012, Pages 260-279

  Zhong, Yiqing ^a   Aghezzaf, El Houssaine ^a  

^a GHENT UNIVERSITY   (Belgium)

Author keywords

Heuristics; Inventory routing; Iterated local search; Nonlinear mixed integer programming

Indexed keywords

LOCAL SEARCH (OPTIMIZATION); SALES; TRANSPORTATION ROUTES;

HEURISTICS; INVENTORY ROUTING; ITERATED LOCAL SEARCH; LINEAR CONSTRAINTS; MIXED-INTEGER PROGRAMS; NON-LINEAR MIXED INTEGER PROGRAMMING; NONLINEAR OBJECTIVE FUNCTIONS; OPTIMISATION MODELS;

INTEGER PROGRAMMING;

EID: 84874477079     PISSN: 1741539X     EISSN: 17415403     Source Type: Journal    
DOI: 10.1504/IJSOI.2012.052179     Document Type: Article

References (23)

1. Aghezzaf, E.H., Raa, B. and Van Landeghem, H. (2006) 'Modeling inventory routing problems in supply chains of high consumption products', European Journal of Operation Research, Vol. 169, No. 3, pp.1048-1063. (Pubitemid 41492032)
2. Aghezzaf, E.H., Zhong, Y.Q., Raa, B. and Mateo, M. (2011) 'Analysis of the single-vehicle cyclic inventory routing problem', International Journal of Systems Science, iFirst: 1-10. DOI: 10.1080/00207721.2011.564321.
3. Ahuja Ravindra, K., Ergun, O. and Orlin James, B. (2002) 'A survey of very large-scale neighborhood search techniques', Discrete Applied Mathematics, Vol. 123, pp.75-102.
4. Anily, S. and Federgruen, A. (1991) 'Rejoinder to one warehouse multiple retailer systems with vehicle routing costs', Management Science, Vol. 37, No. 11, pp.1497-1499.
5. Aarts Emile, H.L. and Jan Lenstra, K. (1997) Local Search in Combinatorial Optimization, Wiley, Chichester, UK.
6. Bard, J., Huang, L., Jaillet, P. and Dror, M. (1998) 'A decomposition approach to the inventory routing problem with satellite facilities', Transportation Science, Vol. 32, pp.189-203. (Pubitemid 128609393)
7. Benoist, T., Estellon, B., Gardi, F. and Jeanjean, A. (2009) 'High-performance local search for solving real-life inventory routing problems', 2nd International Workshop on Engineering Stochastic Local Search (SLS2009), Brussels, Belgium, pp.105-109.
8. Congram, R.K. (2000) Polynomially Searchable Exponential Neighborhood for Sequencing Problems in Combinatorial Optimization, PhD Thesis, University of Southampton, UK.
9. Congram, R.K., Potts Chris, N. and Van De Velde Steef, L. (2002) 'An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem', INFORMS Journal on Computing, Vol. 14, No. 1, pp.52-67.
10. Funke, B., Grunert, T. and Irnich, S. (2005) 'Local search for vehicle routing and scheduling problems: review and conceptual integration', Journal of Heuristics, Vol. 11, pp.267-306. (Pubitemid 41261193)
11. Hansen, P., Mladenovic, N. and Moreno Perez Jose, A. (2010) 'Variable neighbourhood search: methods and applications', Annal Operation Research, Vol. 175, pp.367-407.
12. Johnson, D.S. (1990) 'Local optimization and the traveling salesman problem', LNCS, Vol. 443, Springer, Berlin, pp.446-461.
13. Kay, M.G. (2010) Matlog: Logistics Engineering Matlab Toolbox. Available online at: http://www.ise.ncsu.edu/kay/matlog
14. Lau, H.C., Liu, Q.Z. and Ono, H. (2002) 'Integrating local search and network flow to solve the inventory routing problem', 18th National Conference of Artificial Intelligence (AAAI-02), Menlo Park, Canada, pp.9-14.
15. Li, Y.F., Li, J. and Zhao, D. (2007) 'The intelligent iterated local search methods for the basic vehicle routing problem', Systems Engineering-Theory & Practice, Vol. 5, pp.75-81. (in Chinese) (Pubitemid 46947560)
16. Lin, S. and Kernighan, B.W. (1973) 'An effective heuristic algorithm for the traveling-salesman problem', Operations Research, Vol. 21, pp.498-516.
17. Lourenco, H.R., Martin, O. and Stutzle, T. (2002) 'A beginner's introduction to iterated local search', 4th Metaheuristics International Conference (MIC'2001), Porto, Portugal, pp.1-6.
18. Lourenco, H.R. (2003) 'Iterated local search', Handbook of Metaheuristics, Vol. 57, Springer, New York, USA, pp.320-353.
19. Potvin, J.Y., Lapalme, G. and Rousseau, J.M. (1989) 'A generalized k-opt exchange procedure for the MTSP', Information Systems and Operations Research, Vol. 27, No. 4, pp.474-481.
20. Raa, B. and Aghezzaf, E.H. (2009) 'A practical solution approach for the cyclic inventory routing problem', European Journal of Operational Research, Vol. 192, No. 2, pp.429-441.
21. Rego, C. and Glover, F. (2004) 'Local search and metaheuristics', Combinatorial Optimization: The Traveling Salesman Problem and Its Variations, Vol. 12, Dordrecht, Kluwer, pp.309-368.
22. Taarit, N.B., Hadj-Alouane, A.B. and Zaghal Mansour, F. (2010) 'A lagangian heuristic method and an iterative approach for the inventory routing problem', 8th International Conference of Modeling and Simulation (MOSIM'10), Hammamet, Tunisia.
23. Tang, L.X. and Wang, X.P. (2006) 'Iterated local search algorithm based on very large-scale neighborhood for prize-collecting vehicle routing problem', International Journal of Advanced Manufacturing Technology, Vol. 29, pp.1246-1258.