2B3 MULTI-PERIOD MULTI-DIMENSIONAL KNAPSACK PROBLEM AND ITS APPLICATION TO AVAILABLE-TO-PROMISE(Technical session 2B : Combinatorics 1)

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 2004-05-24

著者

• Lim Min

  School Of Computing National University Of Singapore

• LAU Hoong

  School of Computing National University of Singapore

関連論文

• 2B3 MULTI-PERIOD MULTI-DIMENSIONAL KNAPSACK PROBLEM AND ITS APPLICATION TO AVAILABLE-TO-PROMISE(Technical session 2B : Combinatorics 1)

スポンサーリンク