Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
In the context of container terminal operations, the simultaneous optimization of decision problems that are usually solved hierarchically by terminal's planners represents nowadays a promising research trend. In this talk we introduce the Tactical Berth A ...
Over the last years, international sea freight container transportation has grown dramatically and container terminals play nowadays a key role within the global shipping network. Terminals operations have received increasing interest in the scientific lit ...
We introduce a new concept in column generation for handling complex large scale optimization problems, called two-stage column generation, where columns for the compact and extensive formulation are simultaneously generated. The new framework is specifica ...
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 ...
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 ...
The Discrete Split Delivery Vehicle Routing Problem with Time Windows (DSDVRPTW) consists of designing the optimal set of routes to serve, at least cost, a given set of customers while respecting constraints on vehicles capacity and customer time windows. ...
The Discrete Split Delivery Vehicle Routing Problem with Time Windows (DSDVRPTW) consists of designing the optimal set of routes to serve, at least cost, a given set of customers while respecting constraints on vehicles capacity and customer time windows. ...
The Split Delivery Vehicle Routing Problem (SDVRP) is a variant version of the classical VRP in which each customer can be visited by more than one vehicle which serves a fraction of its demand. The Discrete SDVRP is another variant in which the delivery r ...
In this work 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, whic ...
The Discrete Split Delivery Vehicle Routing Problem with Time Windows (DSDVRPTW) consists of designing the optimal set of routes to serve, at least cost, a given set of customers while respecting constraints on vehicles capacity and customer time windows. ...