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

The DSS LOGDIS Optimizes Delivery Routes for FRILAC’s Frozen Products

Author

Listed:
  • Javier Faulin

    (Department of Statistics and Operations Research, Los Magnolios Building, Campus Arrosadia, Public University of Navarra, 31006 Pamplona, Navarre, Spain)

  • Pablo Sarobe

    (Tecnicia Corporation, Poligono Landaben J Street, 31012 Pamplona, Navarre, Spain)

  • Jorge Simal

    (Tecnicia Corporation, Poligono Landaben J Street, 31012 Pamplona, Navarre, Spain)

Abstract

We designed a decision-support system for FRILAC Company in Navarre, Spain, to optimize its routes for delivering frozen products. FRILAC’s logistics department had been organizing deliveries based on vehicle runs, but FRILAC deemed this process inaccurate and expensive. We suggested simplifying this procedure by creating a decision-support system (DSS). We had a twofold aim: to design a route builder geared specifically to the road network of the area and to integrate the DSS into the global management of the company. We achieved both objectives by constructing the DSS LOGDIS in Microsoft Access. LOGDIS, using Clarke and Wright’s (1964) algorithm, designs routes that minimize distances traveled, shows final outcomes on screen, creates reports for vehicle drivers, and estimates route costs. FRILAC has successfully implemented the results, reaching an average cost saving of 10 percent.

Suggested Citation

  • Javier Faulin & Pablo Sarobe & Jorge Simal, 2005. "The DSS LOGDIS Optimizes Delivery Routes for FRILAC’s Frozen Products," Interfaces, INFORMS, vol. 35(3), pages 202-214, June.
    • Handle: RePEc:inm:orinte:v:35:y:2005:i:3:p:202-214
    DOI: 10.1287/inte.1050.0134
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.1050.0134
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.1050.0134?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. Fred Glover & Gene Jones & David Karney & Darwin Klingman & John Mote, 1979. "An Integrated Production, Distribution, and Inventory Planning System," Interfaces, INFORMS, vol. 9(5), pages 21-35, November.
    2. Michel Gendreau & Alain Hertz & Gilbert Laporte, 1994. "A Tabu Search Heuristic for the Vehicle Routing Problem," Management Science, INFORMS, vol. 40(10), pages 1276-1290, October.
    3. Gerald Brown & Joseph Keegan & Brian Vigus & Kevin Wood, 2001. "The Kellogg Company Optimizes Production, Inventory, and Distribution," Interfaces, INFORMS, vol. 31(6), pages 1-15, December.
    4. John Pooley, 1994. "Integrated Production and Distribution Facility Planning at Ault Foods," Interfaces, INFORMS, vol. 24(4), pages 113-121, August.
    5. Clarence H. Martin & Denver C. Dent & James C. Eckhart, 1993. "Integrated Production, Distribution, and Inventory Planning at Libbey-Owens-Ford," Interfaces, INFORMS, vol. 23(3), pages 68-78, June.
    6. Billy E. Gillett & Leland R. Miller, 1974. "A Heuristic Algorithm for the Vehicle-Dispatch Problem," Operations Research, INFORMS, vol. 22(2), pages 340-349, April.
    7. F. Fumero & C. Vercellis, 1999. "Synchronized Development of Production, Inventory, and Distribution Schedules," Transportation Science, INFORMS, vol. 33(3), pages 330-340, August.
    8. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, August.
    9. Ephraim Martin, 1998. "Centralized Bakery Reduces Distribution Costs Using Simulation," Interfaces, INFORMS, vol. 28(4), pages 38-46, August.
    10. Paessens, H., 1988. "The savings algorithm for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 34(3), pages 336-344, March.
    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. Adrian Serrano-Hernandez & Aitor Ballano & Javier Faulin, 2021. "Selecting Freight Transportation Modes in Last-Mile Urban Distribution in Pamplona (Spain): An Option for Drone Delivery in Smart Cities," Energies, MDPI, vol. 14(16), pages 1-17, August.
    2. Yu, Mingzhu & Qi, Xiangtong, 2014. "A vehicle routing problem with multiple overlapped batches," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 40-55.
    3. B. Madhu Rao & Petros Xanthopoulos & Qipeng Phil Zheng, 2020. "Case Article—DeLand Crayon Company: An Application of the Traveling Salesman Problem to Production Scheduling with Sequence-Dependent Setup Times," INFORMS Transactions on Education, INFORMS, vol. 20(2), pages 93-98, January.
    4. Sun, Li & Zhao, Lindu & Hou, Jing, 2015. "Optimization of postal express line network under mixed driving pattern of trucks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 77(C), pages 147-169.

    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. Gilbert Laporte, 2009. "Fifty Years of Vehicle Routing," Transportation Science, INFORMS, vol. 43(4), pages 408-416, November.
    2. Hrabec, Dušan & Hvattum, Lars Magnus & Hoff, Arild, 2022. "The value of integrated planning for production, inventory, and routing decisions: A systematic review and meta-analysis," International Journal of Production Economics, Elsevier, vol. 248(C).
    3. César Rego, 1998. "A Subpath Ejection Method for the Vehicle Routing Problem," Management Science, INFORMS, vol. 44(10), pages 1447-1459, October.
    4. Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2014. "Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem," Transportation Science, INFORMS, vol. 48(1), pages 20-45, February.
    5. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    6. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    7. A A Juan & J Faulin & J Jorba & D Riera & D Masip & B Barrios, 2011. "On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(6), pages 1085-1097, June.
    8. Angel Juan & Javier Faulin & Albert Ferrer & Helena Lourenço & Barry Barrios, 2013. "MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(1), pages 109-132, April.
    9. Burcu B. Keskin & Halit Üster, 2012. "Production/distribution system design with inventory considerations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(2), pages 172-195, March.
    10. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    11. Chu, Ching-Wu, 2005. "A heuristic algorithm for the truckload and less-than-truckload problem," European Journal of Operational Research, Elsevier, vol. 165(3), pages 657-667, September.
    12. Sleman Saliba, 2006. "Heuristics for the lexicographic max-ordering vehicle routing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 14(3), pages 313-336, September.
    13. Crainic, Teodor Gabriel & Laporte, Gilbert, 1997. "Planning models for freight transportation," European Journal of Operational Research, Elsevier, vol. 97(3), pages 409-438, March.
    14. J Faulin & A García del Valle, 2008. "Solving the capacitated vehicle routing problem using the ALGELECT electrostatic algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(12), pages 1685-1695, December.
    15. Lei Lei & Hua Zhong & W. Art Chaovalitwongse, 2009. "On the Integrated Production and Distribution Problem with Bidirectional Flows," INFORMS Journal on Computing, INFORMS, vol. 21(4), pages 585-598, November.
    16. Li, Yantong & Chu, Feng & Chu, Chengbin & Zhu, Zhanguo, 2019. "An efficient three-level heuristic for the large-scaled multi-product production routing problem with outsourcing," European Journal of Operational Research, Elsevier, vol. 272(3), pages 914-927.
    17. Gilbert Laporte, 2007. "What you should know about the vehicle routing problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(8), pages 811-819, December.
    18. Chiang, Wen-Chyuan & Russell, Robert A., 2004. "Integrating purchasing and routing in a propane gas supply chain," European Journal of Operational Research, Elsevier, vol. 154(3), pages 710-729, May.
    19. Acar, Yavuz & Atadeniz, Sukran Nilvana, 2015. "Comparison of integrated and local planning approaches for the supply network of a globally-dispersed enterprise," International Journal of Production Economics, Elsevier, vol. 167(C), pages 204-219.
    20. Haughton, Michael A., 1998. "The performance of route modification and demand stabilization strategies in stochastic vehicle routing," Transportation Research Part B: Methodological, Elsevier, vol. 32(8), pages 551-566, November.

    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:35:y:2005:i:3:p:202-214. 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.