Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control

@inproceedings{Kim2017EfficientCO,
  title={Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control},
  author={Bong Min Kim and Christian Kloim{\"u}llner and G{\"u}nther R. Raidl},
  booktitle={EvoCOP},
  year={2017}
}
For many companies it is important to protect their physical and intellectual property in an efficient and economically viable manner. Thus, specialized security companies are delegated to guard private and public property. These companies have to control a typically large number of buildings, which is usually done by teams of security guards patrolling different sets of buildings. Each building has to be visited several times within given time windows and tours to patrol these buildings are… 
Algorithmic Approaches for Optimization Problems in Bike Sharing and Security Control
TLDR
This thesis deals with three combinatorial optimization problems where two of them arise in the context of public bike-sharing systems and the other one in the domain of security control, and models the balancing bike sharing rebalancing problem by considering monotonically increasing and decreasing segments of a user demand function.

References

SHOWING 1-10 OF 10 REFERENCES
Districting and Routing for Security Control
TLDR
An exact mixed integer linear programming model and a routing construction heuristic in a greedy like fashion with variable neighborhood descent for the routing part as well as a districtingConstruction heuristic and an iterative destroy & recreate algorithm for the districting part are proposed.
Metaheuristics for the Districting and Routing Problem for Security Control
TLDR
The Districting and Routing Problem for Security Control is introduced and modeled as a combinatorial optimization problem and an efficient method for checking the feasibility of a given route is presented.
Ship scheduling with soft time windows: An optimisation based approach
Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints
TLDR
This paper proposes local search algorithms for the vehicle routing problem with soft time-window constraints and shows that this problem can be efficiently solved by using dynamic programming, which is then incorporated in the algorithm.
A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
TLDR
A tabu search heuristic for the vehicle routing problem with soft time windows, where lateness at customer locations is allowed although a penalty is incurred and added to the objective value.
A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
TLDR
This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time windows and additional linear costs on the node service start times, which takes into account the linear node costs.
Variable Neighborhood Search for Multiprocessor Scheduling Problem with Communication Delays
The multiprocessor Scheduling Problem with Communication Delays (MSPCD) is defined as follows: tasks (or jobs) have to be executed on several processors; we have to find where and when each task will
Large Neighborhood Search
TLDR
An overview of very large scale neighborhood search methods is given and recent variants and extensions like variable depth search and adaptive large neighborhood search are discussed.