A Model for the Traveling Salesman Problem Including the EC Regulations on Driving Hours

Herbert Kopfer () and Christoph Manuel Meyer ()
Additional contact information
Herbert Kopfer: University of Bremen, Chair of Logistics
Christoph Manuel Meyer: University of Bremen, Chair of Logistics

Chapter 47 in Operations Research Proceedings 2008, 2009, pp 289-294 from Springer

Abstract: Summary Since April 2007 the new EC Regulation No 561/2006 concerning driving hours in road transport is effective. This regulation restricts the length of time periods for driving and requires minimum breaks and rest periods for drivers [2]. An analysis of the EC Regulation with respect to vehicle routing can be found in [3]. In this paper the restrictions on driving times and the need for breaks are formalized and integrated in an optimization model of the TSPTW. The solution space of the extended traveling salesman problem with time windows and EUconstraints (TSPTW-EU) contains all Hamiltonian circuits which full the given time windows and restrictions of the Regulation relevant for a time period up to one week. The presented approach for extending the TSPTW to the TSPTW-EU is also applicable for the extension of the VRPTW and PDPTW, thus offering a possibility to include the EC Regulations in vehicle routing and scheduling.

Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-00142-0_47

Ordering information: This item can be ordered from
http://www.springer.com/9783642001420

DOI: 10.1007/978-3-642-00142-0_47

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().