A hybrid heuristic for an inventory routing problem

INFORMS Journal on Computing

Volumn 24, Issue 1, 2012, Pages 101-116

  Archetti, Claudia ^a   Bertazzi, Luca ^a   Hertz, Alain ^b,c   Grazia Speranza, M ^a  

^a UNIVERSITY OF BRESCIA   (Italy)

^b ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

^c GERAD   (Canada)

Author keywords

Integer programming; Inventory routing problem; Metaheuristic; Optimization; Tabu search

Indexed keywords

CAPACITY CONSTRAINTS; DISCRETE TIME; HYBRID HEURISTICS; INVENTORY HOLDING; INVENTORY ROUTING PROBLEMS; METAHEURISTIC; MIXED-INTEGER PROGRAMMING; MULTI-PERIOD; OPTIMAL SOLUTIONS; REPLENISHMENT POLICY; SEARCH SCHEME; SET OF CUSTOMERS; STOCK-OUT; TRANSPORTATION COST;

CUSTOMER SATISFACTION; INTEGER PROGRAMMING; OPTIMIZATION; SALES; TABU SEARCH;

HEURISTIC PROGRAMMING;

EID: 84860914786     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1100.0439     Document Type: Article

References (19)

1. Archetti, C., L. Bertazzi, G. Laporte, M. G. Speranza. 2007. A branch-and-cut algorithm for a vendor-managed inventory routing problem. Transportation Sci. 41 (3) 382-391.
2. Bell, W. J., L. M. Dalberto, M. L. Fisher, A. J. Greenfield, R. G. Jaikumar, P. Kedia, R. G. Mack, P. J. Prutzman. 1983. Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces 13 (6) 4-23. (Pubitemid 14609903)
3. Bertazzi, L., G. Paletta, M. G. Speranza. 2002. Deterministic orderup-to level policies in an inventory routing problem. Transportation Sci. 36 (1) 119-132. (Pubitemid 34268737)
4. Bertazzi, L., M. G. Speranza, M. W. P. Savelsbergh. 2008. Inventory routing. B. Golden, R. Raghavan, E. Wasil, eds. The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, New York, 49-72.
5. Blumenfeld, D. E., L. D. Burns, J. D. Diltz, C. F. Daganzo. 1985. Analyzing trade-offs between transportation, inventory and production costs on freight networks. Transportation Res. B 19 (5) 361-380. (Pubitemid 16494187)
6. Campbell, A. M., L. Clarke, A. Kleywegt, M. W. P. Savelsbergh. 1998. The inventory routing problem. T. G. Crainic, G. Laporte, eds. Fleet Management and Logistics. Kluwer Academic Publishers, Boston, 95-113.
7. Cordeau, J.-F., G. Laporte, M. W. P. Savelsbergh, D. Vigo. 2009. Vehicle routing. C. Barnhart, G. Laporte, eds. Handbooks in Operations Research and Management Science: Transportation, Vol. 14. North-Holland, Amsterdam, 367-428.
8. Dror, M., M. Ball, B. Golden. 1985. A computational comparison of algorithms for the inventory routing problem. Ann. Oper. Res. 4 (1) 1-23.
9. Federgruen, A., D. Simchi-Levi. 1995. Analysis of vehicle routing and inventory-routing problems. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Handbooks in Operations Research and Management Science: Network Routing, Vol. 8. North-Holland, Amsterdam, 297-373.
10. Federgruen, A., P. Zipkin. 1984. A combined vehicle routing and inventory allocation problem. Oper. Res. 32 (5) 1019-1032.
11. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Company, New York.
12. Gendreau, M., A. Hertz, G. Laporte. 1994. A tabu search heuristic for the vehicle routing problem. Management Sci. 40 (10) 1276-1290.
13. Glover, F. 1986. Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13 (5) 533-549. (Pubitemid 17480188)
14. Glover, F., M. Laguna. 1997. Tabu Search. Kluwer Academic Publishers, Dordrecht, The Netherlands.
15. Golden, B., A. Assad, R. Dahl. 1984. Analysis of a large scale vehicle routing problem with an inventory component. Large Scale Systems 7 (2-3) 181-190. (Pubitemid 15456419)
16. Kellerer, H., U. Pferschy, D. Pisinger. 2004. Knapsack Problems. Springer-Verlag, Berlin.
17. Lin, S., B. W. Kernighan. 1973. An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21 (2) 498-516.
18. Martello, S., P. Toth. 1990 Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons, New York.
19. Taillard, E. 1991. Robust taboo search for the QAP. Parallel Comput. 17 (4-5) 443-455.