Bibliography

BSL97

Julien Bramel and David Simchi-Levi. Solving the vrp using a column generation approach. In The Logic of Logistics, pages 125–141. Springer, 1997.

CW64

Geoff Clarke and John W Wright. Scheduling of vehicles from a central depot to a number of delivery points. Operations research, 12(4):568–581, 1964.

DellAmicoRS06

Mauro Dell’Amico, Giovanni Righini, and Matteo Salani. A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection. Transportation science, 40(2):235–247, 2006.

DOzcanB12

John H Drake, Ender Özcan, and Edmund K Burke. An improved choice function heuristic selection for cross domain heuristic search. In International Conference on Parallel Problem Solving from Nature, 307–316. Springer, 2012.

FGonccalvesP17

Alexandre Silvestre Ferreira, Richard Aderbal Gonçalves, and Aurora Pozo. A multi-armed bandit selection strategy for hyper-heuristics. In 2017 IEEE Congress on Evolutionary Computation (CEC), 525–532. IEEE, 2017.

FRV+18

J Forrest, T Ralphs, S Vigerske, B Kristjansson, M Lubin, H Santos, M Saltzman, and others. Coin-or/cbc: version 2.9. 9. DOI: https://doi. org/10.5281/zenodo, 2018.

HSSC08

Aric Hagberg, Pieter Swart, and Daniel S Chult. Exploring network structure, dynamics, and function using networkx. Technical Report, Los Alamos National Lab.(LANL), Los Alamos, NM (United States), 2008.

Oli06

Travis Oliphant. NumPy: a guide to NumPy. USA: Trelgol Publishing, 2006. [Online; accessed 18/05/2020]. URL: http://www.numpy.org/.

PF

Laurent Perron and Vincent Furnon. OR-Tools. URL: https://developers.google.com/optimization/.

SZS15

Nasser R Sabar, Xiuzhen Jenny Zhang, and Andy Song. A math-hyper-heuristic approach for large-scale vehicle routing problems with time windows. In 2015 IEEE Congress on Evolutionary Computation (CEC), 830–837. IEEE, 2015.

SPR18

Alberto Santini, Christian EM Plum, and Stefan Ropke. A branch-and-price approach to the feeder network design problem. European Journal of Operational Research, 264(2):607–622, 2018.

TRothenbacherGI17

Christian Tilk, Ann-Kathrin Rothenbächer, Timo Gschwind, and Stefan Irnich. Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster. European Journal of Operational Research, 261(2):530–539, 2017.

TS19

David Torres Sanchez. cspy : A Python package with a collection of algorithms for the (Resource) Constrained Shortest Path problem. 2019. URL: https://github.com/torressa/cspy.