IDEAS home Printed from https://ideas.repec.org/a/hin/jnddns/9476362.html
   My bibliography  Save this article

Discrete Optimization Model and Algorithm for Driver Planning in Periodic Driver Routing Problem

Author

Listed:
  • Lin Huang
  • Wenya Lv
  • Qian Sun
  • Chengle Ma

Abstract

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.

Suggested Citation

  • Lin Huang & Wenya Lv & Qian Sun & Chengle Ma, 2019. "Discrete Optimization Model and Algorithm for Driver Planning in Periodic Driver Routing Problem," Discrete Dynamics in Nature and Society, Hindawi, vol. 2019, pages 1-10, February.
    • Handle: RePEc:hin:jnddns:9476362
    DOI: 10.1155/2019/9476362
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/DDNS/2019/9476362.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/DDNS/2019/9476362.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2019/9476362?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnddns:9476362. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.