IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v155y2007i1p107-11710.1007-s10479-007-0201-5.html
   My bibliography  Save this article

On assigning drivers for a home-delivery system on a performance basis

Author

Listed:
  • Sebastián Genta
  • Juan Muñoz

Abstract

Consider a firm providing home-delivery of small parcels within a short period of time. The paper proposes a method to estimate the productivity of each driver on any fictitious route using linear regressions. The method separates the trip time in terms of the time spent: with customers, driving, and all other activities. Our tests show that productivity, measured in terms of number of customers visited per hour, vary across drivers. Even more, the same driver’s productivity vary for peak and off-peak demand periods considerably. This methodology should enhance the reliability of the driver scheduling programs, since it reduces the error and bias of the productivity offered by the assigned set of drivers. It shall also improve the reliability of the delivery time promised to the customer. Copyright Springer Science+Business Media, LLC 2007

Suggested Citation

  • Sebastián Genta & Juan Muñoz, 2007. "On assigning drivers for a home-delivery system on a performance basis," Annals of Operations Research, Springer, vol. 155(1), pages 107-117, November.
    • Handle: RePEc:spr:annopr:v:155:y:2007:i:1:p:107-117:10.1007/s10479-007-0201-5
    DOI: 10.1007/s10479-007-0201-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-007-0201-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-007-0201-5?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Alberto Caprara & Paolo Toth & Daniele Vigo & Matteo Fischetti, 1998. "Modeling and Solving the Crew Rostering Problem," Operations Research, INFORMS, vol. 46(6), pages 820-830, December.
    2. Helena R. Lourenço & José P. Paixão & Rita Portugal, 2001. "Multiobjective Metaheuristics for the Bus Driver Scheduling Problem," Transportation Science, INFORMS, vol. 35(3), pages 331-343, August.
    3. Michael J. Brusco & Larry W. Jacobs & Robert J. Bongiorno & Duane V. Lyons & Baoxing Tang, 1995. "Improving Personnel Scheduling at Airline Stations," Operations Research, INFORMS, vol. 43(5), pages 741-751, October.
    4. Cynthia Barnhart & Rajesh G. Shenoi, 1998. "An Approximate Model and Solution Approach for the Long-Haul Crew Pairing Problem," Transportation Science, INFORMS, vol. 32(3), pages 221-231, August.
    5. Michel Gamache & François Soumis & Daniel Villeneuve & Jacques Desrosiers & Éric Gélinas, 1998. "The Preferential Bidding System at Air Canada," Transportation Science, INFORMS, vol. 32(3), pages 246-255, August.
    6. Diego Klabjan & Ellis L. Johnson & George L. Nemhauser & Eric Gelman & Srini Ramaswamy, 2001. "Airline Crew Scheduling with Regularity," Transportation Science, INFORMS, vol. 35(4), pages 359-374, November.
    7. Michel Gamache & François Soumis & Gérald Marquis & Jacques Desrosiers, 1999. "A Column Generation Approach for Large-Scale Aircrew Rostering Problems," Operations Research, INFORMS, vol. 47(2), pages 247-263, April.
    8. Pamela H. Vance & Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser, 1997. "Airline Crew Scheduling: A New Formulation and Decomposition Algorithm," Operations Research, INFORMS, vol. 45(2), pages 188-200, April.
    9. Diego Klabjan & Ellis L. Johnson & George L. Nemhauser & Eric Gelman & Srini Ramaswamy, 2002. "Airline Crew Scheduling with Time Windows and Plane-Count Constraints," Transportation Science, INFORMS, vol. 36(3), pages 337-348, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gianpaolo Ghiani & Emanuele Manni & Antonella Quaranta, 2010. "Shift Scheduling Problem in Same-Day Courier Industry," Transportation Science, INFORMS, vol. 44(1), pages 116-124, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Atoosa Kasirzadeh & Mohammed Saddoune & François Soumis, 2017. "Airline crew scheduling: models, algorithms, and data sets," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 111-137, June.
    2. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    3. Panta Lučić & Dušan Teodorović, 2007. "Metaheuristics approach to the aircrew rostering problem," Annals of Operations Research, Springer, vol. 155(1), pages 311-338, November.
    4. Cynthia Barnhart & Peter Belobaba & Amedeo R. Odoni, 2003. "Applications of Operations Research in the Air Transport Industry," Transportation Science, INFORMS, vol. 37(4), pages 368-391, November.
    5. Vahid Zeighami & François Soumis, 2019. "Combining Benders’ Decomposition and Column Generation for Integrated Crew Pairing and Personalized Crew Assignment Problems," Transportation Science, INFORMS, vol. 53(5), pages 1479-1499, September.
    6. Hanif D. Sherali & Ki-Hwan Bae & Mohamed Haouari, 2013. "An Integrated Approach for Airline Flight Selection and Timing, Fleet Assignment, and Aircraft Routing," Transportation Science, INFORMS, vol. 47(4), pages 455-476, November.
    7. Cynthia Barnhart & Amy Cohn, 2004. "Airline Schedule Planning: Accomplishments and Opportunities," Manufacturing & Service Operations Management, INFORMS, vol. 6(1), pages 3-22, November.
    8. Sebastian Ruther & Natashia Boland & Faramroze G. Engineer & Ian Evans, 2017. "Integrated Aircraft Routing, Crew Pairing, and Tail Assignment: Branch-and-Price with Many Pricing Problems," Transportation Science, INFORMS, vol. 51(1), pages 177-195, February.
    9. Mohamed Haouari & Farah Zeghal Mansour & Hanif D. Sherali, 2019. "A New Compact Formulation for the Daily Crew Pairing Problem," Transportation Science, INFORMS, vol. 53(3), pages 811-828, May.
    10. Mohammed Saddoune & Guy Desaulniers & Issmail Elhallaoui & François Soumis, 2012. "Integrated Airline Crew Pairing and Crew Assignment by Dynamic Constraint Aggregation," Transportation Science, INFORMS, vol. 46(1), pages 39-55, February.
    11. F. Zeynep Sargut & Caner Altuntaş & Dilek Cetin Tulazoğlu, 2017. "Multi-objective integrated acyclic crew rostering and vehicle assignment problem in public bus transportation," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 1071-1096, October.
    12. Ernst, A. T. & Jiang, H. & Krishnamoorthy, M. & Sier, D., 2004. "Staff scheduling and rostering: A review of applications, methods and models," European Journal of Operational Research, Elsevier, vol. 153(1), pages 3-27, February.
    13. Quesnel, Frédéric & Desaulniers, Guy & Soumis, François, 2020. "A branch-and-price heuristic for the crew pairing problem with language constraints," European Journal of Operational Research, Elsevier, vol. 283(3), pages 1040-1054.
    14. Parmentier, Axel & Meunier, Frédéric, 2020. "Aircraft routing and crew pairing: Updated algorithms at Air France," Omega, Elsevier, vol. 93(C).
    15. Haase, Knut, 1999. "Retail business staff scheduling under complex labor relations," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 511, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    16. Zhe Liang & Wanpracha Art Chaovalitwongse, 2013. "A Network-Based Model for the Integrated Weekly Aircraft Maintenance Routing and Fleet Assignment Problem," Transportation Science, INFORMS, vol. 47(4), pages 493-507, November.
    17. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    18. Shivaram Subramanian & Hanif D. Sherali, 2008. "An Effective Deflected Subgradient Optimization Scheme for Implementing Column Generation for Large-Scale Airline Crew Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 20(4), pages 565-578, November.
    19. Martin Durbin & Karla Hoffman, 2008. "OR PRACTICE---The Dance of the Thirty-Ton Trucks: Dispatching and Scheduling in a Dynamic Environment," Operations Research, INFORMS, vol. 56(1), pages 3-19, February.
    20. Michael J. Brusco & Larry W. Jacobs, 2000. "Optimal Models for Meal-Break and Start-Time Flexibility in Continuous Tour Scheduling," Management Science, INFORMS, vol. 46(12), pages 1630-1641, December.

    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:spr:annopr:v:155:y:2007:i:1:p:107-117:10.1007/s10479-007-0201-5. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.