The service allocation problem at the Gioia Tauro maritime terminal
DOI10.1016/J.EJOR.2005.09.004zbMATH Open1103.90315OpenAlexW2081743425MaRDI QIDQ852990FDOQ852990
Authors: Jean-François Cordeau, Manlio Gaudioso, G. Laporte, Luigi Moccia 
Publication date: 15 November 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.004
Recommendations
- scientific article; zbMATH DE number 2040744
- Port space allocation with a time dimension
- Optimal berth allocation and time-invariant quay crane assignment in container terminals
- A survey of berth allocation and quay crane scheduling problems in container terminals
- The dynamic berth allocation problem: A linearized formulation
Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- Future paths for integer programming and links to artificial intelligence
- Container terminal operation and operations research -- a classification and literature review
- A Gentle Introduction to Memetic Algorithms
- On the quadratic assignment problem
- Transshipment of containers at a container terminal: An overview
- Parallel iterative search methods for vehicle routing problems
- A new genetic algorithm for the quadratic assignment problem
- A memetic heuristic for the generalized quadratic assignment problem
- Location, scheduling, design and integer programming
Cited In (19)
- Novel formulations and modeling enhancements for the dynamic berth allocation problem
- A cooperative parallel tabu search algorithm for the quadratic assignment problem
- Repulsive assignment problem
- An integrated model for berth and yard planning in container terminals with multi-continuous berth layout
- POPMUSIC as a matheuristic for the berth allocation problem
- A new mixed integer programming model for curriculum balancing: application to a Turkish university
- Tactical berth allocation under uncertainty
- Team-building with answer set programming in the Gioia-Tauro seaport
- A column generation heuristic for a dynamic generalized assignment problem
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems
- Planning activities in a network of logistic platforms with shared resources
- Human resources management at a marine container terminal
- Operations research at container terminals: a literature update
- Storage yard operations in container terminals: literature overview, trends, and research directions
- Title not available (Why is that?)
- Simultaneous berth allocation and yard planning at tactical level
- A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
This page was built for publication: The service allocation problem at the Gioia Tauro maritime terminal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q852990)
