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

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

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, b...

Full description

Saved in:
Bibliographic Details
Main Authors: LAU, Hoong Chuin, LIU, Q, Ono, H.
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2002
Subjects:
Artificial Intelligence and Robotics
Business
Operations Research, Systems Engineering and Industrial Engineering
Online Access:https://ink.library.smu.edu.sg/sis_research/1121
https://ink.library.smu.edu.sg/context/sis_research/article/2120/viewcontent/AAAI02_NetflowsLS.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
Description
Summary: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.

Similar Items