ML Anthology

Integrating Local Search and Network Flow to Solve the Inventory Routing Problem

Hoong Chuin Lau, Qi Zhang Liu, Hirotaka Ono
AAAI 2002 pp. 9-14
doi:10.5555/777092.777097 /aaai/2002/lau2002aaai-integrating/

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.

PDF AAAI Semantic Scholar

Cite

Text

Lau et al. "Integrating Local Search and Network Flow to Solve the Inventory Routing Problem." AAAI Conference on Artificial Intelligence, 2002. doi:10.5555/777092.777097

Markdown

[Lau et al. "Integrating Local Search and Network Flow to Solve the Inventory Routing Problem." AAAI Conference on Artificial Intelligence, 2002.](https://mlanthology.org/aaai/2002/lau2002aaai-integrating/) doi:10.5555/777092.777097

BibTeX

@inproceedings{lau2002aaai-integrating,
  title     = {{Integrating Local Search and Network Flow to Solve the Inventory Routing Problem}},
  author    = {Lau, Hoong Chuin and Liu, Qi Zhang and Ono, Hirotaka},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2002},
  pages     = {9-14},
  doi       = {10.5555/777092.777097},
  url       = {https://mlanthology.org/aaai/2002/lau2002aaai-integrating/}
}