We analyze the problem of combined vehicle routing and break scheduling from a distributed decision making perspective. The problem of combined vehicle routing and break scheduling can be defined as the problem of finding vehicle routes to serve a set of customers such that a cost criterion is minimized and legal rules on driving and working hours are observed. In the literature, this problem is always analyzed from a central planning perspective. In practice, however, this problem is solved interactively between planners and drivers. In many practical scenarios, the planner first clusters the customer requests and instructs the drivers which customers they have to visit. Subsequently, the drivers decide upon the routes to be taken and their break schedules. We apply a framework for distributed decision making to model this planning scenario and propose various ways for planners to anticipate the drivers' planning behavior. Especially in the case of antagonistic objectives, which are often encountered in practice, a distributed decision making perspective is necessary to analyze this planning process. Computational experiments demonstrate that a high degree of anticipation by the planner has a strong positive impact on the overall planning quality, especially in the case of conflicting planner's and drivers' objectives.
|Place of Publication||onbekend|
|Publisher||University of Twente, Research School for Operations Management and Logistics (BETA)|
|Number of pages||23|
|Publication status||Published - 2009|
|Name||BETA Working Paper|
|Publisher||Beta Research School for Operations Management and Logistics, University of Twente|
- Break scheduling
- Distributed decision making
- Vehicle routing
Meyer, C. M., Kok, A. L., Kopfer, H., & Schutten, J. M. J. (2009). Analyzing combined vehicle routing and break scheduling from a distributed decision making perspective. (BETA Working Paper; No. 289). onbekend: University of Twente, Research School for Operations Management and Logistics (BETA).