Discrete Optimization Model and Algorithm for Driver Planning in Periodic Driver Routing Problem
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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2019-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2019/9476362 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850234832937811968 |
|---|---|
| author | Lin Huang Wenya Lv Qian Sun Chengle Ma |
| author_facet | Lin Huang Wenya Lv Qian Sun Chengle Ma |
| author_sort | Lin Huang |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-0f8a3209539645368f255eea355b5b1d |
| institution | OA Journals |
| issn | 1026-0226 1607-887X |
| language | English |
| publishDate | 2019-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Discrete Dynamics in Nature and Society |
| spelling | doaj-art-0f8a3209539645368f255eea355b5b1d2025-08-20T02:02:30ZengWileyDiscrete Dynamics in Nature and Society1026-02261607-887X2019-01-01201910.1155/2019/94763629476362Discrete Optimization Model and Algorithm for Driver Planning in Periodic Driver Routing ProblemLin Huang0Wenya Lv1Qian Sun2Chengle Ma3School of Management, Shanghai University, Shanghai, ChinaSchool of Management, Shanghai University, Shanghai, ChinaSchool of Management, Shanghai University, Shanghai, ChinaSchool of Management, Shanghai University, Shanghai, ChinaWorkforce 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.http://dx.doi.org/10.1155/2019/9476362 |
| spellingShingle | Lin Huang Wenya Lv Qian Sun Chengle Ma Discrete Optimization Model and Algorithm for Driver Planning in Periodic Driver Routing Problem Discrete Dynamics in Nature and Society |
| title | Discrete Optimization Model and Algorithm for Driver Planning in Periodic Driver Routing Problem |
| title_full | Discrete Optimization Model and Algorithm for Driver Planning in Periodic Driver Routing Problem |
| title_fullStr | Discrete Optimization Model and Algorithm for Driver Planning in Periodic Driver Routing Problem |
| title_full_unstemmed | Discrete Optimization Model and Algorithm for Driver Planning in Periodic Driver Routing Problem |
| title_short | Discrete Optimization Model and Algorithm for Driver Planning in Periodic Driver Routing Problem |
| title_sort | discrete optimization model and algorithm for driver planning in periodic driver routing problem |
| url | http://dx.doi.org/10.1155/2019/9476362 |
| work_keys_str_mv | AT linhuang discreteoptimizationmodelandalgorithmfordriverplanninginperiodicdriverroutingproblem AT wenyalv discreteoptimizationmodelandalgorithmfordriverplanninginperiodicdriverroutingproblem AT qiansun discreteoptimizationmodelandalgorithmfordriverplanninginperiodicdriverroutingproblem AT chenglema discreteoptimizationmodelandalgorithmfordriverplanninginperiodicdriverroutingproblem |