IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v25y1997i2p225-234.html
   My bibliography  Save this article

A fuel distribution knowledge-based decision support system

Author

Listed:
  • Nussbaum, M.
  • Sepulveda, M.
  • Cobian, A.
  • Gaete, J.
  • Parra, E.
  • Cruz, J.

Abstract

This paper reports the experience of solving the distribution problem for the biggest fuel company in Chile. A planning, execution and control system for fuel distribution was developed. It employs a knowledge-based approach that utilizes a graphical user interface which mimics the mental model of the user. An automatic scheduler solves the Capacity Vehicle Routing Problem. The solution can be manually modified so verifying system consistency. The system is running throughout the country, 13 sites, having a positive impact on the three types of player. Plant managers have increased fleet efficiency and customers receive a higher quality service. Finally, the central administration obtains a report once a month from each of the plants that allows the strong and weak aspects of each site to be analyzed.

Suggested Citation

  • Nussbaum, M. & Sepulveda, M. & Cobian, A. & Gaete, J. & Parra, E. & Cruz, J., 1997. "A fuel distribution knowledge-based decision support system," Omega, Elsevier, vol. 25(2), pages 225-234, April.
  • Handle: RePEc:eee:jomega:v:25:y:1997:i:2:p:225-234
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(96)00059-X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Zanakis, Stelios H. & Evans, James R. & Vazacopoulos, Alkis A., 1989. "Heuristic methods and applications: A categorized survey," European Journal of Operational Research, Elsevier, vol. 43(1), pages 88-110, November.
    2. Marshall L. Fisher, 1994. "Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees," Operations Research, INFORMS, vol. 42(4), pages 626-642, August.
    3. Miguel Nussbaum & Eduardo A. Parra, 1993. "A Production Scheduling System," INFORMS Journal on Computing, INFORMS, vol. 5(2), pages 168-181, May.
    4. Chung-Lun Li & David Simchi-Levi & Martin Desrochers, 1992. "On the Distance Constrained Vehicle Routing Problem," Operations Research, INFORMS, vol. 40(4), pages 790-799, August.
    5. Lawrence D. Bodin, 1990. "Twenty Years of Routing and Scheduling," Operations Research, INFORMS, vol. 38(4), pages 571-579, 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. Day, Jamison M. & Daniel Wright, P. & Schoenherr, Tobias & Venkataramanan, Munirpallam & Gaudette, Kevin, 2009. "Improving routing and scheduling decisions at a distributor of industrial gasses," Omega, Elsevier, vol. 37(1), pages 227-237, February.
    2. Furkan Uzar, M. & Çatay, Bülent, 2012. "Distribution planning of bulk lubricants at BP Turkey," Omega, Elsevier, vol. 40(6), pages 870-881.

    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. Liu, Ran & Jiang, Zhibin, 2012. "The close–open mixed vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 349-360.
    2. Malmborg, Charles J., 1996. "A genetic algorithm for service level based vehicle scheduling," European Journal of Operational Research, Elsevier, vol. 93(1), pages 121-134, August.
    3. Kezong Tang & Xiong-Fei Wei & Yuan-Hao Jiang & Zi-Wei Chen & Lihua Yang, 2023. "An Adaptive Ant Colony Optimization for Solving Large-Scale Traveling Salesman Problem," Mathematics, MDPI, vol. 11(21), pages 1-26, October.
    4. Andrea Lodi & Enrico Malaguti & Nicolás E. Stier-Moses & Tommaso Bonino, 2016. "Design and Control of Public-Service Contracts and an Application to Public Transportation Systems," Management Science, INFORMS, vol. 62(4), pages 1165-1187, April.
    5. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    6. Derigs, U. & Kaiser, R., 2007. "Applying the attribute based hill climber heuristic to the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 177(2), pages 719-732, March.
    7. César Rego, 1998. "A Subpath Ejection Method for the Vehicle Routing Problem," Management Science, INFORMS, vol. 44(10), pages 1447-1459, October.
    8. Sana Jawarneh & Salwani Abdullah, 2015. "Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows," PLOS ONE, Public Library of Science, vol. 10(7), pages 1-23, July.
    9. R. Baldacci & E. Hadjiconstantinou & A. Mingozzi, 2004. "An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation," Operations Research, INFORMS, vol. 52(5), pages 723-738, October.
    10. Martinhon, Carlos & Lucena, Abilio & Maculan, Nelson, 2004. "Stronger K-tree relaxations for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 158(1), pages 56-71, October.
    11. Jerzy Grobelny & Rafal Michalski, 2016. "A concept of a flexible approach to the facilities layout problems in logistics systems," WORking papers in Management Science (WORMS) WORMS/16/11, Department of Operations Research and Business Intelligence, Wroclaw University of Science and Technology.
    12. Paredes-Belmar, Germán & Montero, Elizabeth & Lüer-Villagra, Armin & Marianov, Vladimir & Araya-Sassi, Claudio, 2022. "Vehicle routing for milk collection with gradual blending: A case arising in Chile," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1403-1416.
    13. Amirsaman Kheirkhah & HamidReza Navidi & Masume Messi Bidgoli, 2016. "A bi-level network interdiction model for solving the hazmat routing problem," International Journal of Production Research, Taylor & Francis Journals, vol. 54(2), pages 459-471, January.
    14. Drexl, Michael & Schneider, Michael, 2015. "A survey of variants and extensions of the location-routing problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 283-308.
    15. 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.
    16. Paredes-Belmar, Germán & Marianov, Vladimir & Bronfman, Andrés & Obreque, Carlos & Lüer-Villagra, Armin, 2016. "A milk collection problem with blending," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 94(C), pages 26-43.
    17. Pages, Laia & Jayakrishnan, R. & Cortes, Cristian E., 2005. "Real-Time Mass Passenger Transport Network Optimization Problems," University of California Transportation Center, Working Papers qt7w88d089, University of California Transportation Center.
    18. Koyuncu, Işıl & Yavuz, Mesut, 2019. "Duplicating nodes or arcs in green vehicle routing: A computational comparison of two formulations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 122(C), pages 605-623.
    19. Marshall Fisher, 2007. "Strengthening the Empirical Base of Operations Management," Manufacturing & Service Operations Management, INFORMS, vol. 9(4), pages 368-382, December.
    20. Boschetti, Marco Antonio & Maniezzo, Vittorio & Strappaveccia, Francesco, 2017. "Route relaxations on GPU for vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 258(2), pages 456-466.

    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:eee:jomega:v:25:y:1997:i:2:p:225-234. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.