Publication Type
Conference Proceeding Article
Version
submittedVersion
Publication Date
2000
Abstract
We propose a novel algorithmic framework to solve an integrated planning and scheduling problem in supply chain management. This problem involves the integration of an inventory management problem and the vehicle routing problem with time windows, both of which are known to be NP-hard. Under this framework, algorithms that solve the underlying sub-problems collaborate rigorously yet in a computationally efficient manner to arrive at a good solution. We will then present two algorithms to solve the inventory management problem: a complete mathematical model integrating integer programming with constraint programming, and an incomplete algorithm based on tabu search. We present experimental results based on extended Solomon benchmark vehicle routing problems.
Discipline
Computer Sciences | Operations and Supply Chain Management
Publication
Proceedings: 17th National Conference on Artificial Intelligence (AAAI), July 30-August 3, 2000, Austin, TX
First Page
780
Last Page
785
ISBN
9781577352365
Publisher
AAAI
City or Country
Austin, United States
Citation
LAU, Hoong Chuin; LIM, A. L. C.; and LIU, Q.
Solving a Supply Chain Optimization Problem Collaboratively. (2000). Proceedings: 17th National Conference on Artificial Intelligence (AAAI), July 30-August 3, 2000, Austin, TX. 780-785.
Available at: https://ink.library.smu.edu.sg/sis_research/1117
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
http://www.aaai.org/Papers/AAAI/2000/AAAI00-120.pdf