A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports

DOI10.1016/j.ejor.2013.08.015zbMath1305.90258OpenAlexW2174895271MaRDI QIDQ2256282

Tomáš Robenek, Nitish Umang, Stefan Ropke, Michel Bierlaire

Publication date: 19 February 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://infoscience.epfl.ch/record/195981

zbMATH Keywords

mixed integer programminglarge scale optimizationbranch and pricemaritime logisticsintegrated planningbulk ports

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (17)

A follow-up survey of berth allocation and quay crane scheduling problems in container terminals ⋮ Optimal sequence of container ships in a string ⋮ Tactical berth allocation under uncertainty ⋮ Accelerating the branch-and-price algorithm using machine learning ⋮ Tug scheduling for hinterland barge transport: a branch-and-price approach ⋮ A solution framework for the integrated periodic supply vessel planning and port scheduling in oil and gas supply logistics ⋮ Scheduling wagons to unload in bulk cargo ports with uncertain processing times ⋮ The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions ⋮ A solution framework for the integrated periodic supply vessel planning and port scheduling in oil and gas supply logistics ⋮ Storage Yard Management: Modelling and Solving ⋮ Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem ⋮ An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study ⋮ An integrated model for berth and yard planning in container terminals with multi-continuous berth layout ⋮ A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports ⋮ Scheduling reclaimer operations in the stockyard to minimize makespan ⋮ Combinatorial approach to exactly solving discrete and hybrid berth allocation problem ⋮ Metaheuristic approaches for the Berth Allocation Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time
• Multi-objective and prioritized berth allocation in container ports
• A tutorial on column generation and branch-and-price for vehicle routing problems
• Crane scheduling in container yards with inter-crane interference
• The service allocation problem at the Gioia Tauro maritime terminal
• Berth allocation at indented berths for mega-containerships
• Integrated scheduling of handling equipment at automated container terminals
• An algorithm for the generalized quadratic assignment problem
• A survey of berth allocation and quay crane scheduling problems in container terminals
• The berth planning problem
• Container terminal operation and operations research -- a classification and literature review
• The berth allocation problem: models and solution methods
• A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis
• A scheduling method for Berth and Quay cranes
• Berth management in container terminal: the template design problem
• An optimization model for storage yard management in transshipment hubs
• Mathematical modelling of container transfers and storage locations at seaport terminals
• Bi-dynamic constraint aggregation and subproblem reduction
• Operations research at container terminals: a literature update
• Yard crane scheduling in port container terminals
• A critical-shaking neighborhood search for the yard allocation problem
• Container vessel scheduling with bi-directional flows
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Analysis of a new vehicle scheduling and location problem
• A Memetic Heuristic for the Generalized Quadratic Assignment Problem
• Berth Allocation Planning Optimization in Container Terminals
• Interblock Crane Deployment in Container Terminals
• Berth scheduling for container terminals by using a sub-gradient optimization technique
• Column Generation
• Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
• Berth allocation planning in the public berth system by genetic algorithms

This page was built for publication: A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports