In this thesis, we deal with modeling and solving various problems including vehicle routing and scheduling. We propose approximate methods that aim to solve problems quickly and e ciently. Five problems are addressed. The rst one is the Resource-Constrained Project Scheduling Problem (RCPSP) for which a multi-commodity ow approach is introduced. We also consider methods dealing with extensions...

Transportation businesses reduce costs by optimizing the routes of their trucks. However, determining optimal truck schedules is computationally intensive, running for hours on sequential computers. This article describes experience with parallelizing SAP’s Vehicle Scheduling and Routing Optimizer on shared-memory multicore computers. Re-engineering this complex application for a 24-core machin...

Waste management involves an efficient planing of collectionvehicles and corresponding crews. We present an optimization model and algorithm for the crew scheduling problem which is the second part of an integrative solution approach. We differentiate between a network based duty generation phase and a duty optimization phase where an optimal set of annual duties for all employees is selected.

Classical models of combinatorial problems, such as scheduling, play a key role in optimization research as they allow theoretical and empirical work to focus on core issues of problem solving performance. By their very nature, however, classical models are a simplification of real-world problems. We argue that the challenge now is to address those real-world features that were simplified away ...

Recently, the quality and the diversity of transport services are more and more required. Moreover, in case of a great deal of services and selling goods, a significant part of price is transport cost. Thus, the design of models and applications which make possible efficient transport planning and scheduling becomes important. A great deal of real transport problems may be modelled by using Pic...

This paper addresses an integrated vehicle routing and driver scheduling problem arising at the largest fresh meat producer in Denmark. The problem consists of a one-week planning horizon, heterogeneous vehicles, and drivers with predefined work regulations. These regulations include, among other things, predefined workdays, fixed starting time, maximum weekly working duration, break rule. The ...

Motivated by the field sta routing and scheduling problem of an Austrian infrastructure service provider, which involves the planning of subroutes, we study the truck and trailer routing problem (TTRP) [2]. In the TTRP, two types of customers are considered: customers that can be visited by a truck pulling a trailer (denoted as vehicle customers) and customers that can only be visited by a truc...