Conference Proceeding Article
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.
multi-dimensional knapsack problem, logistics, tabu search, ant colony
Artificial Intelligence and Robotics | Business | Operations Research, Systems Engineering and Industrial Engineering
Intelligent Systems and Decision Analytics
Int'l Symposium on Scheduling (ISS)
City or Country
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. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1127