|Start Page Number:||329|
|End Page Number:||345|
|Publication Date:||May 2017|
|Authors:||Geiger Martin Josef|
|Keywords:||transportation: road, combinatorial optimization, heuristics: local search|
The article describes our solution approach for the coach trip with shuttle service problem, a passenger transportation problem introduced in the context of the VeRoLog Solver Challenge 2015, an implementation competition of the EURO Working Group on Vehicle Routing and Logistics Optimization. Our algorithm applies concepts known from Variable Neighborhood Search and Iterated Local Search. On a lower level, we consider the fast construction and modification of tree data structures, as those structures may serve as appropriate representations of (feasible) alternatives. Experiments are carried out, and a comparison to other approaches is given. We also make the source code of our approach (i.e., its computer implementation) available with this article: https://doi.org/10.17632/662mtv6sd8.1.