A Genetic algorithm to solve the container storage space allocation problem

Ayachi, I.; Kammarti, Ryan; Ksouri, Mekki; Borne, Pierre; LAGIS,; Lille, Ecole Centrale de; :,; LACS,; Tunis, Ecole Nationale des Ingenieurs de

doi:10.48550/arxiv.1303.1051

Cited by 4 publications

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

A constructive algorithm for Yard Allocation Problem

Ruiz

Cubillos

Cabrera‐Paniagua

et al. 2015

2015 CHILEAN Conference on Electrical, Electronics Engineering, Information and Communication Technologies (CHILECON)

View full text Add to dashboard Cite

Resumen-Yard Allocation Problem (YAP) is a frequently problem observed in port logistic operations, and consists in a temporary assignment of cargo containers, both export and import, to blocks storage located in the operation zone of seaports. The principal objective of YAP resolution is to improve the operations efficiency both terminal port as shipping companies that use the seaport, which allow to decrease operational cost and increasing the global efficiency. In this sense, this work proposes to solve the YAP using a constructive algorithm based in restrictions for each container. Official data of Arica Seaport -Chile were used for defining an experimental scenario, which allowed obtaining promising results. The constructive algorithm represents a novel approach because allows getting solutions in a simple and fast way, while satisfying the existing set of constrains associated with the general operation model.

show abstract

A constructive algorithm for Yard Allocation Problem

Ruiz

Cubillos

Cabrera‐Paniagua

et al. 2015

2015 CHILEAN Conference on Electrical, Electronics Engineering, Information and Communication Technologies (CHILECON)

View full text Add to dashboard Cite

show abstract

Application of Harmony search to container Storage Location

Ayachi

Kammarti

Ksouri

et al. 2011

2011 IEEE International Conference on Systems, Man, and Cybernetics

View full text Add to dashboard Cite

Genetic Algorithm and Hybrid Genetic Algorithm for Space Allocation Problems - A Review

Sharma¹,

Singhal²

2014

IJCA

View full text Add to dashboard Cite

Genetic algorithm is an evolutionary approach for solving space layout and optimization problems. Due to some drawbacks in genetic algorithm, several modifications are performed on this algorithm. When the advantages of GA are combined with advantages of another algorithm then this approach is called Hybrid Genetic Algorithm. One of the most difficult problems in architectural design is space layout problem. Various methods are proposed for solving this problem like hybrid genetic algorithm, fuzzy logic, and artificial neural network. Space layout problem commonly occurs in warehouse, hotel, building floors, containers, shelves etc. Present paper contains a review on genetic algorithm, hybrid genetic algorithm approaches for solving space allocation problems on different sample test like warehouse, shelf, building floors and container etc. A comparison has been done of twelve research paper .The findings of this paper will be useful for those who look for solution of space allocation problem on different models.

show abstract

A Genetic algorithm to solve the container storage space allocation problem

Cited by 4 publications

References 6 publications

A constructive algorithm for Yard Allocation Problem

A constructive algorithm for Yard Allocation Problem

Application of Harmony search to container Storage Location

Genetic Algorithm and Hybrid Genetic Algorithm for Space Allocation Problems - A Review

Contact Info

Product

Resources

About