IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-24907-5_50.html
   My bibliography  Save this book chapter

A Genetic Algorithm for the Multi-compartment Vehicle Routing Problem with Stochastic Demands and Flexible Compartment Sizes

In: Operations Research Proceedings 2022

Author

Listed:
  • Shabanaz Chamurally

    (Institute of Business Administration and Information Systems, University of Hildesheim)

  • Julia Rieck

    (Institute of Business Administration and Information Systems, University of Hildesheim)

Abstract

The multi-compartment vehicle routing problem (MC-VRP) consists of designing a set of routes to perform the collection of different product types from customer locations with minimal costs. The MC-VRP arises in several practical situations, such as selective waste collection or different color of glass collection. Compartment sizes can be either set as fixed or as flexible. Often in practice, the collection quantity from customers is stochastic in nature, that is, the exact value is not available during route planning and is known only once the vehicles are at the customers’ locations. Our work introduces the MC-VRP with stochastic customer demands and with flexible compartment sizes. We propose a genetic algorithm (GA) to solve this problem and investigate the benefits of setting the compartment sizes to be flexible instead of fixed with pre-defined sizes. By using flexible compartment sizes, the GA shows an overall average improvement of 7.8%, compared to the state-of-the-art approach for fixed compartment sizes.

Suggested Citation

  • Shabanaz Chamurally & Julia Rieck, 2023. "A Genetic Algorithm for the Multi-compartment Vehicle Routing Problem with Stochastic Demands and Flexible Compartment Sizes," Lecture Notes in Operations Research, in: Oliver Grothe & Stefan Nickel & Steffen Rebennack & Oliver Stein (ed.), Operations Research Proceedings 2022, chapter 0, pages 419-426, Springer.
    • Handle: RePEc:spr:lnopch:978-3-031-24907-5_50
    DOI: 10.1007/978-3-031-24907-5_50
    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:lnopch:978-3-031-24907-5_50. 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.