Integrating local search and network flow to solve the inventory routing problem

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2002, Pages 9-14

  Lau, Hoong Chuin ^a   Liu, Qizhang ^b   Ono, Hirotaka ^c  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b ASPrecise Pte Ltd   (Singapore)

^c NONE

Author keywords

AI OR integration; Applications; Hybrid methods; Planning; Scheduling; Search

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; INVENTORY CONTROL; PLANNING; SCHEDULING; SENSITIVITY ANALYSIS;

INVENTORY ROUTING PROBLEM;

COMPUTATIONAL COMPLEXITY;

EID: 0036931048     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. R. K. Ahuja, T. L. Magnanti and J. B. Orlin, Network Flows: Theory, Algorithms and Applications, (Prentice-Hall, 1993).
2. A. Campbell, L. Clarke, A. J. Kleywegt, and M. W. P. Savelsbergh, The Inventory Routing Problem, in: T. G. Grainic and G. Laporte, eds., Fleet Management and Logistics, (Kluwer Academic Pub., 1998), 95-113.
3. M. W. Carter, J. M. Farvolden, G. Laporte, J. Xu, Solving an Integrated Logistics Problem Arising in Grocery Distribution, INFOR, 34:4 (1996), 290-306.
4. Y. Caseau and T. Kokeny, An Inventory Management Problem, The Constraints Journal, 3, (1998); 363-373.
5. L. M. Chan, A. Fedegruen and D. Simchi-Levi, Probabilistic Analysis and Practical Algorithms for Inventory-Routing Models, Oper. Res., 46:1 (1998) 96-106.
6. G. B. Dantzig, Application of the simplex method to a transportation problem, Activity Analysis and Production and Allocation, edited by T. C. Koopmans, (Wiley, 1951).
7. M. Florian, J. K. Lenstra, and A. H. G. Rinnooy Kan, Deterministic Production Planning: Algorithm and Complexity, Management Sc., 26:7 (1980), 669-679.
8. A. Fedegruen and P. Zipkin, An Efficient Algorithm for Computing Optimal (s,S) Policies, Operations Research, 22 (1984), 1268-1285.
9. F. Glover, Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems Discrete Applied Mathematics, 65, (1996) 223-253.
10. F. Glover and M. Laguna, Tabu Search, (Kluwer Academic Publishers, 1997).
11. S. C. Graves, A. H. G. Rinnooy Kan and P. H. Zipkin eds., Handbook in Operations Research and Management Science Vol 4: Logistics of Production and Inventory, (North-Holland, 1993).
12. J. Gu, Efficient Local Search for Very Large-Scale Satisfiability Problem, SIGART Bulletin, 3, (1992), 8-12.
13. D. S. Johnson, Local Optimization and the Traveling Salesman Problem, Proceedings of the 17th Colloquium on Automata, Languages and Programming (1990) 446-461.
14. H. C. Lau, A. Lim and Q. Z. Liu, Solving a Supply Chain Optimization Problem Collaboratively, Proc. 17th National Conf. on Artificial Intelligence (AAAI), (2000) 780-785.
15. M. W. P. Savelsbergh, Local Search for Routing Problems with Time Windows, Annals of Operations Research, 4, (1986), 285-305.
16. M. M. Solomon, Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints, Operations Research, 35, 1987, 254-265.
17. J. Xu and J. P. Kelly, A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem, Transporation Science, 30:4, (1996) 379-393.