Learn More
The Vehicle Scheduling Problem (VSP) is the task of building an optimal set of rotations (vehicle schedule), such that each trip of a given timetable is covered by exactly one rotation. The restrictions and optimization criteria may differ from one problem setting to another. For multi-depot, multi-vehicle-type VSP for bus transit, each one-day rotation(More)
In a large railway passenger traffic network, a given set of trips or service blocks are to be serviced by equipment consisting of several groups of locomotives/carriages. The allowed groups per service block are predefined as patterns or multisets of locomotives and carriages. A given type of locomotive/carriage may occur with varying numbers in several(More)
This paper proposes a new multi-criteria decision analysis (MCDA) model that uses a series of existing intuitive and analytical methods to systematically capture both objective and subjective beliefs and preferences from a group of decision makers (DMs). A defuzzification method that combines entropy and the theory of displaced ideal synthesizes crisp(More)
Traditionally, two variants of the L-shaped method based on Benders' decomposition principle are used to solve two-stage stochastic programming problems: the single-cut and the multi-cut version. The concept of an oracle with on-demand accuracy was originally proposed in the context of bundle methods for unconstrained convex optimzation to provide(More)