@phdthesis{c25702922ce54b8e993d7b770cec66c3,
title = "Models for operational optimisation in a horizontal logistic cooperation: gain sharing, incentives and multi-level objectives",
author = "Christof Defryn",
note = "data source: * GVRPθ3 instances (Battarra et al. 2014) * variant of Golden instances (Exp{\'o}sito-Izquierdo et al. 2016) * variant of Golden instances (Vidal et al. 2015) * TSPTW instance (Dumas et al. 1995) * own-generated instances * anonymised company data Battarra, M. , Erdogan, G. , Vigo, D. ,2014. Exact algorithms for the clustered vehicle routing problem. Oper. Res. 62 (1), 58–71 Exp{\'o}sito-Izquierdo, C. , Rossi, A. , Sevaux, M. ,2016. A two-level solution approach to solve the clustered capacitated vehicle routing problem. Comput. Ind. Eng. 91, 274–289 . Vidal, T. , Battarra, M. , Subramanian, A. , Erdogan, G. ,2015. Hybrid metaheuristics for the clustered vehicle routing problem. Comput. Oper. Res. 58, 87–99 Y. Dumas, J. Desrosiers, E. Gelinas, and M. M. Solomon. An optimal algorithm for the traveling salesman problem with time windows. Operations research, 43(2):367–371, 1995.",
year = "2017",
language = "English",
isbn = "978-90-89941-62-6",
school = "University of Antwerp",
}