Solutions To Storage Spaces Allocation Problem for Import Containers by Exact and Heuristic Methods
| Autor: | Laidy De Armas Jacomino, Danilo Valdes, Carlos Morell, Rafael Bello |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Mathematical optimization
021103 operations research Optimization problem General Computer Science Computer science Heuristic (computer science) 0211 other engineering and technologies 02 engineering and technology Yard Terminal (electronics) Container (abstract data type) 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Relevance (information retrieval) Integer programming Generalized assignment problem |
| Zdroj: | Computación y Sistemas. 23 |
| ISSN: | 2007-9737 1405-5546 |
| DOI: | 10.13053/cys-23-1-2916 |
| Popis: | Maritime transport carries out most of the world's commercial activities. One of the elements used for maritime transportation is the container. Before moving to or from a country, containers are stacked in a container terminal, also called container yard. Container terminals perform multiple and complex operations daily. Scientific community pays attention to the container stacking operations in the yard area due to its complexity and relevance in the international commerce. In this work, we solve the problem of optimizing the storage spaces allocation to imported containers by the linear mixed integer programming method. The objective of this work is to solve storage space allocation problem for imported containers, in an acceptable computational time. We use an exact optimization method for the operations of a real container yard. We model this optimization problem mathematically as a generalized assignment problem. We present the mathematical formulation, its solution, as well as the computational experiments. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|