A heuristic approach to the overnight security service problem

Authors:
R. Wolfler Calvo;R. Cordone
Affiliations:
Laboratoire d'Optimisation des systèmes Industriels (LOSI), Université, de Technologie de Troyes, 12, rue Marie Curie, BP 2060, 10010 Troyes, France;Dipartimento di Elettronica e Informazione, Politecnico di Milano, Piazza Leonardo da Vinci, 32-20133, Milano, Italy
Venue:
Computers and Operations Research
Year:
2003

Citing 3
Cited 3

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Heuristics for the multi-vehicle covering tour problem

Computers and Operations Research
A Heuristic for the Vehicle Routing Problem with Time Windows

Journal of Heuristics

Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2

Discrete Applied Mathematics
Probability Collectives: A multi-agent approach for solving combinatorial optimization problems

Applied Soft Computing
A 2-approximation algorithm for the metric 2-peripatetic salesman problem

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.