Distributed Decision Making in Combined Vehicle Routing and Break Scheduling

Christoph Manuel Meyer, Herbert Kopfer, A.L. Kok, Johannes M.J. Schutten

Research output: Book/ReportReportProfessional

29 Downloads (Pure)

Abstract

The problem of combined vehicle routing and break scheduling comprises three subproblems: clustering of customer requests, routing of vehicles, and break scheduling. In practice, these subproblems are usually solved in the interaction between planners and drivers. We consider the case that the planner performs the clustering and the drivers perform the routing and break scheduling. To analyze this problem, we embed it into the framework of distributed decision making proposed by Schneeweiss (2003). We investigate two different degrees of anticipation of the drivers’ planning behaviour using computational experiments. The results indicate that in this application a more precise anticipation function results in better objective values for both the planner and the drivers.
Original languageUndefined
Place of Publicationonbekend
PublisherOperational Methods for Production & Logistics (OMPL)
Number of pages9
ISBN (Print)9789038617428
Publication statusPublished - 2009

Publication series

NameBETA Working Papers
PublisherBeta Research School for Operations Management and Logistics, University of Twente
No.271

Keywords

  • IR-70215
  • Distributed decision making
  • METIS-256614
  • Vehicle routing
  • Break scheduling

Cite this

Meyer, C. M., Kopfer, H., Kok, A. L., & Schutten, J. M. J. (2009). Distributed Decision Making in Combined Vehicle Routing and Break Scheduling. (BETA Working Papers; No. 271). onbekend: Operational Methods for Production & Logistics (OMPL).
Meyer, Christoph Manuel ; Kopfer, Herbert ; Kok, A.L. ; Schutten, Johannes M.J. / Distributed Decision Making in Combined Vehicle Routing and Break Scheduling. onbekend : Operational Methods for Production & Logistics (OMPL), 2009. 9 p. (BETA Working Papers; 271).
@book{5b7879fdebb0412d81054251903edf93,
title = "Distributed Decision Making in Combined Vehicle Routing and Break Scheduling",
abstract = "The problem of combined vehicle routing and break scheduling comprises three subproblems: clustering of customer requests, routing of vehicles, and break scheduling. In practice, these subproblems are usually solved in the interaction between planners and drivers. We consider the case that the planner performs the clustering and the drivers perform the routing and break scheduling. To analyze this problem, we embed it into the framework of distributed decision making proposed by Schneeweiss (2003). We investigate two different degrees of anticipation of the drivers’ planning behaviour using computational experiments. The results indicate that in this application a more precise anticipation function results in better objective values for both the planner and the drivers.",
keywords = "IR-70215, Distributed decision making, METIS-256614, Vehicle routing, Break scheduling",
author = "Meyer, {Christoph Manuel} and Herbert Kopfer and A.L. Kok and Schutten, {Johannes M.J.}",
year = "2009",
language = "Undefined",
isbn = "9789038617428",
series = "BETA Working Papers",
publisher = "Operational Methods for Production & Logistics (OMPL)",
number = "271",

}

Meyer, CM, Kopfer, H, Kok, AL & Schutten, JMJ 2009, Distributed Decision Making in Combined Vehicle Routing and Break Scheduling. BETA Working Papers, no. 271, Operational Methods for Production & Logistics (OMPL), onbekend.

Distributed Decision Making in Combined Vehicle Routing and Break Scheduling. / Meyer, Christoph Manuel; Kopfer, Herbert; Kok, A.L.; Schutten, Johannes M.J.

onbekend : Operational Methods for Production & Logistics (OMPL), 2009. 9 p. (BETA Working Papers; No. 271).

Research output: Book/ReportReportProfessional

TY - BOOK

T1 - Distributed Decision Making in Combined Vehicle Routing and Break Scheduling

AU - Meyer, Christoph Manuel

AU - Kopfer, Herbert

AU - Kok, A.L.

AU - Schutten, Johannes M.J.

PY - 2009

Y1 - 2009

N2 - The problem of combined vehicle routing and break scheduling comprises three subproblems: clustering of customer requests, routing of vehicles, and break scheduling. In practice, these subproblems are usually solved in the interaction between planners and drivers. We consider the case that the planner performs the clustering and the drivers perform the routing and break scheduling. To analyze this problem, we embed it into the framework of distributed decision making proposed by Schneeweiss (2003). We investigate two different degrees of anticipation of the drivers’ planning behaviour using computational experiments. The results indicate that in this application a more precise anticipation function results in better objective values for both the planner and the drivers.

AB - The problem of combined vehicle routing and break scheduling comprises three subproblems: clustering of customer requests, routing of vehicles, and break scheduling. In practice, these subproblems are usually solved in the interaction between planners and drivers. We consider the case that the planner performs the clustering and the drivers perform the routing and break scheduling. To analyze this problem, we embed it into the framework of distributed decision making proposed by Schneeweiss (2003). We investigate two different degrees of anticipation of the drivers’ planning behaviour using computational experiments. The results indicate that in this application a more precise anticipation function results in better objective values for both the planner and the drivers.

KW - IR-70215

KW - Distributed decision making

KW - METIS-256614

KW - Vehicle routing

KW - Break scheduling

M3 - Report

SN - 9789038617428

T3 - BETA Working Papers

BT - Distributed Decision Making in Combined Vehicle Routing and Break Scheduling

PB - Operational Methods for Production & Logistics (OMPL)

CY - onbekend

ER -

Meyer CM, Kopfer H, Kok AL, Schutten JMJ. Distributed Decision Making in Combined Vehicle Routing and Break Scheduling. onbekend: Operational Methods for Production & Logistics (OMPL), 2009. 9 p. (BETA Working Papers; 271).