File Download
 
Links for fulltext
(May Require Subscription)
 
Supplementary

Conference Paper: A hybrid simulated annealing algorithm for container loading problem
  • Basic View
  • Metadata View
  • XML View
TitleA hybrid simulated annealing algorithm for container loading problem
 
AuthorsPeng, Y1
Zhang, D1
Chin, FYL1
 
KeywordsContainer Loading
Heuristics
Simulated Annealing
 
Issue Date2009
 
Citation2009 World Summit On Genetic And Evolutionary Computation, 2009 Gec Summit - Proceedings Of The 1St Acm/Sigevo Summit On Genetic And Evolutionary Computation, Gec'09, 2009, p. 919-922 [How to Cite?]
DOI: http://dx.doi.org/10.1145/1543834.1543975
 
AbstractThis paper presents a hybrid simulated annealing algorithm for container loading problem with boxes of different sizes and single container for loading. A basic heuristic algorithm is introduced to generate feasible solution from a special structure called packing sequence. The hybrid algorithm uses basic heuristic to encode feasible packing solution as packing sequence, and searches in the encoding space to find an approximated optimal solution. The computational experiments on 700 weakly heterogeneous benchmark show that our algorithm outperforms all previous methods in average. Copyright 2009 ACM.
 
DOIhttp://dx.doi.org/10.1145/1543834.1543975
 
ReferencesReferences in Scopus
 
DC FieldValue
dc.contributor.authorPeng, Y
 
dc.contributor.authorZhang, D
 
dc.contributor.authorChin, FYL
 
dc.date.accessioned2012-06-26T06:31:22Z
 
dc.date.available2012-06-26T06:31:22Z
 
dc.date.issued2009
 
dc.description.abstractThis paper presents a hybrid simulated annealing algorithm for container loading problem with boxes of different sizes and single container for loading. A basic heuristic algorithm is introduced to generate feasible solution from a special structure called packing sequence. The hybrid algorithm uses basic heuristic to encode feasible packing solution as packing sequence, and searches in the encoding space to find an approximated optimal solution. The computational experiments on 700 weakly heterogeneous benchmark show that our algorithm outperforms all previous methods in average. Copyright 2009 ACM.
 
dc.description.naturelink_to_subscribed_fulltext
 
dc.identifier.citation2009 World Summit On Genetic And Evolutionary Computation, 2009 Gec Summit - Proceedings Of The 1St Acm/Sigevo Summit On Genetic And Evolutionary Computation, Gec'09, 2009, p. 919-922 [How to Cite?]
DOI: http://dx.doi.org/10.1145/1543834.1543975
 
dc.identifier.doihttp://dx.doi.org/10.1145/1543834.1543975
 
dc.identifier.epage922
 
dc.identifier.scopuseid_2-s2.0-67650677307
 
dc.identifier.spage919
 
dc.identifier.urihttp://hdl.handle.net/10722/151948
 
dc.languageeng
 
dc.relation.ispartof2009 World Summit on Genetic and Evolutionary Computation, 2009 GEC Summit - Proceedings of the 1st ACM/SIGEVO Summit on Genetic and Evolutionary Computation, GEC'09
 
dc.relation.referencesReferences in Scopus
 
dc.subjectContainer Loading
 
dc.subjectHeuristics
 
dc.subjectSimulated Annealing
 
dc.titleA hybrid simulated annealing algorithm for container loading problem
 
dc.typeConference_Paper
 
<?xml encoding="utf-8" version="1.0"?>
<item><contributor.author>Peng, Y</contributor.author>
<contributor.author>Zhang, D</contributor.author>
<contributor.author>Chin, FYL</contributor.author>
<date.accessioned>2012-06-26T06:31:22Z</date.accessioned>
<date.available>2012-06-26T06:31:22Z</date.available>
<date.issued>2009</date.issued>
<identifier.citation>2009 World Summit On Genetic And Evolutionary Computation, 2009 Gec Summit - Proceedings Of The 1St Acm/Sigevo Summit On Genetic And Evolutionary Computation, Gec&apos;09, 2009, p. 919-922</identifier.citation>
<identifier.uri>http://hdl.handle.net/10722/151948</identifier.uri>
<description.abstract>This paper presents a hybrid simulated annealing algorithm for container loading problem with boxes of different sizes and single container for loading. A basic heuristic algorithm is introduced to generate feasible solution from a special structure called packing sequence. The hybrid algorithm uses basic heuristic to encode feasible packing solution as packing sequence, and searches in the encoding space to find an approximated optimal solution. The computational experiments on 700 weakly heterogeneous benchmark show that our algorithm outperforms all previous methods in average. Copyright 2009 ACM.</description.abstract>
<language>eng</language>
<relation.ispartof>2009 World Summit on Genetic and Evolutionary Computation, 2009 GEC Summit - Proceedings of the 1st ACM/SIGEVO Summit on Genetic and Evolutionary Computation, GEC&apos;09</relation.ispartof>
<subject>Container Loading</subject>
<subject>Heuristics</subject>
<subject>Simulated Annealing</subject>
<title>A hybrid simulated annealing algorithm for container loading problem</title>
<type>Conference_Paper</type>
<description.nature>link_to_subscribed_fulltext</description.nature>
<identifier.doi>10.1145/1543834.1543975</identifier.doi>
<identifier.scopus>eid_2-s2.0-67650677307</identifier.scopus>
<relation.references>http://www.scopus.com/mlt/select.url?eid=2-s2.0-67650677307&amp;selection=ref&amp;src=s&amp;origin=recordpage</relation.references>
<identifier.spage>919</identifier.spage>
<identifier.epage>922</identifier.epage>
</item>
Author Affiliations
  1. The University of Hong Kong