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

Abstract

Full Citation:

Bong-Min Kim, Christian Kloimüllner, Günther R. Raidl. Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control. Evolutionary Computation in Combinatorial Optimization. EvoCOP~2017 (Bin Hu, Manuel López-Ibáñez, eds.), volume 10197 of LNCS, pages 91–107, 2017, Springer.

Günther Raidl

Günther Raidl is a Professor at the Algorithms and Complexity Group.