Network design, fleet deployment and empty repositioning in liner shipping
Autor: | Shahin Gelareh, Rahimeh Neamatian Monemi |
---|---|
Jazyk: | angličtina |
Rok vydání: | 2017 |
Předmět: |
Engineering
Mathematical optimization Service (systems architecture) empty repositioning Optimization problem Benders decomposition branch and cut 0211 other engineering and technologies network design fleet deployment Transportation 02 engineering and technology valid inequalities Set (abstract data type) 0502 economics and business Business and International Management location allocation Civil and Structural Engineering 050210 logistics & transportation 021103 operations research business.industry 05 social sciences Business and Management Network planning and design Software deployment Set function liner shipping Location-allocation business Branch and cut |
Zdroj: | Monemi, R N & Gelareh, S 2017, ' Network design, fleet deployment and empty repositioning in liner shipping ', Transportation Research Part E: Logistics and Transportation Review, vol. 108, pp. 60-79 . https://doi.org/10.1016/j.tre.2017.07.005 |
DOI: | 10.1016/j.tre.2017.07.005 |
Popis: | We present an integrated modelling framework for the joint problems of network design, fleet deployment and empty repositioning in liner shipping. In our problem the number of service routes and their design are an endogenous part of the problem. The cost of a route is a set function mapping a subset of edges, vessel types and quantities to deploy to the set of non-negative real numbers. Since such cost structures cannot be accommodated in a compact formulation, our modelling framework, which is based on the paradigm of the Benders reformulation, integrates separate problems aiming to obtain a solution to the integrated problem. In this work we look at the Benders approach as a tool for integrating separate optimization problems rather than decomposing an integrated holistic optimization problem. Our numerical experiments show that the method is very efficient in solving instances of this problem with respect to both the problem size and the computational time. |
Databáze: | OpenAIRE |
Externí odkaz: |