The Driver Assignment Vehicle Routing Problem

被引:8
|
作者
Spliet, Remy [1 ]
Dekker, Rommert [1 ]
机构
[1] Erasmus Univ, Inst Econometr, Rotterdam, Netherlands
关键词
vehicle routing; driver assignment; clustering; Lagrangian relaxation; branch-and-bound; consistency; distribution networks; ALGORITHM; LOCATION;
D O I
10.1002/net.21694
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We introduce the driver assignment vehicle routing problem, DAVRP. In this problem, drivers are assigned to customers before demand is known, and after demand is known a routing schedule has to be made such that every driver visits at least a fraction a of its assigned customers. We present a solution procedure to investigate how much transportation costs increase by adhering to the driver assignments. Furthermore, we distinguish between the case in which customers that are not visited by their assigned driver are visited by backup drivers only, and the case in which slack capacity of regular drivers is utilized to visit these customers. We use randomly generated instances of the DAVRP to provide examples where the difference in transportation costs is substantial. (C) 2016 Wiley Periodicals, Inc.
引用
收藏
页码:212 / 223
页数:12
相关论文
共 50 条
  • [11] Open vehicle routing problem with driver nodes and time deadlines
    Aksen, D.
    Oezyurt, Z.
    Aras, N.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2007, 58 (09) : 1223 - 1234
  • [12] Vehicle routing problem and driver behaviour: a review and framework for analysis
    Srinivas, S. Srivatsa
    Gajanand, M. S.
    TRANSPORT REVIEWS, 2017, 37 (05) : 590 - 611
  • [13] Immediate Parcel to Vehicle Assignment for Cross Docking in City Logistics: A Dynamic Assignment Vehicle Routing Problem
    Phillipson, F.
    de Koff, S. E.
    PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON OPERATIONS RESEARCH AND ENTERPRISE SYSTEMS (ICORES), 2020, : 138 - 142
  • [14] Periodic Vehicle Routing Problem with Driver Consistency and service time optimization
    Rodriguez-Martin, Inmaculada
    Yaman, Hande
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2022, 166 : 468 - 484
  • [15] Driver's Workload Comparison in Waste Collection Vehicle Routing Problem
    Benjamin, Aida Mauziah
    Abdul-Rahman, Syariza
    4TH INTERNATIONAL CONFERENCE ON QUANTITATIVE SCIENCES AND ITS APPLICATIONS (ICOQSIA 2016), 2016, 1782
  • [16] Ant Colony Optimization for a Stochastic Vehicle Routing Problem with Driver Learning
    Schneider, Michael
    Doppstadt, Christian
    Stenger, Andreas
    Schwind, Michael
    2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2010,
  • [17] Optimizing driver consistency in the vehicle routing problem under uncertain environment
    Yang, Meng
    Ni, Yaodong
    Song, Qinyu
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2022, 164
  • [18] Driver's Workload Analysis for Waste Collection Vehicle Routing Problem
    Benjamin, Aida Mauziah
    Rahman, Syariza Abdul
    Hashim, Fazlini
    2015 INTERNATIONAL SYMPOSIUM ON MATHEMATICAL SCIENCES AND COMPUTING RESEARCH (ISMSC), 2015, : 392 - 395
  • [19] THE SIMULTANEOUS ORIGIN-DESTINATION ASSIGNMENT AND VEHICLE-ROUTING PROBLEM
    SOUMIS, F
    SAUVE, M
    LEBEAU, L
    TRANSPORTATION SCIENCE, 1991, 25 (03) : 188 - 200
  • [20] Dynamic Assignment Vehicle Routing Problem with Generalised Capacity and Unknown Workload
    Phillipson, F.
    de Koff, S. E.
    van Ommeren, C.
    Quak, H.
    PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON OPERATIONS RESEARCH AND ENTERPRISE SYSTEMS (ICORES), 2020, : 329 - 335