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

Reconsidering the distribution structure of gasoline products for a large oil company

Author

Listed:
  • van der Bruggen, Lambert
  • Gruson, Ruud
  • Salomon, Marc

Abstract

No abstract is available for this item.

Suggested Citation

  • van der Bruggen, Lambert & Gruson, Ruud & Salomon, Marc, 1995. "Reconsidering the distribution structure of gasoline products for a large oil company," European Journal of Operational Research, Elsevier, vol. 81(3), pages 460-473, March.
    • Handle: RePEc:eee:ejores:v:81:y:1995:i:3:p:460-473
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)00189-J
    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. Gelders, Ludo F. & Pintelon, Liliane M. & Van Wassenhove, Luk N., 1987. "A location-allocation problem in a large Belgian brewery," European Journal of Operational Research, Elsevier, vol. 28(2), pages 196-206, February.
    2. Marshall L. Fisher, 1981. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 27(1), pages 1-18, January.
    3. S. Lin & B. W. Kernighan, 1973. "An Effective Heuristic Algorithm for the Traveling-Salesman Problem," Operations Research, INFORMS, vol. 21(2), pages 498-516, April.
    4. Michel Gendreau & Alain Hertz & Gilbert Laporte, 1992. "New Insertion and Postoptimization Procedures for the Traveling Salesman Problem," Operations Research, INFORMS, vol. 40(6), pages 1086-1094, December.
    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. 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. 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.
    3. 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.
    4. Yan Cheng Hsu & Jose L. Walteros & Rajan Batta, 2020. "Solving the petroleum replenishment and routing problem with variable demands and time windows," Annals of Operations Research, Springer, vol. 294(1), pages 9-46, November.
    5. 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.
    6. Goodson, Justin C., 2015. "A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands," European Journal of Operational Research, Elsevier, vol. 241(2), pages 361-369.
    7. 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.
    8. Jorge E. Mendoza & Bruno Castanier & Christelle Guéret & Andrés L. Medaglia & Nubia Velasco, 2011. "Constructive Heuristics for the Multicompartment Vehicle Routing Problem with Stochastic Demands," Transportation Science, INFORMS, vol. 45(3), pages 346-363, August.
    9. 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.
    10. 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.
    11. 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.
    12. 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.

    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. Mutsunori Yagiura & Toshihide Ibaraki & Fred Glover, 2004. "An Ejection Chain Approach for the Generalized Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 133-151, May.
    2. Keisuke Murakami, 2018. "Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(04), pages 1-22, August.
    3. Manerba, Daniele & Mansini, Renata & Riera-Ledesma, Jorge, 2017. "The Traveling Purchaser Problem and its variants," European Journal of Operational Research, Elsevier, vol. 259(1), pages 1-18.
    4. 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.
    5. Jamal Ouenniche & Prasanna K. Ramaswamy & Michel Gendreau, 2017. "A dual local search framework for combinatorial optimization problems with TSP application," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(11), pages 1377-1398, November.
    6. Yannis Marinakis & Athanasios Migdalas & Panos M. Pardalos, 2005. "A Hybrid Genetic—GRASP Algorithm Using Lagrangean Relaxation for the Traveling Salesman Problem," Journal of Combinatorial Optimization, Springer, vol. 10(4), pages 311-326, December.
    7. Li, Jianxiang & Chu, Feng & Chen, Haoxun, 2011. "A solution approach to the inventory routing problem in a three-level distribution system," European Journal of Operational Research, Elsevier, vol. 210(3), pages 736-744, 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. R Aringhieri & R Cordone, 2011. "Comparing local search metaheuristics for the maximum diversity problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(2), pages 266-280, February.
    10. Li, Jianxiang & Chen, Haoxun & Chu, Feng, 2010. "Performance evaluation of distribution strategies for the inventory routing problem," European Journal of Operational Research, Elsevier, vol. 202(2), pages 412-419, April.
    11. Bruce Golden & Zahra Naji-Azimi & S. Raghavan & Majid Salari & Paolo Toth, 2012. "The Generalized Covering Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 24(4), pages 534-553, November.
    12. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
    13. 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.
    14. Wolosewicz, Cathy & Dauzère-Pérès, Stéphane & Aggoune, Riad, 2015. "A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 3-12.
    15. M Diaby & A L Nsakanda, 2006. "Large-scale capacitated part-routing in the presence of process and routing flexibilities and setup costs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(9), pages 1100-1112, September.
    16. Ogbe, Emmanuel & Li, Xiang, 2017. "A new cross decomposition method for stochastic mixed-integer linear programming," European Journal of Operational Research, Elsevier, vol. 256(2), pages 487-499.
    17. Weijun Xie & Yanfeng Ouyang & Sze Chun Wong, 2016. "Reliable Location-Routing Design Under Probabilistic Facility Disruptions," Transportation Science, INFORMS, vol. 50(3), pages 1128-1138, August.
    18. Shangyao Yan & Chun-Ying Chen & Chuan-Che Wu, 2012. "Solution methods for the taxi pooling problem," Transportation, Springer, vol. 39(3), pages 723-748, May.
    19. Zi-bin Jiang & Qiong Yang, 2016. "A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem," PLOS ONE, Public Library of Science, vol. 11(11), pages 1-15, November.
    20. Stefan Poikonen & Bruce Golden, 2020. "The Mothership and Drone Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 249-262, April.

    More about this item

    Statistics

    Access and download statistics

    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:81:y:1995:i:3:p:460-473. 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.