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.
| Original language | English |
|---|---|
| Pages | 9-14 |
| Number of pages | 6 |
| Publication status | Published - 2002 |
| Event | 18th National Conference on Artificial Intelligence (AAAI-02), 14th Innovative Applications of Artificial Intelligence Conference (IAAI-02) - Edmonton, Alta., Canada Duration: Jul 28 2002 → Aug 1 2002 |
Other
| Other | 18th National Conference on Artificial Intelligence (AAAI-02), 14th Innovative Applications of Artificial Intelligence Conference (IAAI-02) |
|---|---|
| Country/Territory | Canada |
| City | Edmonton, Alta. |
| Period | 7/28/02 → 8/1/02 |
All Science Journal Classification (ASJC) codes
- Software
- Artificial Intelligence