Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
Abstract
We propose decremental state space relaxation strategies and initialization heuristics for the orienteering problem with time windows. The approach progressively tightens relaxations until feasibility is achieved, and leverages dynamic programming for exact optimization. Computational results demonstrate the effectiveness of the proposed strategies on benchmark instances.
BibTeX
@article{righini2009decremental,
title={Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming},
author={Righini, Giovanni and Salani, Matteo},
journal={Computers \& operations research},
volume={36},
number={4},
pages={1191--1203},
year={2009},
publisher={Pergamon}
}