IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v35y1987i1p6-17.html
   My bibliography  Save this article

OR Practice—Computerized Vehicle Routing in the Soft Drink Industry

Author

Listed:
  • Bruce L. Golden

    (University of Maryland, College Park, Maryland)

  • Edward A. Wasil

    (American University, Washington, D.C.)

Abstract

This paper examines the use of microcomputer-based vehicle routing software in the soft drink industry. In general, the construction of vehicle routes is a complicated task due to the size of the fleet, the number of customers, difficult real-world constraints, and the fact that such routes must be constructed in a relatively short period of time. In the past several years, microcomputers have become more powerful and less expensive, thus enhancing their attractiveness to potential users. Not surprisingly, the marketplace has witnessed rapid growth in the number of vehicle routing packages that are commercially available. In this paper, we review some of the critical vehicle routing issues in the soft drink industry and present several case studies that highlight the ways in which software packages have been able to cope with these concerns and other industry-related problems. The case studies focus on the interfacility transfer of soft drink products, the delivery of products that have been ordered in advance by customers, and the delivery of soft drink products that are sold by drivers to customers.

Suggested Citation

  • Bruce L. Golden & Edward A. Wasil, 1987. "OR Practice—Computerized Vehicle Routing in the Soft Drink Industry," Operations Research, INFORMS, vol. 35(1), pages 6-17, February.
  • Handle: RePEc:inm:oropre:v:35:y:1987:i:1:p:6-17
    DOI: 10.1287/opre.35.1.6
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.35.1.6
    Download Restriction: no

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

    Citations

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


    Cited by:

    1. Thibaut Vidal & Teodor Gabriel Crainic & Michel Gendreau & Nadia Lahrichi & Walter Rei, 2012. "A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems," Operations Research, INFORMS, vol. 60(3), pages 611-624, June.
    2. D Ronen & C A Goodhart, 2008. "Tactical store delivery planning," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1047-1054, August.
    3. Belarmino Adenso-Díaz & Mónica González & Emérita García, 1998. "A Hierarchical Approach to Managing Dairy Routing," Interfaces, INFORMS, vol. 28(2), pages 21-31, April.
    4. Rodríguez-Martín, Inmaculada & Salazar-González, Juan-José & Yaman, Hande, 2019. "The periodic vehicle routing problem with driver consistency," European Journal of Operational Research, Elsevier, vol. 273(2), pages 575-584.
    5. Fred Blakeley & Burçin Argüello & Buyang Cao & Wolfgang Hall & Joseph Knolmajer, 2003. "Optimizing Periodic Maintenance Operations for Schindler Elevator Corporation," Interfaces, INFORMS, vol. 33(1), pages 67-79, February.
    6. R Baldacci & E Bartolini & G Laporte, 2010. "Some applications of the generalized vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(7), pages 1072-1077, July.
    7. Maoyu Luo & Jiaming Li & Lingzhi Wu & Weiqin Wang & Zhuoga Danzeng & Lamu Mima & Renfeng Ma, 2023. "The Spatial Mismatch between Tourism Resources and Economic Development in Mountainous Cities Impacted by Limited Highway Accessibility: A Typical Case Study of Lhasa City, Tibet Autonomous Region, Ch," Land, MDPI, vol. 12(5), pages 1-24, May.
    8. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms," Transportation Science, INFORMS, vol. 39(1), pages 104-118, February.
    9. Roberto Baldacci & Enrico Bartolini & Aristide Mingozzi & Andrea Valletta, 2011. "An Exact Algorithm for the Period Routing Problem," Operations Research, INFORMS, vol. 59(1), pages 228-241, February.
    10. Rodríguez-Martín, Inmaculada & Yaman, Hande, 2022. "Periodic Vehicle Routing Problem with Driver Consistency and service time optimization," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 468-484.
    11. Olli Bräysy & Michel Gendreau, 2002. "Tabu Search heuristics for the Vehicle Routing Problem with Time Windows," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 10(2), pages 211-237, December.
    12. J Privé & J Renaud & F Boctor & G Laporte, 2006. "Solving a vehicle-routing problem arising in soft-drink distribution," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(9), pages 1045-1052, September.

    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:oropre:v:35:y:1987:i:1:p:6-17. 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: 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.