A Combinational Heuristic Algorithm for the Three-Dimensional Packing Problem
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    By combining the personification heuristics and simulated annealing,a combinational heuristic algorithm for the three-dimensional packing problem is presented.This personification heuristic algorithm is inspired by the strategy of building wall in the daily life.The point-finding way and the rules of horizontal and vertical reference line are developed to control the packing process.Simulated annealing algorithm is further used to improve the personification heuristics.Computational results on benchmark instances show that this algorithm can compete with excellent heuristics from the literature.

    Reference
    Related
    Cited by
Get Citation

张德富,魏丽军,陈青山,陈火旺.三维装箱问题的组合启发式算法.软件学报,2007,18(9):2083-2089

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:October 09,2006
  • Revised:January 04,2007
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063