Models and Heuristics for the Tactical Berth Allocation Problem with Quay-Crane Assignment and Transshipment Costs
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
In this paper we integrate at the tactical level two decision problems arising in container terminals: the berth allocation problem, which consists of assigning and scheduling incoming ships to berthing positions, and the quay crane assignment problem, whi ...
In this work, we focus on the integration of two problems arising in the management of transshipment container terminals: the problem of assigning and scheduling incoming ships to berthing positions (berth allocation problem), and the problem of assigning ...
International sea-freight container transport has grown dramatically over the last years and container terminals play nowadays a key-role in the global shipping network. Increasing competition and competitiveness among terminals require more and more effic ...
International sea-freight container transport has grown dramatically over the last years and container terminals play nowadays a key-role in the global shipping network. Increasing competition and competitiveness among terminals require more and more effic ...
In this paper, we consider the recovery of an airline schedule after an unforeseen event called disruption, making the planned schedule infeasible. We present a modeling framework that allows the consideration of operational constraints within a Column Gen ...
International sea-freight container transportation has grown dramatically over the last years and container terminals represent nowadays a key actor in the global shipping network. Terminal managers have to face with an increasing competitiveness among ter ...
In container terminals, the yard is the zone where containers are stored: it serves as a buffer for loading, unloading and transshipping containers. Yard is usually the bottleneck of the terminal, as traffic, congestion and capacity issues mainly originate ...
The A* algorithm is a well-known heuristic best-first search method. Several performance-accelerated extensions of the exact A* approach are known. Interesting examples are approximate algorithms where the heuristic function used is inflated by a weight (o ...
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, ..., k}) to each vertex of G so that no edge has both endpoints with the same color. We propose a new local search methodology, ...
The resource constrained elementary shortest path problem (RCESPP) arises as a pricing subproblem in branch-and-price algorithms for vehicle-routing problems with additional constraints. We address the optimization of the RCESPP and we present and compare ...
