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; Raidl, Günther R.

by Bong-Min Kim, Christian Kloimüllner, Günther R. Raidl

Reference:

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

Bibtex Entry:

@inproceedings{kim-17,
author={Kim, Bong-Min and Kloim{\"u}llner, Christian and Raidl, G{\"u}nther R.},
editor={Hu, Bin and L{\'o}pez-Ib{\'a}{\~{n}}ez, Manuel},
title={Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control},
bookTitle={Evolutionary Computation in Combinatorial Optimization. {EvoCOP}~2017},
year={2017},
publisher={Springer},
volume={10197},
pages={91--107},
series={LNCS},
url={https://www.ac.tuwien.ac.at/files/pub/kim-17.pdf},
keywords={DRPSC,LNS,VND}
}