IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v41y2011i2p123-134.html
   My bibliography  Save this article

ANWB Automates and Improves Service Personnel Dispatching

Author

Listed:
  • Peter van Huigenbosch

    (ANWB, 6874 NE Wolfheze, The Netherlands)

  • Joris van de Klundert

    (Erasmus University Rotterdam, 6200 MD Rotterdam, The Netherlands)

  • Laurens Wormer

    (Mateum, 6225 XS Maastricht, The Netherlands)

Abstract

The Dutch automobile association, Algemene Nederlandse Wielrijders Bond , Royal Dutch Touring Club (ANWB), provides roadside service on request to its nearly four million members. It responds to 1.3 million service requests per year. Historically, ANWB has organized its operational planning process of assigning requests to service personnel based on region; more than 50 planners, working in sometimes hectic environments, assigned the service personnel in real time. However, the association had little knowledge of how its operational planning decisions could affect the performance that its members experience. In a large business process reengineering project, ANWB redesigned its planning processes to use state-of-the-art information technology and operations research techniques. As few as 14 planners, who work at a national level, can now execute the planning processes. Service operations efficiency has improved by 14 percent. Moreover, as new competitors have entered the market, ANWB has been able to retain its high customer-satisfaction ratings and large market share in the consumer roadside-assistance market while adapting its services to market prices.

Suggested Citation

  • Peter van Huigenbosch & Joris van de Klundert & Laurens Wormer, 2011. "ANWB Automates and Improves Service Personnel Dispatching," Interfaces, INFORMS, vol. 41(2), pages 123-134, April.
  • Handle: RePEc:inm:orinte:v:41:y:2011:i:2:p:123-134
    DOI: 10.1287/inte.1100.0545
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.1100.0545
    Download Restriction: no

    File URL: https://libkey.io/10.1287/inte.1100.0545?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
    ---><---

    References listed on IDEAS

    as
    1. Dimitris J. Bertsimas & Garrett van Ryzin, 1991. "A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane," Operations Research, INFORMS, vol. 39(4), pages 601-615, August.
    2. Bertsimas, Dimitris & Van Ryzin, Garrett., 1991. "A stochastic and dynamic vehicle routing problem in the Euclidean plane," Working papers 3286-91., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    3. Sven Krumke & Sleman Saliba & Tjark Vredeveld & Stephan Westphal, 2008. "Approximation algorithms for a vehicle routing problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(2), pages 333-359, October.
    4. Soumia Ichoua & Michel Gendreau & Jean-Yves Potvin, 2000. "Diversion Issues in Real-Time Vehicle Dispatching," Transportation Science, INFORMS, vol. 34(4), pages 426-438, November.
    5. Joris van de Klundert & Laurens Wormer, 2010. "ASAP: The After-Salesman Problem," Manufacturing & Service Operations Management, INFORMS, vol. 12(4), pages 627-641, March.
    6. Bertsimas, Dimitris & Van Ryzin, Garrett., 1991. "Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles," Working papers 3287-91., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    Full references (including those not matched with items on IDEAS)

    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. Marlin W. Ulmer & Justin C. Goodson & Dirk C. Mattfeld & Marco Hennig, 2019. "Offline–Online Approximate Dynamic Programming for Dynamic Vehicle Routing with Stochastic Requests," Service Science, INFORMS, vol. 53(1), pages 185-202, February.
    2. Barrett W. Thomas & Chelsea C. White, 2004. "Anticipatory Route Selection," Transportation Science, INFORMS, vol. 38(4), pages 473-487, November.
    3. Joris van de Klundert & Laurens Wormer, 2010. "ASAP: The After-Salesman Problem," Manufacturing & Service Operations Management, INFORMS, vol. 12(4), pages 627-641, March.
    4. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    5. Jian Yang & Patrick Jaillet & Hani Mahmassani, 2004. "Real-Time Multivehicle Truckload Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 38(2), pages 135-148, May.
    6. Papastavrou, Jason D., 1996. "A stochastic and dynamic routing policy using branching processes with state dependent immigration," European Journal of Operational Research, Elsevier, vol. 95(1), pages 167-177, November.
    7. van de Klundert, J. & Wormer, L., 2008. "ASAP: the after salesman problem," Research Memorandum 054, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    8. Jürgen Branke & Martin Middendorf & Guntram Noeth & Maged Dessouky, 2005. "Waiting Strategies for Dynamic Vehicle Routing," Transportation Science, INFORMS, vol. 39(3), pages 298-312, August.
    9. Ghiani, Gianpaolo & Guerriero, Francesca & Laporte, Gilbert & Musmanno, Roberto, 2003. "Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies," European Journal of Operational Research, Elsevier, vol. 151(1), pages 1-11, November.
    10. Marlin W. Ulmer & Dirk C. Mattfeld & Felix Köster, 2018. "Budgeting Time for Dynamic Vehicle Routing with Stochastic Customer Requests," Transportation Science, INFORMS, vol. 52(1), pages 20-37, January.
    11. Pillac, Victor & Gendreau, Michel & Guéret, Christelle & Medaglia, Andrés L., 2013. "A review of dynamic vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 225(1), pages 1-11.
    12. Xiong Hao & Yan Huili, 2019. "General Method of Building a Real-Time Optimization Policy for Dynamic Vehicle Routing Problem," Journal of Systems Science and Information, De Gruyter, vol. 7(6), pages 584-598, December.
    13. Russell W. Bent & Pascal Van Hentenryck, 2004. "Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers," Operations Research, INFORMS, vol. 52(6), pages 977-987, December.
    14. Barrett W. Thomas, 2007. "Waiting Strategies for Anticipating Service Requests from Known Customer Locations," Transportation Science, INFORMS, vol. 41(3), pages 319-331, August.
    15. Sheridan, Patricia Kristine & Gluck, Erich & Guan, Qi & Pickles, Thomas & Balcıog˜lu, Barış & Benhabib, Beno, 2013. "The dynamic nearest neighbor policy for the multi-vehicle pick-up and delivery problem," Transportation Research Part A: Policy and Practice, Elsevier, vol. 49(C), pages 178-194.
    16. Allan Larsen & Oli B. G. Madsen & Marius M. Solomon, 2004. "The A Priori Dynamic Traveling Salesman Problem with Time Windows," Transportation Science, INFORMS, vol. 38(4), pages 459-472, November.
    17. Soeffker, Ninja & Ulmer, Marlin W. & Mattfeld, Dirk C., 2022. "Stochastic dynamic vehicle routing in the light of prescriptive analytics: A review," European Journal of Operational Research, Elsevier, vol. 298(3), pages 801-820.
    18. Lars M. Hvattum & Arne Løkketangen & Gilbert Laporte, 2006. "Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic," Transportation Science, INFORMS, vol. 40(4), pages 421-438, November.
    19. Atieh Madani & Rajan Batta & Mark Karwan, 2021. "The balancing traveling salesman problem: application to warehouse order picking," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(2), pages 442-469, July.
    20. Roberto Tadei & Guido Perboli & Francesca Perfetti, 2017. "The multi-path Traveling Salesman Problem with stochastic travel costs," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 3-23, March.

    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:inm:orinte:v:41:y:2011:i:2:p:123-134. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.