Discrete optimization model and algorithm for driver planning in periodic driver routing problem

DOI10.1155/2019/9476362MaRDI QIDQ2296607zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 18 February 2020

Published in Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2019/9476362

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Theory of organizations, manpower planning in operations research (90B70)

Review text

Summary: Workforce planning is an operation management problem in the delivery industry to improve service quality and reliability, and the working attitude and passion of drivers, as the direct implementors of delivery service, affect the service level. Consequently, assigning equal workload for drivers so as to improve drivers' acceptance is a reasonable and efficient workforce plan for managers. This paper investigates a periodic driver routing problem to explore the relationship between workload differential among drivers and total workload; the objective of the optimization problem is to minimize the total workload. To tackle this problem, we first propose a mixed-integer linear programming model, which can be solved by an off-the-shelf mixed-integer linear programming solver, and use the local branching based method to solve larger instances of the problem. Numerical experiments are conducted to validate the effectiveness and efficiency of the proposed model and solution method, as well as the effect of small workload differential among drivers on the total workload.

Recommendations

• Workforce planning for O2O delivery systems with crowdsourced drivers
• The periodic vehicle routing problem with driver consistency
• A Heuristic for the Periodic Vehicle Routing Problem
• Workforce scheduling and routing problems: literature survey and computational study
• Une approche de recouvrement d'ensembles pour l'établissement d'horaires de chauffeurs dans le transport routier de charges partielles

Cites work

• A branch-and-cut framework for the consistent traveling salesman problem
• A template-based adaptive large neighborhood search for the consistent vehicle routing problem
• An algorithm for the capacitated vehicle routing problem with route balancing
• An evolutionary algorithm for the vehicle routing problem with route balancing
• Column generation based heuristic for tactical planning in multi-period vehicle routing
• Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector
• Dynamic vehicle routing problems with enhanced ant colony optimization
• Flexibility and complexity in periodic distribution problems
• scientific article; zbMATH DE number 5247432 (Why is no real title available?)
• Improved load balancing and resource utilization for the skill vehicle routing problem
• Mid-term and short-term planning support for home health care services
• On service consistency in multi-period vehicle routing
• Solving min-max multi-depot vehicle routing problem
• Tactical berth allocation under uncertainty
• The multi-objective generalized consistent vehicle routing problem

Cited in

(2)

• Workforce planning for O2O delivery systems with crowdsourced drivers
• Workload equity in multiperiod vehicle routing problems

This page was built for publication: Discrete optimization model and algorithm for driver planning in periodic driver routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2296607)