IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v14y2012i3p255-270.html
   My bibliography  Save this article

Heuristic approach for balanced allocation problem in logistics: a comparative study

Author

Listed:
  • P. Sivakumar
  • K. Ganesh
  • S.P. Anbuudayasankar
  • M. Punniyamoorthy
  • S.C. Lenny Koh

Abstract

The core issue of this paper is efficient balancing of allocation of customers among multiple distribution centres. Allocation involves clustering of customers in such a way that the associated resources in terms of cost and time are minimal. Ready solution to this problem could be through non-deterministic polynomial (NP)-hard type model. But NP-hard type model is inherently time consuming in arriving at an optimal solution. This paper compares the meta-heuristic genetic algorithm with an improvised heuristic scheme developed from the 2-opt heuristic model. Possible solutions for efficient clustering of customers are then proposed.

Suggested Citation

  • P. Sivakumar & K. Ganesh & S.P. Anbuudayasankar & M. Punniyamoorthy & S.C. Lenny Koh, 2012. "Heuristic approach for balanced allocation problem in logistics: a comparative study," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 14(3), pages 255-270.
    • Handle: RePEc:ids:ijores:v:14:y:2012:i:3:p:255-270
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=47090
    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.

    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:ijores:v:14:y:2012:i:3:p:255-270. 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=170 .

    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.