This paper introduces the overnight security service problem. The model obtained is a single-objective mixed integer programming problem. It is NP-hard in the strong sense, and exact approaches are not practicable when solving real-life instances. Thus, the model is solved heuristically, through a decomposition in two subproblem. The former is a capacitated clustering problem, the latter is a multiple travelling salesman problem with time windows. Both have a radius constraint which is unusual. The computational results prove the robustness of the approach used. Moreover, a detailed discussion of the results shows that the management objectives are satisfied, providing lower costs, a strong guarantee on the level of service and several different solutions.
Titolo: | A heuristic approach to the overnight security service problem |
Autori: | CORDONE, ROBERTO (Ultimo) |
Parole Chiave: | capacitated clustering; routing and scheduling; security service |
Settore Scientifico Disciplinare: | Settore INF/01 - Informatica |
Data di pubblicazione: | ago-2003 |
Rivista: | |
Tipologia: | Article (author) |
Digital Object Identifier (DOI): | 10.1016/S0305-0548(02)00070-9 |
Appare nelle tipologie: | 01 - Articolo su periodico |