An adaptive large neighborhood search for the discrete and continuous berth allocation problem

DOI10.1016/j.cor.2016.01.002zbMath1391.90662OpenAlexW2234424300MaRDI QIDQ1651633

Geraldo Regis Mauri, Gilbert Laporte, Luiz Antonio Nogueira Lorena, Glaydston Mattos Ribeiro

Publication date: 12 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.01.002

zbMATH Keywords

metaheuristicberth allocation problemadaptive large neighborhood search

Mathematics Subject Classification ID

Search theory (90B40) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items

Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems ⋮ GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem ⋮ A dynamic programming-based matheuristic for the dynamic berth allocation problem ⋮ The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions ⋮ Novel formulations and modeling enhancements for the dynamic berth allocation problem ⋮ MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem ⋮ Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem ⋮ Integrated proactive-reactive approach and a hybrid adaptive large neighborhood search algorithm for berth and quay crane scheduling under uncertain combination ⋮ Exact and heuristic methods for optimizing lock-quay system in inland waterway ⋮ The use of frontier techniques to identify efficient solutions for the berth allocation problem solved with a hybrid evolutionary algorithm ⋮ Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions ⋮ Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search ⋮ New Lower Bound and Exact Method for the Continuous Berth Allocation Problem

Cites Work

• An adaptive large neighborhood search for a vehicle routing problem with multiple routes
• Berth allocation with time-dependent physical limitations on vessels
• A unified heuristic for a large class of vehicle routing problems with backhauls
• A general heuristic for vehicle routing problems
• A survey of berth allocation and quay crane scheduling problems in container terminals
• A comparison of three metaheuristics for the workover rig routing problem
• Clustering Search Heuristic for Solving a Continuous Berth Allocation Problem

This page was built for publication: An adaptive large neighborhood search for the discrete and continuous berth allocation problem