๐Ÿ“–
The truck driver Sscheduling problem under the european Community social legislation
Ivan Guillermo Pena Arenas

The truck driver Sscheduling problem under the european Community social legislation

Author / Organization:
Science & Mathematics Published 2022 Verification Pending

Overview & Synopsis

This thesis is about models and solution methods for different routing and scheduling problems, which consider legal constraints related to the driving and working time of the truck drivers. These kind of problems require, among other things, coordination between delivery activities, which are defined by a starting date, the service duration at customers (who have time windows), and transport operations, which are defined by starting and finishing dates.In order to solve this models, different optimization methods were proposed to achieve good quality solutions in a reasonable running times. The thesis starts with an introduction, which presents an overview of the problem and the different approaches that have been proposed in the literature to solve it. This literature review follows two lines, problems related with the Truck Driver Scheduling Problem (TDSP) and the combined Vehicle Routing and Truck Driver Scheduling Problem (VRTDSP). The solution methods are developed in order of complexity, starting with models using a restricted number of decision points and ending with models that can handle pre-emption assumptions.The first problem is a Truck Driver Scheduling problem in which breaks and daily rests are only scheduled at the customer locations, which means that transport times between customers must not exceed 4.5 hours. This model is perfectly suited to regional or national transport where distance between two customers does not exceed 4.5h. This problem is the subject of chapter 2: a linear model and a label setting algorithm are proposed and tested on a new set of instances. The second problem addressed concerns to the solution of the Truck Driver Scheduling problem, in which breaks can be scheduled at any point of time, whether at customer locations or in the middle of an activity (driving or service). This problem is more complete because it models more general cases including in particular long distance transports between customers. On this problem different contributions are made: the first is a linear model which extends the model from chapter 2, and three versions of a label setting algorithm. This thesis presents different solutions methods for the TDSP problem while considering all the weekly rules from the European Community Social Legislation, extending in this sense all previous contributions in the literature. In particular, the night working rule that has been whether simplified or discarded in the past. In addition, a new benchmark with detail optimal solutions is provided. The efficiency of the proposed methods and the implications of the different rules in particular the night working constraint are discussed.

Indexed from repository: HAL Open Science (hal.science)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title The truck driver Sscheduling problem under the european Community social legislation
Author / Organization Ivan Guillermo Pena Arenas
Subject & Discipline Multidisciplinary Academic Open Research
Categories Science & Mathematics
Publication Year 2022
License / Rights Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website HAL Open Science (hal.science)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-249347
Original Source Link Visit Source Page on hal.science »