File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Improved ant colony optimization for one-dimensional bin packing problem with precedence constraints

TitleImproved ant colony optimization for one-dimensional bin packing problem with precedence constraints
Authors
Zhang, ZCheng, WTang, LCheng, Y
KeywordsComputational Methods
Constraint Theory
Logic Programming
Problem Solving
Issue Date2007
Citation
Proceedings - Third International Conference on Natural Computation, ICNC 2007, 2007, v. 4, p. 539-543 How to Cite?
DOI: http://dx.doi.org/10.1109/ICNC.2007.437
AbstractBin packing is a well studied problem which has many applications. In this paper, a new design of ant colony optimization (ACO) is proposed for solving the onedimensional bin packing problem with precedence constraints (PCBPP). The proposed algorithm made use of the trail information which is deposited between the item and the item selected position, and pheromone summation rules was adopted. Furthermore, heuristic methods, which synthesis consider size of the item and the number of successors and are effective for the bin packing problem, are introduced into our ACO for quick obtaining a solution. The effectiveness of our ACO is investigated through computational results for test instances. © 2007 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/91246
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorZhang, Zen_HK
dc.contributor.authorCheng, Wen_HK
dc.contributor.authorTang, Len_HK
dc.contributor.authorCheng, Yen_HK
dc.date.accessioned2010-09-17T10:15:34Z-
dc.date.available2010-09-17T10:15:34Z-
dc.date.issued2007en_HK
dc.identifier.citationProceedings - Third International Conference on Natural Computation, ICNC 2007, 2007, v. 4, p. 539-543en_HK
dc.identifier.urihttp://hdl.handle.net/10722/91246-
dc.description.abstractBin packing is a well studied problem which has many applications. In this paper, a new design of ant colony optimization (ACO) is proposed for solving the onedimensional bin packing problem with precedence constraints (PCBPP). The proposed algorithm made use of the trail information which is deposited between the item and the item selected position, and pheromone summation rules was adopted. Furthermore, heuristic methods, which synthesis consider size of the item and the number of successors and are effective for the bin packing problem, are introduced into our ACO for quick obtaining a solution. The effectiveness of our ACO is investigated through computational results for test instances. © 2007 IEEE.en_HK
dc.languageengen_HK
dc.relation.ispartofProceedings - Third International Conference on Natural Computation, ICNC 2007en_HK
dc.subjectComputational Methodsen_HK
dc.subjectConstraint Theoryen_HK
dc.subjectLogic Programmingen_HK
dc.subjectProblem Solvingen_HK
dc.titleImproved ant colony optimization for one-dimensional bin packing problem with precedence constraintsen_HK
dc.typeArticleen_HK
dc.identifier.emailCheng, Y:yuecheng@hku.hken_HK
dc.identifier.authorityCheng, Y=rp1320en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/ICNC.2007.437en_HK
dc.identifier.scopuseid_2-s2.0-38049083937en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-38049083937&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume4en_HK
dc.identifier.spage539en_HK
dc.identifier.epage543en_HK

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats