Publication Type
Conference Proceeding Article
Version
acceptedVersion
Publication Date
5-2004
Abstract
This paper is motivated by a recent trend in logistics scheduling, called Available-to-Promise. We model this problem as the multi-period multi-dimensional knapsack problem. We provide some properties for a special case of a single-dimensional problem. Based on insights obtained from these properties, we propose a two-phase heuristics for solving the multi-dimensional problem. We also propose a novel time-based ant colony optimization algorithm. The quality of the solutions generated is verified through experiments, where we demonstrate that the computational time is superior compared with integer programming to achieve solutions that are within a small percentage of the upper bounds.
Keywords
multi-dimensional knapsack problem, logistics, tabu search, ant colony
Discipline
Artificial Intelligence and Robotics | Business | Operations Research, Systems Engineering and Industrial Engineering
Publication
Int'l Symposium on Scheduling (ISS)
First Page
94
Last Page
99
City or Country
Hyogo, Japan
Citation
LAU, Hoong Chuin and LIM, M. K..
Multi-Period Multi-Dimensional Knapsack Problem and Its Application to Available-to-Promise. (2004). Int'l Symposium on Scheduling (ISS). 94-99.
Available at: https://ink.library.smu.edu.sg/sis_research/1127
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Included in
Artificial Intelligence and Robotics Commons, Business Commons, Operations Research, Systems Engineering and Industrial Engineering Commons