000195868 001__ 195868
000195868 005__ 20181203023415.0
000195868 0247_ $$2doi$$a10.1016/j.ejor.2013.08.015
000195868 022__ $$a0377-2217
000195868 02470 $$2ISI$$a000331684000007
000195868 037__ $$aARTICLE
000195868 245__ $$aA Branch-and-Price Algorithm to Solve the Integrated Berth Allocation and Yard Assignment Problem in Bulk Ports
000195868 260__ $$bElsevier Science Bv$$c2014$$aAmsterdam
000195868 269__ $$a2014
000195868 300__ $$a13
000195868 336__ $$aJournal Articles
000195868 520__ $$aIn this research, two crucial optimization problems of berth allocation and yard assignment in the context of bulk ports are studied. We discuss how these problems are interrelated and can be combined and solved as a single large scale optimization problem. More importantly we highlight the differences in operations between bulk ports and container terminals which high- lights the need to devise specific solutions for bulk ports. The objective is to minimize the total service time of vessels berthing at the port. We propose an exact solution algorithm based on a branch and price framework to solve the integrated problem. In the proposed model, the mas- ter problem is formulated as a set-partitioning problem, and subproblems to identify columns with negative reduced costs are solved using mixed integer programming. To obtain sub-optimal solutions quickly, a metaheuristic approach based on critical-shaking neighborhood search is pre- sented. The proposed algorithms are tested and validated through numerical experiments based on instances inspired from real bulk port data. The results indicate that the algorithms can be successfully used to solve instances containing up to 40 vessels within reasonable computational time.
000195868 6531_ $$aMaritime logistics
000195868 6531_ $$aLarge scale optimization
000195868 6531_ $$aBranch and price
000195868 6531_ $$aIntegrated planning
000195868 6531_ $$aBulk ports
000195868 6531_ $$aMixed integer programming
000195868 700__ $$aRobenek, Tomá
000195868 700__ $$0245352$$g208066$$aUmang, Nitish
000195868 700__ $$g118332$$aBierlaire, Michel$$0240563
000195868 700__ $$aRopke, Stefan
000195868 773__ $$j235$$tEuropean Journal of Operational Research$$k2$$q399-411
000195868 909C0 $$xU11418$$0252123$$pTRANSP-OR
000195868 909CO $$particle$$pENAC$$ooai:infoscience.tind.io:195868
000195868 937__ $$aEPFL-ARTICLE-195868
000195868 970__ $$aIJ-RobeUmanBierRopk13/TRANSP-OR
000195868 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000195868 980__ $$aARTICLE