References
- Aksen, D., & Shahmanzari, M. (2018). A periodic traveling politician problem with time-dependent rewards. In A. Fink, A. Fügenschuh, & M. J. Geiger (Eds.), Operations research proceedings 2016 (pp. 277–283). Springer.
- Balas, E. (1989). The prize collecting traveling salesman problem. Networks, 19(6), 621–636. https://doi.org/https://doi.org/10.1002/net.3230190602
- Bérubé, J. F., Gendreau, M., & Potvin, J. Y. (2009). A branch‐and‐cut algorithm for the undirected prize collecting traveling salesman problem. Networks, 54(1), 56–67. https://doi.org/https://doi.org/10.1002/net.20307
- Blum, C., Puchinger, J., Raidl, G. R., & Roli, A. (2011). Hybrid metaheuristics in combinatorial optimization: A survey. Applied Soft Computing, 11(6), 4135–4151. https://doi.org/https://doi.org/10.1016/j.asoc.2011.02.032
- Çarkoğlu, A., & Aksen, D. (2019). Partisan and apportionment bias in creating a predominant party system. Political Geography, 69, 43–53. https://doi.org/https://doi.org/10.1016/j.polgeo.2018.11.009
- Cordeau, J. F., Gendreau, M., & Laporte, G. (1997). A tabu search heuristic for periodic and multi‐depot vehicle routing problems. Networks, 30(2), 105–119. https://doi.org/https://doi.org/10.1002/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G
- Croes, G. A. (1958). A method for solving traveling-salesman problems. Operations Research, 6(6), 791–812. https://doi.org/https://doi.org/10.1287/opre.6.6.791
- Dell’Amico, M., Maffioli, F., & Sciomachen, A. (1998). A Lagrangian heuristic for the prize collecting travelling salesman problem. Annals of Operations Research, 81, 289–306. https://doi.org/https://doi.org/10.1023/A:1018961208614
- Dell’Amico, M., Maffioli, F., & Värbrand, P. (1995). On prize‐collecting tours and the asymmetric travelling salesman problem. International Transactions in Operational Research, 2(3), 297–308. https://doi.org/https://doi.org/10.1111/j.1475-3995.1995.tb00023.x
- Feillet, D., Dejax, P., & Gendreau, M. (2005). Traveling salesman problems with profits. Transportation Science, 39(2), 188–205. https://doi.org/https://doi.org/10.1287/trsc.1030.0079
- Fischetti, M., Salazar-González, J. J., & Toth, P. (2007). The generalised traveling salesman and orienteering problems. In G. Gutin & A. P. Punnen (Eds.), The traveling salesman problem and its variations (pp. 609–662). Springer.
- Fischetti, M., & Toth, P. (1988). An additive approach for the optimal solution of the prize-collecting travelling salesman problem. In Vehicle routing: Methods and studies. Studies in management science and systems (pp. 319–343). Elsevier.
- GUROBI Optimization. (2020). GUROBI Optimizer Quick Start Guide Version 9.1. Gurobi Optimization, LLC. Retrieved December 10, 2020, from https://www.gurobi.com/wp-content/plugins/hd_documentations/documentation/9.1/quickstart_windows.pdf
- Hansen, P., & Mladenović, N. (2003). Variable neighbourhood search. In F. W. Glover & G. A. Kochenberger (Eds.), Handbook of metaheuristics (pp. 145–184). Springer.
- Ke, L., Archetti, C., & Feng, Z. (2008). Ants can solve the team orienteering problem. Computers & Industrial Engineering, 54(3), 648–665. https://doi.org/https://doi.org/10.1016/j.cie.2007.10.001
- Lourenço, H. R., Martin, O. C., & Stützle, T. (2003). Iterated local search. In F. W. Glover & G. A. Kochenberger (Eds.), Handbook of metaheuristics (pp. 321–368). Springer.
- Millar, H. H., & Kiragu, M. (1997). A time-based formulation and upper bounding scheme for the selective travelling salesperson problem. Journal of the Operational Research Society, 48(5), 511–518. https://doi.org/https://doi.org/10.1057/palgrave.jors.2600398
- Reihaneh, M., & Ghoniem, A. (2018). A multi-start optimization-based heuristic for a food bank distribution problem. Journal of the Operational Research Society, 69(5), 691–706. https://doi.org/https://doi.org/10.1057/s41274-017-0220-9
- Salhi, S. (2017). Heuristic search: The emerging science of problem solving. Springer.
- Salhi, S., & Sari, M. (1997). A multi-level composite heuristic for the multi-depot vehicle fleet mix problem. European Journal of Operational Research, 103(1), 95–112. https://doi.org/https://doi.org/10.1016/S0377-2217(96)00253-6
- Shahmanzari, M. (2019). The roaming salesman problem and its application to election logistics. [Doctoral dissertation]. Koç University Graduate School of Business, Yükseköğretim Kurulu Ulusal Tez Merkezi. https://tez.yok.gov.tr/UlusalTezMerkezi/TezGoster?key=Eb5EkakJlp3olBdo_wNEGeAki02cDutrlUa5pi-1NVi8X-rjUM2GcvMcBSygdAPM
- Shahmanzari, M., Aksen, D., & Salhi, S. (2020). Formulation and a two-phase matheuristic for the roaming salesman problem: Application to election logistics. European Journal of Operational Research, 280(2), 656–670. https://doi.org/https://doi.org/10.1016/j.ejor.2019.07.035
- Sze, J. F., Salhi, S., & Wassan, N. (2016). A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem. Expert Systems with Applications, 65, 383–397. https://doi.org/https://doi.org/10.1016/j.eswa.2016.08.060
- Sze, J. F., Salhi, S., & Wassan, N. (2017). The cumulative capacitated vehicle routing problem with min-sum and min-max objectives: An effective hybridisation of adaptive variable neighbourhood search and large neighbourhood search. Transportation Research Part B: Methodological, 101, 162–184. https://doi.org/https://doi.org/10.1016/j.trb.2017.04.003
- Toth, P., & Vigo, D. (2003). The granular tabu search and its application to the vehicle routing problem. INFORMS Journal on Computing, 15(4), 333–348. https://doi.org/https://doi.org/10.1287/ijoc.15.4.333.24890
- Tricoire, F., Romauch, M., Doerner, K. F., & Hartl, R. F. (2010). Heuristics for the multi-period orienteering problem with multiple time windows. Computers & Operations Research, 37(2), 351–367. https://doi.org/https://doi.org/10.1016/j.cor.2009.05.012
- Vansteenwegen, P., Souffriau, W., & Van Oudheusden, D. (2011). The orienteering problem: A survey. European Journal of Operational Research, 209(1), 1–10. https://doi.org/https://doi.org/10.1016/j.ejor.2010.03.045