IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v264y2018i2p637-652.html
   My bibliography  Save this article

A transient stochastic simulation–optimization model for operational fuel planning in-theater

Author

Listed:
  • Lobo, Benjamin J.
  • Brown, Donald E.
  • Gerber, Matthew S.
  • Grazaitis, Peter J.

Abstract

Army fuel planners are responsible for developing daily loading plans that specify which tankers to load, with what fuel, and where to send the loaded tankers. The tools used to accomplish this task are custom built spreadsheets which require large amounts of time and effort to use, update, and keep free of errors. This research presents a transient stochastic simulation–optimization model of the in-theater bulk fuel supply chain, where the simulation model is used to simulate the performance of the fuel supply chain under a particular fuel distribution policy and the optimization portion is used to update the policy so that it results in the performance desired by the Army fuel planner. The fuel distribution policy can then be used to derive the daily loading plan. Due to the multi-objective nature of the problem, the set of policies that form the efficient frontier are all candidate policies for the Army fuel planner to select from. Results of experimentation with a wide variety of supply chain scenarios indicate that, for a given supply chain scenario, the optimization portion of the model identifies a set of fuel distribution policies that address the objectives of the Army fuel planner. In addition, the simulation–optimization model comfortably solves the largest supply chain scenarios the Army fuel planner would reasonably be expected to encounter.

Suggested Citation

  • Lobo, Benjamin J. & Brown, Donald E. & Gerber, Matthew S. & Grazaitis, Peter J., 2018. "A transient stochastic simulation–optimization model for operational fuel planning in-theater," European Journal of Operational Research, Elsevier, vol. 264(2), pages 637-652.
  • Handle: RePEc:eee:ejores:v:264:y:2018:i:2:p:637-652
    DOI: 10.1016/j.ejor.2017.06.057
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221717305982
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2017.06.057?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. Vidović, Milorad & Popović, Dražen & Ratković, Branislava, 2014. "Mixed integer and heuristics model for the inventory routing problem in fuel delivery," International Journal of Production Economics, Elsevier, vol. 147(PC), pages 593-604.
    2. W L Ng & S C H Leung & J K P Lam & S W Pan, 2008. "Petrol delivery tanker assignment and routing: a case study in Hong Kong," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(9), pages 1191-1200, September.
    3. K Katsaliaki & S C Brailsford, 2007. "Using simulation to improve the blood supply chain," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(2), pages 219-227, February.
    4. F Cornillier & F F Boctor & G Laporte & J Renaud, 2008. "An exact algorithm for the petrol station replenishment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 607-615, May.
    5. Coelho, Leandro C. & Laporte, Gilbert, 2015. "Classification, models and exact algorithms for multi-compartment delivery problems," European Journal of Operational Research, Elsevier, vol. 242(3), pages 854-864.
    6. Cornillier, Fabien & Boctor, Fayez F. & Laporte, Gilbert & Renaud, Jacques, 2008. "A heuristic for the multi-period petrol station replenishment problem," European Journal of Operational Research, Elsevier, vol. 191(2), pages 295-305, December.
    7. Gunasekaran, A. & Patel, C. & McGaughey, Ronald E., 2004. "A framework for supply chain performance measurement," International Journal of Production Economics, Elsevier, vol. 87(3), pages 333-347, February.
    8. Avella, Pasquale & Boccia, Maurizio & Sforza, Antonio, 2004. "Solving a fuel delivery problem by heuristic and exact approaches," European Journal of Operational Research, Elsevier, vol. 152(1), pages 170-179, January.
    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. Li, Na & Pan, Jie & Xie, Xiaoqing, 2020. "Operational decision making for a referral coordination alliance- When should patients be referred and where should they be referred to?," Omega, Elsevier, vol. 96(C).
    2. Lobo, Benjamin J. & Brown, Donald E. & Grazaitis, Peter J., 2019. "Long-term forecasting of fuel demand at theater entry points," International Journal of Forecasting, Elsevier, vol. 35(2), pages 502-520.

    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. Ostermeier, Manuel & Henke, Tino & Hübner, Alexander & Wäscher, Gerhard, 2021. "Multi-compartment vehicle routing problems: State-of-the-art, modeling framework and future directions," European Journal of Operational Research, Elsevier, vol. 292(3), pages 799-817.
    2. Bani, Abderrahman & El Hallaoui, Issmail & Corréa, Ayoub Insa & Tahir, Adil, 2023. "Solving a real-world multi-depot multi-period petrol replenishment problem with complex loading constraints," European Journal of Operational Research, Elsevier, vol. 311(1), pages 154-172.
    3. Hiba Yahyaoui & Islem Kaabachi & Saoussen Krichen & Abdulkader Dekdouk, 2020. "Two metaheuristic approaches for solving the multi-compartment vehicle routing problem," Operational Research, Springer, vol. 20(4), pages 2085-2108, December.
    4. Samira Mirzaei & Sanne Wøhlk, 2019. "A Branch-and-Price algorithm for two multi-compartment vehicle routing problems," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(1), pages 1-33, March.
    5. Vasilii A. Gromov & Konstantin A. Kuznietzov & Timothy Pigden, 2019. "Decision support system for light petroleum products supply chain," Operational Research, Springer, vol. 19(1), pages 219-236, March.
    6. Cornillier, Fabien & Boctor, Fayez & Renaud, Jacques, 2012. "Heuristics for the multi-depot petrol station replenishment problem with time windows," European Journal of Operational Research, Elsevier, vol. 220(2), pages 361-369.
    7. Samira Mirzaei & Sanne Wøhlk, 2017. "Erratum to: A Branch-and-Price algorithm for two multi-compartment vehicle routing problems," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 185-218, June.
    8. Tino Henke & M. Grazia Speranza & Gerhard Wäscher, 2019. "A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes," Annals of Operations Research, Springer, vol. 275(2), pages 321-338, April.
    9. Martins, Sara & Ostermeier, Manuel & Amorim, Pedro & Hübner, Alexander & Almada-Lobo, Bernardo, 2019. "Product-oriented time window assignment for a multi-compartment vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 276(3), pages 893-909.
    10. Heßler, Katrin, 2021. "Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes," European Journal of Operational Research, Elsevier, vol. 294(1), pages 188-205.
    11. Furkan Uzar, M. & Çatay, Bülent, 2012. "Distribution planning of bulk lubricants at BP Turkey," Omega, Elsevier, vol. 40(6), pages 870-881.
    12. Guilherme Baptista & Miguel Vieira & Telmo Pinto, 2024. "An Exact Approach to the Multi-Compartment Vehicle Routing Problem: The Case of a Fuel Distribution Company," Mathematics, MDPI, vol. 12(4), pages 1-14, February.
    13. Lahyani, Rahma & Coelho, Leandro C. & Khemakhem, Mahdi & Laporte, Gilbert & Semet, Frédéric, 2015. "A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia," Omega, Elsevier, vol. 51(C), pages 1-10.
    14. Pasquale Carotenuto & Stefano Giordani & Alessio Salvatore, 2024. "A Matheuristic Approach for the Multi-Depot Periodic Petrol Station Replenishment Problem," Mathematics, MDPI, vol. 12(3), pages 1-19, January.
    15. Li, Kunpeng & Chen, Bin & Sivakumar, Appa Iyer & Wu, Yong, 2014. "An inventory–routing problem with the objective of travel time minimization," European Journal of Operational Research, Elsevier, vol. 236(3), pages 936-945.
    16. Alinaghian, Mahdi & Shokouhi, Nadia, 2018. "Multi-depot multi-compartment vehicle routing problem, solved by a hybrid adaptive large neighborhood search," Omega, Elsevier, vol. 76(C), pages 85-99.
    17. Ostermeier, Manuel & Hübner, Alexander, 2018. "Vehicle selection for a multi-compartment vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 269(2), pages 682-694.
    18. Coelho, Leandro C. & Laporte, Gilbert, 2015. "Classification, models and exact algorithms for multi-compartment delivery problems," European Journal of Operational Research, Elsevier, vol. 242(3), pages 854-864.
    19. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    20. Nasr Al-Hinai & Chefi Triki, 2020. "A two-level evolutionary algorithm for solving the petrol station replenishment problem with periodicity constraints and service choice," Annals of Operations Research, Springer, vol. 286(1), pages 325-350, 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:eee:ejores:v:264:y:2018:i:2:p:637-652. 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/locate/eor .

    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.