The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
An Efficient VNS Algorithm to Solve the Multi-Attribute Technician Routing and Scheduling Problem
|
Author(s): 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)and Abdelaziz Dammak (Laboratory of Modeling and Optimization for Decisional, Industrial and Logistic Systems (MODILS), Sfax, Tunisia)
Copyright: 2020
Volume: 11
Issue: 1
Pages: 13
Source title:
International Journal of Applied Metaheuristic Computing (IJAMC)
Editor(s)-in-Chief: Peng-Yeng Yin (Ming Chuan University, Taiwan)
DOI: 10.4018/IJAMC.2020010102
Purchase
|
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.
Related Content
Abid Sabrina, Debbat Fatima.
© 2024.
20 pages.
|
Maryam AlJame, Aisha Alnoori, Mohammad G. Alfailakawi, Imtiaz Ahmad.
© 2023.
27 pages.
|
Trust Tawanda, Philimon Nyamugure, Elias Munapo, Santosh Kumar.
© 2023.
16 pages.
|
Sarab Almuhaideb, Najwa Altwaijry, Shahad AlMansour, Ashwaq AlMklafi, AlBandery Khalid AlMojel, Bushra AlQahtani, Moshail AlHarran.
© 2022.
22 pages.
|
Preeti Pragyan Mohanty, Subrat Kumar Nayak.
© 2022.
32 pages.
|
Sajad Ahmad Rather, P. Shanthi Bala.
© 2022.
39 pages.
|
Ines Sbai, Saoussen Krichen.
© 2022.
34 pages.
|
|
|