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

A tabu search algorithm for a capacitated clustering problem

Author

Listed:
  • Sudha Khambhampati
  • Prasad Calyam
  • Xinhui Zhang

Abstract

This paper investigates a clustering problem in a production and routing environment where a centralised facility uses a fleet of vehicles to serve a set of customers. A multi-period capacitated clustering problem is solved to partition customer into clusters with constraints that the accumulated customer demand in every period of the planning horizon is satisfied. The resulting mathematical model is hard to solve exactly and efficient heuristics are thus developed in this paper. The heuristics are based on the tabu search but include two novel features in the design of neighbourhood search; the first one is the dynamic combination of customers with close proximity into supernodes to eliminate ineffective moves and the second one is an ejection chain approach to perform composite moves of variable length from a series of simple moves. Computational results showed that they were able to provide superior solutions, especially in certain cases of tight capacity constraints.

Suggested Citation

  • Sudha Khambhampati & Prasad Calyam & Xinhui Zhang, 2018. "A tabu search algorithm for a capacitated clustering problem," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 33(3), pages 387-412.
    • Handle: RePEc:ids:ijores:v:33:y:2018:i:3:p:387-412
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=95627
    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. Khalid Mekamcha & Mehdi Souier & Hakim Nadhir Bessenouci & Mohammed Bennekrouf, 2021. "Two metaheuristics approaches for solving the traveling salesman problem: an Algerian waste collection case," Operational Research, Springer, vol. 21(3), pages 1641-1661, September.

    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:33:y:2018:i:3:p:387-412. 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.