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.
We consider a periodic review, single-item, deterministic demand inventory model under non-stationary supply availability which has an all-or-nothing type of structure. Supply availability information is provided by the supplier which we refer as advance s ...
In this study, we integrate a schedule design and fleet assignment model and a demand model into an optimization problem to maximize the revenue of an airline. The model considers spill and recapture effects to cope with capacity restrictions. For the dema ...
In general, it is difficult to select a satisfactory product concept because the information in the early stage of design process is subjective, qualitative, and even uncertain to design engineers. The correlations among engineering characteristics for a p ...
We heuristically solve an evacuation problem with limited capacity shelters. An evolutionary learning algorithm is developed for the combined route- and shelter-assignment problem. It is complemented with a heuristic method for the fair minimization of she ...
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 ...
The single-source shortest path problem (SSSP) frequently arises in practical applications of todays Intelligent Transport Systems (ITS). E.g. for route planning or traffic assignment, several variants of Dijkstra’s algorithm or the A* algorithm have been ...
We present a concrete methodology for saving energy in future and contemporary cellular networks. It is based on re-arranging the user-cell association so as to allow shutting down under-utilized parts of the network. We consider a hypothetical static case ...
Tuning tools attempt to configure a database to achieve optimal performance for a given workload. Selecting an optimal set of physical structures is computationally hard since it involves searching a vast space of possible configurations. Commercial DBMSs ...
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 ...
We present a model where we integrate schedule design, fleet assignment and demand models to maximize the profit of an airline. The objective of the study is to identify the challenges behind the integration of demand modeling into the optimization model a ...
