Integrated Operational Transportation Planning Considering Subcontracting -- Distributed Decision-Making for Collaborative Transportation Planning of Horizontal Coalitions of Forwarders -- Rolling Horizon Planning for Dynamic Collaborative Vehicle Routing.

We examine different routing strategies to cope with inaccurate time window in-formation in the context of a dynamic pick-up and delivery problem with time windows. Our experiments show that advance information, even if inaccurate, can provide benefits from a planning perspective. We propose a...

We consider the Train Unit Shunting Problem, an important planning problem for passenger railway operators. This problem entails assigning physical train units to scheduled train services in such a way that the resulting shunting yard operations are feasible. As such, it arises at every shunting...

Motivated by a practical problem arising from the home health care industry, we consider an integrated routing and appointment scheduling problem with random service durations. Given a set of patients with known locations and service duration distributions, the health care team is required to...

We investigate the potential benefits of introducing meeting points in a ride-sharing system. With meeting points, riders can be picked up and dropped off either at their origin and destination or at a meeting point that is within a certain distance from their origin or destination. The...

This paper addresses the Rolling Stock Rescheduling Problem (RSRP), while taking maintenance appointments into account. After a disruption, the rolling stock of passenger trains has to be rescheduled in order to maintain a feasible rolling stock circulation. A limited number of rolling stock...

We investigate the integrated production and distribution scheduling problem in a supply chain. The manufacturer’s production environment is modeled as a parallel machine system. A single capacitated vehicle is employed to deliver products in batches to multiple customers. The scheduling...

In this paper, we propose a novel algorithmic approach to solve line planning problems. To this end, we model the line planning problem as a game where the passengers are players which aim at minimizing individual objective functions composed of travel time, transfer penalties, and a share of...

On a daily basis, relatively large disruptions require infrastructure managers and railway operators to reschedule their railway timetables together with their rolling stock and crew schedules. This research focuses on timetable rescheduling for passenger trains at a macroscopic level in a...

The Vehicle Routing Problem (VRP) is concerned with finding efficient routes for a fleet of vehicles/buses to pick up employees from pre-determined bus stops and bring them to the work place. We believe that the VRP will increase in importance as the fuel prices rise and as the extent to which...