A metaheuristic based on tabu search for solving a technician routing and scheduling problem

2021 ◽  
Vol 125 ◽  
pp. 105079
Author(s):  
Ines Mathlouthi ◽  
Michel Gendreau ◽  
Jean-Yves Potvin
Keyword(s):  
Tabu Search ◽  
Scheduling Problem ◽  
Routing And Scheduling

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

2020 ◽  
Vol 11 (1) ◽  
pp. 23-35
Author(s):  
Sana Frifita ◽  
Ines Mathlouthi ◽  
Abdelaziz Dammak
Keyword(s):  
Tabu Search ◽  
Variable Neighborhood Search ◽  
Diversity Management ◽  
Neighborhood Search ◽  
Scheduling Problem ◽  
Adaptive Memory ◽  
Weighted Distance ◽  
Routing And Scheduling ◽  
Electronic Transactions ◽  
Management Method

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.

Fleet management models and algorithms for an oil-tanker routing and scheduling problem

1999 ◽  
Vol 31 (5) ◽  
pp. 395-406 ◽  
Author(s):  
HANIF D. SHERALI ◽  
SALEM MOHAMMED AL-YAKOOB ◽  
MERZA M. HASSAN
Keyword(s):  
Fleet Management ◽  
Scheduling Problem ◽  
Routing And Scheduling ◽  
Management Models ◽  
Oil Tanker
Sign in / Sign up

Export Citation Format

Share Document