Randomized local search for real-life inventory routing

Transportation Science

Volumn 45, Issue 3, 2011, Pages 381-398

  Benoist, Thierry ^a   Gardi, Frédéric ^a   Jeanjean, Antoine ^a   Estellonbertrand, Bertrand ^b  

^a Bouygues Telecom   (France)

^b AIX MARSEILLE UNIVERSITY   (France)

Author keywords

Decision support system; High performance algorithm engineering; Logistics; Randomized local search; Real life inventory routing

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL EFFICIENCY; LOCAL SEARCH (OPTIMIZATION); LOGISTICS; OPTIMIZATION; TRANSPORTATION ROUTES; VEHICLE ROUTING;

ASSIGNMENT ALGORITHMS; COMPUTATIONAL STUDIES; CONSTRUCTIVE ALGORITHMS; HIGH-PERFORMANCE ALGORITHM ENGINEERING; INVENTORY ROUTING; INVENTORY ROUTING PROBLEMS; RANDOMIZED LOCAL SEARCH; VEHICLE ROUTING PROBLEMS;

DECISION SUPPORT SYSTEMS;

EID: 79955769626     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1100.0360     Document Type: Article

References (21)

1. Aarts, E., J. Lenstra. 1997. Local Search in Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Chichester, UK.
2. Archetti, C., M. Savelsbergh. 2007. The truckload trip scheduling problem. TRISTAN VI, the 6th Triennial Sympos. Transportation Anal., Phuket Island, Thailand.
3. Bard, J. F., L. Huang, M. Dror, P. Jaillet. 1998. A branch and cut algorithm for the VRP with satellite facilities. IIE Trans. 30(9) 831-834.
4. Bell, W., L. Dalberto, M. Fisher, A. Greenfield, R. Jaikumar, P. Kedia, R. Mack, P. Prutzman. 1983. Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces 13(6) 4-23. (Pubitemid 14609903)
5. Benoist, T., B. Estellon, F. Gardi, A. Jeanjean. 2009. High-performance local search for solving inventory routing problems. H. H. Hoos, T. Stützle, M. Birattari, eds. SLS 2009, the 2nd Internat. Workshop Engrg. Stochastic Local Search Algorithms, Lecture Notes in Computer Science, Vol. 5752. Springer, Berlin/ Heidelberg, 105-109.
6. Campbell, A., M. Savelsbergh. 2004a. A decomposition approach for the inventory-routing problem. Transportation Sci. 38(4) 488-502.
7. Campbell, A., M. Savelsbergh. 2004b. Delivery volume optimization. Transportation Sci. 38(2) 210-223.
8. Campbell, A., M. Savelsbergh. 2004c. Efficient insertion heuristics for vehicle routing and scheduling problems. Transportation Sci. 38(3) 369-378.
9. Campbell, A., L. Clarke, M. Savelsbergh. 2002. Inventory routing in practice. P. Toth, D. Viego, eds. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Vol. 9. SIAM, Philadelphia, 309-330.
10. Campbell, A., L. Clarke, A. Kleywegt, M. Savelsbergh. 1998. The inventory routing problem. T. Crainic, G. Laporte, eds. Fleet Management and Logistics. Kluwer Academic Publishers, Norwell, MA, 95-113.
11. Cormen, T., C. Leiserson, R. Rivest, C. Stein. 2004. Introduction á l'Algorithmique, French 2nd ed. Dunod, Paris, France.
12. Dror, M., M. Ball. 1987. Inventory/routing: reduction from an annual to a short-period problem. Naval Res. Logist. 34(6) 891-905. (Pubitemid 18520153)
13. Estellon, B., F. Gardi, K. Nouioua. 2006. Large neighborhood improvements for solving car sequencing problems. RAIRO Oper. Res. 40(4) 355-379. (Pubitemid 46384505)
14. Estellon, B., F. Gardi, K. Nouioua. 2008. Two local search approaches for solving real-life car sequencing problems. Eur. J. Oper. Res. 191(3) 928-944.
15. Estellon, B., F. Gardi, K. Nouioua. 2009. High-performance local search for task scheduling with human resource allocation. H. H. Hoos, T. Stützle, M. Birattari, eds. SLS 2009, the 2nd Internat. Workshop Engrg. Stochastic Local Search Algorithms, Lecture Notes in Computer Science, Vol. 5752. Springer, Berlin/ Heidelberg, 1-15.
16. Feo, T., G. Resende. 1995. Greedy randomized adaptive search procedures. J. Global Optim. 6(2) 109-133.
17. Lau, H., Q. Liu, H. Ono. 2002. Integrating local search and network flow to solve the inventory routing problem. AAAI 2002, the 18th National Conference on Artificial Intelligence. AAAI Press, Menlo Park, CA, 9-14.
18. Savelsbergh, M., J.-H. Song. 2007a. Inventory routing with continuous moves. Comput. Oper. Res. 34(6) 1744-1763. (Pubitemid 44556973)
19. Savelsbergh, M., J.-H. Song. 2007b. Performance measurement for inventory routing. Transportation Sci. 41(1) 44-54. (Pubitemid 46652903)
20. Savelsbergh, M., J.-H. Song. 2008. An optimization algorithm for the inventory routing with continuous moves. Comput. Oper. Res. 35(7) 2266-2282. (Pubitemid 350161138)
21. Solomon, M. 1987. Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2) 254-265. (Pubitemid 17652588)