|Affiliations:||Mathematical Institute of the Serbian Academy of Sciences and Arts||Title:||Routing of barge container ships by mixed-integer programming heuristics||Journal:||Applied Soft Computing Journal||Volume:||13||Issue:||8||First page:||3515||Last page:||3528||Issue Date:||29-May-2013||Rank:||M21||ISSN:||1568-4946||DOI:||10.1016/j.asoc.2013.03.003||Abstract:||
We investigate the optimization of transport routes of barge container ships with the objective to maximize the profit of a shipping company. This problem consists of determining the upstream and downstream calling sequence and the number of loaded and empty containers transported between any two ports. We present a mixed integer linear programming (MILP) formulation for this problem. The problem is tackled by the commercial CPLEX MIP solver and improved variants of the existing MIP heuristics: Local Branching, Variable Neighborhood Branching and Variable Neighborhood Decomposition Search. It appears that our implementation of Variable Neighborhood Branching outperforms CPLEX MIP solver both regarding the solution quality and the computational time. All other studied heuristics provide results competitive with CPLEX MIP solver within a significantly shorter amount of time. Moreover, we present a detailed case study transportation analysis which illustrates how the proposed approach can be used by managers of barge shipping companies to make appropriate decisions and solve real life problems.
|Keywords:||Barge container ships | Empty containers 0-1 mixed integer programming | Meta-heuristics | Routing||Publisher:||Elsevier||Project:||Mathematical Modelas and Optimization Methods on Large-Scale Systems
Transport system integration models
Software development and national database for strategic management and development of transportation means and infrastructure in road, rail, air and inland waterways transport using the European transport network models
Graph theory and mathematical programming with applications in chemistry and computer science
Show full item record
checked on Sep 27, 2021
checked on Sep 26, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.