000196072 001__ 196072
000196072 005__ 20190316235831.0
000196072 037__ $$aREP_WORK
000196072 245__ $$aA branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
000196072 269__ $$a2012
000196072 260__ $$c2012
000196072 336__ $$aReports
000196072 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 emphasize the differences in operations between bulk ports and container terminals which emphasizes 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 branch and price framework to solve the integrated problem. In the proposed model, the master problem is formulated as a set-partitioning problem, and subproblems to identify columns with negative reduced costs are solved using mixed integer programming. The proposed algorithm is tested and validated through numerical experiments based on instances inspired from real bulk port data. The results indicate that the algorithm can be successfully used to solve instances containing up to 40 vessels within reasonable computational time.
000196072 700__ $$aRobenek, Tomá
000196072 700__ $$0245352$$aUmang, Nitish$$g208066
000196072 700__ $$0240563$$aBierlaire, Michel$$g118332
000196072 700__ $$aRopke, Stefan
000196072 8564_ $$s674870$$uhttps://infoscience.epfl.ch/record/196072/files/TomNitBierStef12.pdf$$yn/a$$zn/a
000196072 909C0 $$0252123$$pTRANSP-OR$$xU11418
000196072 909CO $$ooai:infoscience.tind.io:196072$$pENAC$$preport$$qGLOBAL_SET
000196072 937__ $$aEPFL-REPORT-196072
000196072 970__ $$aREP-TomNitBierStef12/TRANSP-OR
000196072 973__ $$aEPFL
000196072 980__ $$aREPORT