IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-42902-1_20.html
   My bibliography  Save this book chapter

A Multi-compartment Vehicle Routing Problem for Livestock Feed Distribution

In: Operations Research Proceedings 2015

Author

Listed:
  • Levent Kandiller

    (Yasar University)

  • Deniz Türsel Eliiyi

    (Yasar University)

  • Bahar Taşar

    (Yasar University)

Abstract

In the well-known Vehicle Routing Problem (VRP), customer demands from one or more depots are to be distributed via a fleet of vehicles. Various objectives of the problem are considered in literature, including minimization of the total distance/time traversed by the fleet during distribution, the total cost of vehicle usage, or minimizing the maximum tour length/time. In this study, we consider a multi-compartment VRP with incompatible products for the daily solution of a livestock feed distribution network, where each livestock farm requests one type of feed from a single depot, and the vehicles have several compartments. The objective is to minimize the total cost of distribution. Although VRP is a well-studied problem in literature, multi-compartment VRP is considered only by few authors, and our problem differs from the existing ones due to special operational constraints imposed by the situation on hand. We formulate a basic mathematical model for the problem and present possible extensions. We design a computational experiment for testing the effects of uncontrollable parameters over model performance on a commercial solver and report the results. The proposed model can easily be adapted to other distribution networks such as food and fuel/chemicals.

Suggested Citation

  • Levent Kandiller & Deniz Türsel Eliiyi & Bahar Taşar, 2017. "A Multi-compartment Vehicle Routing Problem for Livestock Feed Distribution," Operations Research Proceedings, in: Karl Franz Dörner & Ivana Ljubic & Georg Pflug & Gernot Tragler (ed.), Operations Research Proceedings 2015, pages 149-155, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-42902-1_20
    DOI: 10.1007/978-3-319-42902-1_20
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:oprchp:978-3-319-42902-1_20. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.