Minimizing crane times in pre-marshalling problems
| Autor: | Kevin Tierney, Consuelo Parreño-Torres, Rubén Ruiz, Ramón Alvarez-Valdés |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
050210 logistics & transportation
Mathematical optimization 021103 operations research Branch and bound 05 social sciences ESTADISTICA E INVESTIGACION OPERATIVA 0211 other engineering and technologies Linear model Terminal operations Transportation Container pre-marshalling 02 engineering and technology Logistics Upper and lower bounds Marshalling Dominance (ethology) Crane time Maritime transport 0502 economics and business Process efficiency Business and International Management Heuristic procedure Civil and Structural Engineering Integer (computer science) Mathematics |
| Zdroj: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia instname |
| ISSN: | 2015-1284 |
| Popis: | [EN] The pre-marshalling problem has been extensively studied in recent years with the aim of minimizing the number of movements needed to rearrange a bay of containers. Time is a more realistic objective for measuring process efficiency, and we show that it does not correlate with the number of movements. As a result, we study the problem of minimizing crane times and develop two exact approaches to solve it: an integer linear model, and a branch and bound algorithm, with new upper and lower bounds, dominance criteria, and a heuristic procedure, to provide optimal solutions for problems of practical size This work has been partially supported by the Spanish Ministry of Science, Innovation, and Universities, FPU Grant A-2015-12849 and under the project "OPTEP-Port Terminal Operations Optimization" (No. RTI2018-094940-B-I00) financed with FEDER funds. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|