IDEAS home Printed from https://ideas.repec.org/a/ids/injleg/v2y2009i1p40-50.html
   My bibliography  Save this article

Heuristic to solve bi-objective allocation problem in distribution logistics

Author

Listed:
  • R.A. Malairajan
  • K. Ganesh
  • S.C. Lenny Koh

Abstract

Generalised assignment problem (GAP) is a well-known non-deterministic polynomial (NP) hard combinatorial optimisation problem to find the minimum cost during assignment of jobs to agents so that each job is assigned exactly once and agents are not overloaded. In this research, we look at the GAP from a bi-objective point of view to accommodate some real world situations. The application of BGAP for a typical practical supply chain problem of allocating a set of retailers to multiple distributors possessing different capacities with two specific performance objectives such as travel distance and travel time is considered. We propose a simulated annealing for an intensive search to find the Pareto optimal solutions to solve BGAP in a shorter period of time. Extensive computational experiments are carried out to evaluate the performance of the proposed method. Trials on benchmark data-sets and on a large number of test-problems have yielded encouraging results.

Suggested Citation

  • R.A. Malairajan & K. Ganesh & S.C. Lenny Koh, 2009. "Heuristic to solve bi-objective allocation problem in distribution logistics," International Journal of Logistics Economics and Globalisation, Inderscience Enterprises Ltd, vol. 2(1), pages 40-50.
    • Handle: RePEc:ids:injleg:v:2:y:2009:i:1:p:40-50
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=26413
    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:injleg:v:2:y:2009:i:1:p:40-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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=64 .

    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.