Integrated supply-demand models for the optimization of flexible transportation systems
Related publications (166)
Graph Chatbot
Chat with Graph Search
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.
Discrete choice models are defined conditional to the analyst's knowledge of the actual choice set. The common practice for many years has been to assume that individual-based choice sets can be deterministically generated on the basis of the choice contex ...
This text describes the first application of a novel path flow and origin/destination (OD) matrix estimator for iterated dynamic traffic assignment (DTA) microsimulations. The presented approach, which operates on a trip-based demand representation, is der ...
One fundamental issue in existing reputation mechanisms, particularly those in open and decentralized multi-agent systems, is whitewashing attacks by rational providers. If identities are cheap, it is beneficial for a provider to simply defect when selling ...
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 ...
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 ...
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 ...
Dynamic stochastic optimization problems with a large (possibly infinite) number of decision stages and high-dimensional state vectors are inherently difficult to solve. In fact, scenario tree-based algorithms are unsuitable for problems with many stages, ...
In many European cities public transport, particularly busses, are unattractive and underused, due to the lack of direct connections, the need of transfers and the loss of time and comfort. Hence, this study aims at developing the business concept of an al ...
This paper studies the problem of demand driven employee scheduling for direct-sales retail outlets. The demand for sales personnel during each half hour is predicted a week in advance based on previous recorded data and the problem of computing an optimal ...
Discrete choice models are defined conditional to the knowledge of the actual choice set by the analyst. The common practice for is to assume that individual-based choice sets can be deterministically generated based on the choice context and the character ...