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

A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia

Author

Listed:
  • Lahyani, Rahma
  • Coelho, Leandro C.
  • Khemakhem, Mahdi
  • Laporte, Gilbert
  • Semet, Frédéric

Abstract

We introduce, model and solve to optimality a rich multi-product, multi-period and multi-compartment vehicle routing problem with a required compartment cleaning activity. This real-life application arises in the olive oil collection process in Tunisia, where regional collection offices dispose of a fleet of vehicles to collect one or several grades of olive oil from a set of producers. For each grade, the quantity offered by a producer changes dynamically over the planning horizon. We first provide a mathematical formulation of the problem, along with a set of known and new valid inequalities. We then propose an exact branch-and-cut algorithm to solve the problem. We evaluate the performance of the algorithm on real data sets under different transportation scenarios to demonstrate to our industrial partner the advantages of using multi-compartment vehicles.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:jomega:v:51:y:2015:i:c:p:1-10
    DOI: 10.1016/j.omega.2014.08.007
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.omega.2014.08.007?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. 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.
    2. Manuel Iori & Silvano Martello, 2010. "Routing problems with loading constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 4-27, July.
    3. Elin Halvorsen-Weare & Kjetil Fagerholt, 2013. "Routing and scheduling in a liquefied natural gas shipping problem with inventory and berth constraints," Annals of Operations Research, Springer, vol. 203(1), pages 167-186, March.
    4. Christiansen, Marielle & Fagerholt, Kjetil & Flatberg, Truls & Haugen, Øyvind & Kloster, Oddvar & Lund, Erik H., 2011. "Maritime inventory routing with multiple products: A case study from the cement industry," European Journal of Operational Research, Elsevier, vol. 208(1), pages 86-94, January.
    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. Fuellerer, Guenther & Doerner, Karl F. & Hartl, Richard F. & Iori, Manuel, 2010. "Metaheuristics for vehicle routing problems with three-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 201(3), pages 751-759, March.
    7. Bard, Jonathan F. & Jarrah, Ahmad I., 2013. "Integrating commercial and residential pickup and delivery networks: A case study," Omega, Elsevier, vol. 41(4), pages 706-720.
    8. Gendreau, Michel & Laporte, Gilbert & Semet, Frederic, 1998. "A tabu search heuristic for the undirected selective travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 539-545, April.
    9. 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.
    10. Coelho, Leandro C. & Laporte, Gilbert, 2014. "Improved solutions for inventory-routing problems through valid inequalities and input ordering," International Journal of Production Economics, Elsevier, vol. 155(C), pages 391-397.
    11. 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.
    12. Manuel Iori & Silvano Martello, 2010. "Rejoinder on: Routing problems with loading constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 41-42, July.
    13. 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.
    14. Michel Gendreau & Gilbert Laporte & Frédéric Semet, 1997. "The Covering Tour Problem," Operations Research, INFORMS, vol. 45(4), pages 568-576, August.
    15. Cai, Xiaoqiang & Chen, Jian & Xiao, Yongbo & Xu, Xiaolin & Yu, Gang, 2013. "Fresh-product supply chain management with logistics outsourcing," Omega, Elsevier, vol. 41(4), pages 752-765.
    16. Hariga, Moncer & Gumus, Mehmet & Daghfous, Abdelkader, 2014. "Storage constrained vendor managed inventory models with unequal shipment frequencies," Omega, Elsevier, vol. 48(C), pages 94-106.
    17. K Fagerholt & M Christiansen, 2000. "A combined ship scheduling and allocation problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(7), pages 834-842, July.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Lahyani, Rahma & Khemakhem, Mahdi & Semet, Frédéric, 2015. "Rich vehicle routing problems: From a taxonomy to a definition," European Journal of Operational Research, Elsevier, vol. 241(1), pages 1-14.
    6. Manuel Iori & Silvano Martello, 2010. "Routing problems with loading constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 4-27, July.
    7. 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.
    8. Ana Moura & Telmo Pinto & Cláudio Alves & José Valério de Carvalho, 2023. "A Matheuristic Approach to the Integration of Three-Dimensional Bin Packing Problem and Vehicle Routing Problem with Simultaneous Delivery and Pickup," Mathematics, MDPI, vol. 11(3), pages 1-16, January.
    9. 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.
    10. Bonet Filella, Guillem & Trivella, Alessio & Corman, Francesco, 2023. "Modeling soft unloading constraints in the multi-drop container loading problem," European Journal of Operational Research, Elsevier, vol. 308(1), pages 336-352.
    11. Bortfeldt, Andreas & Wäscher, Gerhard, 2013. "Constraints in container loading – A state-of-the-art review," European Journal of Operational Research, Elsevier, vol. 229(1), pages 1-20.
    12. Zhang, Zhenzhen & Wei, Lijun & Lim, Andrew, 2015. "An evolutionary local search for the capacitated vehicle routing problem minimizing fuel consumption under three-dimensional loading constraints," Transportation Research Part B: Methodological, Elsevier, vol. 82(C), pages 20-35.
    13. Xiang Song & Dylan Jones & Nasrin Asgari & Tim Pigden, 2020. "Multi-objective vehicle routing and loading with time window constraints: a real-life application," Annals of Operations Research, Springer, vol. 291(1), pages 799-825, August.
    14. Henriette Koch & Andreas Bortfeldt & Gerhard Wäscher, 2018. "A hybrid algorithm for the vehicle routing problem with backhauls, time windows and three-dimensional loading constraints," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(4), pages 1029-1075, October.
    15. Emmanouil E. Zachariadis & Christos D. Tarantilis & Chris T. Kiranoudis, 2017. "Vehicle routing strategies for pick-up and delivery service under two dimensional loading constraints," Operational Research, Springer, vol. 17(1), pages 115-143, April.
    16. 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.
    17. Adejuyigbe O. Fajemisin & Steven D. Prestwich & Laura Climent, 2023. "Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(1), pages 139-164, April.
    18. Emmanouil E. Zachariadis & Christos D. Tarantilis & Chris T. Kiranoudis, 2012. "The Pallet-Packing Vehicle Routing Problem," Transportation Science, INFORMS, vol. 46(3), pages 341-358, August.
    19. Camélia Dadouchi & Bruno Agard, 2021. "Recommender systems as an agility enabler in supply chain management," Journal of Intelligent Manufacturing, Springer, vol. 32(5), pages 1229-1248, June.
    20. Archetti, Claudia & Christiansen, Marielle & Grazia Speranza, M., 2018. "Inventory routing with pickups and deliveries," European Journal of Operational Research, Elsevier, vol. 268(1), pages 314-324.

    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:51:y:2015:i:c:p:1-10. 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.