File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A hybrid simulated annealing algorithm for container loading problem

TitleA hybrid simulated annealing algorithm for container loading problem
Authors
KeywordsContainer Loading
Heuristics
Simulated Annealing
Issue Date2009
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'09, 2009, p. 919-922 How to Cite?
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.
Persistent Identifierhttp://hdl.handle.net/10722/151948
References

 

DC FieldValueLanguage
dc.contributor.authorPeng, Yen_US
dc.contributor.authorZhang, Den_US
dc.contributor.authorChin, FYLen_US
dc.date.accessioned2012-06-26T06:31:22Z-
dc.date.available2012-06-26T06:31:22Z-
dc.date.issued2009en_US
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-922en_US
dc.identifier.urihttp://hdl.handle.net/10722/151948-
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.en_US
dc.languageengen_US
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'09en_US
dc.subjectContainer Loadingen_US
dc.subjectHeuristicsen_US
dc.subjectSimulated Annealingen_US
dc.titleA hybrid simulated annealing algorithm for container loading problemen_US
dc.typeConference_Paperen_US
dc.identifier.emailChin, FYL:chin@cs.hku.hken_US
dc.identifier.authorityChin, FYL=rp00105en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1145/1543834.1543975en_US
dc.identifier.scopuseid_2-s2.0-67650677307en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-67650677307&selection=ref&src=s&origin=recordpageen_US
dc.identifier.spage919en_US
dc.identifier.epage922en_US
dc.identifier.scopusauthoridPeng, Y=8713314400en_US
dc.identifier.scopusauthoridZhang, D=10039112000en_US
dc.identifier.scopusauthoridChin, FYL=7005101915en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats