Conference Proceeding Article
The inventory routing problem is one of important and practical problems in logistics. It involves the integration of inventory management and vehicle routing, both of which are known to be NP-hard. In this paper, we combine local search and network flows to solve the inventory management problem, by utilizing the minimum cost flow sub-solutions as a guiding measure for local search. We then integrate with a standard VRPTW solver to present experimental results for the overall inventory routing problem, based on instances extended from the Solomon benchmark problems.
Artificial Intelligence and Robotics | Business | Operations Research, Systems Engineering and Industrial Engineering
Intelligent Systems and Decision Analytics
Proceedings of the 18th National Conference on Artificial Intelligence (AAAI), 28 July-1 August 2002, Edmonton, Cananda
City or Country
LAU, Hoong Chuin; LIU, Q; and Ono, H..
Integrating Local Search and Network Flow to solve the Inventory Routing Problem. (2002). Proceedings of the 18th National Conference on Artificial Intelligence (AAAI), 28 July-1 August 2002, Edmonton, Cananda. 9-14. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1121
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.