Go to:
Logótipo
Você está em: Start > Publications > View > Disruption Management of ASAE's Inspection Routes
Map of Premises
Principal
Publication

Disruption Management of ASAE's Inspection Routes

Title
Disruption Management of ASAE's Inspection Routes
Type
Article in International Conference Proceedings Book
Year
2022
Authors
Miguel Milheiro Ferreira
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Telmo Barros
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
João Pedro Machado
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Indexing
Other information
Authenticus ID: P-00W-9AR
Abstract (EN): The emergence of technologies capable of producing real-time data opened new horizons to planning and optimising vehicle routes. Dynamic vehicle routing problems (DVRPs) use real-time information to dynamically calculate the most optimised set of routes. The typical approach is to initially calculate the vehicle routes and dynamically revise them in real-time. This work uses the case study of ASAE, a Portuguese administrative authority specialising in food safety and economic surveillance. The dynamic properties of ASAE's operational environment are studied, and a solution is proposed to review and efficiently modify the precalculated plan. We propose a weighted utility function based on three aspects: the summed utility of the inspections, the similarity between solutions, and the arrival time. A Disruption Generator generates disruptions on the inspection routes: travel and inspection times, vehicle and inspection breakdowns, utility changes, and unexpected or emerging inspections. We compare the performance of four meta-heuristics: Hill-Climbing (HC), Simulated Annealing (SA), Tabu-Search (TS) and Large neighbourhood Search (LNS). The HC algorithm has the fastest convergence, while SA takes longer to solve the test instances. LNS was the method with higher solution quality, while HC provided solutions with lower utility.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 8
Documents
We could not find any documents associated to the publication.
Recommend this page Top
Copyright 1996-2025 © Faculdade de Medicina Dentária da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-08-13 at 09:03:32 | Privacy Policy | Personal Data Protection Policy | Whistleblowing | Electronic Yellow Book