Solving the Service Technician Routing and Scheduling Problem with Time Windows
| Autor: | Alan Crispin, Amy Khalfay, Keeley Crockett |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Service (business)
050210 logistics & transportation 021103 operations research Job shop scheduling Operations research Heuristic (computer science) Computer science 05 social sciences 0211 other engineering and technologies 02 engineering and technology Service provider 0502 economics and business Simulated annealing Customer satisfaction Routing (electronic design automation) Metaheuristic |
| Zdroj: | Advances in Intelligent Systems and Computing ISBN: 9783030295158 IntelliSys (1) |
| Popis: | In this paper, a greedy randomized heuristic is used to solve a service technician routing and scheduling problem with time windows. Time window constraints occur in many sectors such as telecommunications, maintenance, call centres, warehouses and healthcare, and is a way of service providers differentiating themselves to maintain customer satisfaction and ultimately retain market share. The greedy randomized heuristic is coupled with a simulated annealing with restart metaheuristic and tested on 36 problem instances. The greedy randomized heuristic is compared against a parallel adaptive large neighbourhood search heuristic, presenting new best known results in 18% of the datasets. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|