• DocumentCode
    2780311
  • Title

    A clonal selection algorithm to minimize reshuffling in container stacking operations

  • Author

    Carraro, Luiz Antonio ; De Castro, Leandro Nunes

  • Author_Institution
    Natural Comput. Lab. (LCoN), Mackenzie Univ., Sao Paulo, Brazil
  • fYear
    2012
  • fDate
    10-15 June 2012
  • Firstpage
    1
  • Lastpage
    8
  • Abstract
    A container is a widely used solution for the cargo storage to be transported between ports, playing a central role in international trade. Consequently, ships grew in size in order to maximize their container transportation capacity in each trip. Due to increasing demand, container terminals face the challenges of increasing their service capacity and optimizing the loading and unloading time of ships. This paper presents the proposal of a novel meta-heuristic based on the Clonal Selection Algorithm, named MRCLONALG, to minimize the number of reshuffles in operations involving piles of containers. The performance of the proposed model was evaluated through simulations and results compared with those obtained by algorithms from the literature under the same test conditions. The results show that MRCLONALG is competitive in terms of minimizing the need of reshuffles, besides presenting a reduced processing time compared with models of similar performance.
  • Keywords
    artificial immune systems; international trade; loading; sea ports; ships; stacking; unloading; MRCLONALG; cargo storage; clonal selection algorithm; container stacking operations; container transportation capacity; international trade; reshuffling minimization; service capacity; ship unloading time optimization; Cloning; Containers; Cranes; Loading; Marine vehicles; Optimization; Stacking; clonal selection artificial immune system; optimization; reshuffles; terminal planning;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Evolutionary Computation (CEC), 2012 IEEE Congress on
  • Conference_Location
    Brisbane, QLD
  • Print_ISBN
    978-1-4673-1510-4
  • Electronic_ISBN
    978-1-4673-1508-1
  • Type

    conf

  • DOI
    10.1109/CEC.2012.6252946
  • Filename
    6252946