IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v11y2020i1p23-35.html
   My bibliography  Save this article

An Efficient VNS Algorithm to Solve the Multi-Attribute Technician Routing and Scheduling Problem

Author

Listed:
  • Sana Frifita

    (Laboratory of Modeling and Optimization for Decisional, Industrial and Logistic Systems (MODILS), Sfax, Tunisia)

  • Ines Mathlouthi

    (Department of Computer Science and Operations Research, University of Montreal, Canada)

  • Abdelaziz Dammak

    (Laboratory of Modeling and Optimization for Decisional, Industrial and Logistic Systems (MODILS), Sfax, Tunisia)

Abstract

This article addresses a technician routing and scheduling problem inspired from an application for the repair of electronic transactions equipment. It consists of designing routes for staff to perform requests while considering certain constraints and resources. The objective is to minimize a linear combination of total weighted distance, overtime, and maximize the served requests. An efficient meta-heuristic algorithm based on variable neighborhood search with an adaptive memory and advanced diversity management method is proposed. Numerical results show that the meta-heuristic outperforms the best existing algorithm from the literature which is a Tabu Search.

Suggested Citation

  • Sana Frifita & Ines Mathlouthi & Abdelaziz Dammak, 2020. "An Efficient VNS Algorithm to Solve the Multi-Attribute Technician Routing and Scheduling Problem," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 11(1), pages 23-35, January.
    • Handle: RePEc:igg:jamc00:v:11:y:2020:i:1:p:23-35
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2020010102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jamc00:v:11:y:2020:i:1:p:23-35. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.