IDEAS home Printed from https://ideas.repec.org/a/ids/ijmcdm/v3y2013i2-3p256-276.html
   My bibliography  Save this article

Grouping genetic algorithms for a bi-objective inventory routing problem

Author

Listed:
  • Abdeljawed Sadok
  • Jacques Teghem
  • Habib Chabcoub

Abstract

Inventory routing problems (IRPs) is one of the versions of vehicle routing problems (VRPs), which retains the attention of the researchers. The main idea is to coordinate the distribution plan with the inventory management in a same model. The problem studied is to determine the multi-tours of a homogeneous fleet of vehicles covering a set of sales-points and minimising the distribution and inventory cost per hour. Of course no stock-outs are acceptable at the sales-points. In this paper, we analyse this problem like a bi-objective inventory routing problem in which the transportation cost and the delivery cost are considered separately. Two approaches are proposed to approximate the Pareto front of this bi-objective problem. Both methods are an adaptation of the hybrid grouping genetic algorithm (HGGA) that we proposed for the single objective problem in which a grouping genetic algorithm is combined with a local search. Computational experiments are reported using eight instances for four groups: (25, 50,100 and 200 sales points).

Suggested Citation

  • Abdeljawed Sadok & Jacques Teghem & Habib Chabcoub, 2013. "Grouping genetic algorithms for a bi-objective inventory routing problem," International Journal of Multicriteria Decision Making, Inderscience Enterprises Ltd, vol. 3(2/3), pages 256-276.
    • Handle: RePEc:ids:ijmcdm:v:3:y:2013:i:2/3:p:256-276
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=53731
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zajac, Sandra & Huber, Sandra, 2021. "Objectives and methods in multi-objective routing problems: a survey and classification scheme," European Journal of Operational Research, Elsevier, vol. 290(1), pages 1-25.

    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:ids:ijmcdm:v:3:y:2013:i:2/3:p:256-276. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=350 .

    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.