Integrating local search and network flow to solve the inventory routing problem

Authors:
Hoong Chuin Lau;Qizhang Liu;Hirotaka Ono
Affiliations:
School of Computing, National University of Singapor, 3 Science Drive 2, Singapore;ASPrecise Pte Ltd, 11 Tampines Street 92, Singapore;Graduate School of Information Science and Electrical Engineering, Kyushu University, Japan
Venue:
Eighteenth national conference on Artificial intelligence
Year:
2002

Citing 9
Cited 4

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Local optimization and the traveling salesman problem

Proceedings of the seventeenth international colloquium on Automata, languages and programming
Efficient local search for very large-scale satisfiability problems

ACM SIGART Bulletin
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Ejection chains, reference structures and alternating path methods for traveling salesman problems

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Tabu Search

Tabu Search
An Inventory Management Problem

Constraints
Solving a Supply Chain Optimization Problem Collaboratively

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models

Operations Research

A multi-agent approach for solving optimization problems involving expensive resources

Proceedings of the 2005 ACM symposium on Applied computing
Performance Measurement for Inventory Routing

Transportation Science
High-Performance Local Search for Solving Real-Life Inventory Routing Problems

SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
Randomized Local Search for Real-Life Inventory Routing

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

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.