IDEAS home Printed from https://ideas.repec.org/a/ids/injams/v12y2020i1p50-67.html
   My bibliography  Save this article

Tabu search and constraint programming-based approach for a real scheduling and routing problem

Author

Listed:
  • Abdellah El Fallahi
  • El Yaakoubi Anass
  • Mohammad Cherkaoui

Abstract

Constraint programming method (CPM) has gained much attention in the last years since it proved a great efficiency to model and solve many combinatorial problems like scheduling, assignment and routing problems. In this paper, we first present a CPM model for a real scheduling and routing problem (SRP) faced by a company of water and electricity distribution. The problem aims to minimise the total distance travelled by the company's technicians to the clients' locations in order to carry out some services. To solve the studied SRP three CPM-based solution methods are proposed: an exact method (branch and prune), a local search meta-heuristic and a hybrid algorithm which combine tabu search and constraint programming method. The proposed solution methods have been tested using three sets of instances. The two first sets are generated randomly, they represent small and large scale instances, while the third one contain the real instances provided by the company with which we are working. The results obtained by the three methods show clearly the superiority of the hybrid algorithm over the two others methods.

Suggested Citation

  • Abdellah El Fallahi & El Yaakoubi Anass & Mohammad Cherkaoui, 2020. "Tabu search and constraint programming-based approach for a real scheduling and routing problem," International Journal of Applied Management Science, Inderscience Enterprises Ltd, vol. 12(1), pages 50-67.
    • Handle: RePEc:ids:injams:v:12:y:2020:i:1:p:50-67
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=105298
    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:injams:v:12:y:2020:i:1:p:50-67. 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=286 .

    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.