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

Kim, Bong-Min, Kloim{ü}llner, Christian, Günther Raidl
January 2017
PDF bib

Abstract

Full Citation:

Kim, Bong-Min, Kloimüllner, Christian, Raidl, Günther R.. 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 (Hu, Bin and L'opez-Ib'a~nez, Manuel), volume 10197 of LNCS, pages 91-107, 2017, Springer.

Type
Conference Paper
DRPSC LNS VND
Günther Raidl
Günther Raidl

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