Publication Type
Conference Proceeding Article
Version
acceptedVersion
Publication Date
2002
Abstract
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.
Discipline
Artificial Intelligence and Robotics | Business | Operations Research, Systems Engineering and Industrial Engineering
Publication
Proceedings of the 18th National Conference on Artificial Intelligence (AAAI), 28 July-1 August 2002, Edmonton, Cananda
First Page
9
Last Page
14
ISBN
9780262511292
Publisher
AAAI
City or Country
Edmonton, Canada
Citation
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.
Available at: https://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 International License.
Additional URL
http://www.aaai.org/Papers/AAAI/2002/AAAI02-002.pdf
Included in
Artificial Intelligence and Robotics Commons, Business Commons, Operations Research, Systems Engineering and Industrial Engineering Commons