Please use this identifier to cite or link to this item:
|Title:||Integrating local search and network flow to solve the inventory routing problem||Authors:||Lau, H.C.
|Issue Date:||2002||Citation:||Lau, H.C.,Liu, Q.,Ono, H. (2002). Integrating local search and network flow to solve the inventory routing problem. Proceedings of the National Conference on Artificial Intelligence : 9-14. ScholarBank@NUS Repository.||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.||Source Title:||Proceedings of the National Conference on Artificial Intelligence||URI:||http://scholarbank.nus.edu.sg/handle/10635/39978|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 22, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.