{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:28:11Z","timestamp":1758274091402,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,6,23]],"date-time":"2021-06-23T00:00:00Z","timestamp":1624406400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,23]],"date-time":"2021-06-23T00:00:00Z","timestamp":1624406400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s10732-021-09481-1","type":"journal-article","created":{"date-parts":[[2021,6,23]],"date-time":"2021-06-23T21:02:26Z","timestamp":1624482146000},"page":"887-922","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An adaptive large neighbourhood search algorithm for diameter bounded network design problems"],"prefix":"10.1007","volume":"27","author":[{"given":"Michele","family":"Garraffa","sequence":"first","affiliation":[]},{"given":"Deepak","family":"Mehta","sequence":"additional","affiliation":[]},{"given":"Barry","family":"O\u2019Sullivan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5190-9319","authenticated-orcid":false,"given":"Cemalettin","family":"Ozturk","sequence":"additional","affiliation":[]},{"given":"Luis","family":"Quesada","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,23]]},"reference":[{"key":"9481_CR1","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.cor.2013.08.016","volume":"41","author":"N Azi","year":"2014","unstructured":"Azi, N., Gendreau, M., Potvin, J.: An adaptive large neighborhood search for a vehicle routing problem with multiple routes. Computers & OR 41, 167\u2013173 (2014)","journal-title":"Computers & OR"},{"key":"9481_CR2","doi-asserted-by":"crossref","unstructured":"Bart\u00e1k, R., Zhou, N., Dovier, A.: Multiple-origin-multiple-destination path finding with minimal arc usage: Complexity and models. In: 2016 IEEE 28th International Conference on Tools with Artificial Intelligence (2016)","DOI":"10.1109\/ICTAI.2016.0024"},{"issue":"4","key":"9481_CR3","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.cor.2004.08.001","volume":"33","author":"R Bent","year":"2006","unstructured":"Bent, R., Van Hentenryck, P.: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Comput. Oper. Res. 33(4), 875\u2013893 (2006). https:\/\/doi.org\/10.1016\/j.cor.2004.08.001","journal-title":"Comput. Oper. Res."},{"issue":"1\u20134","key":"9481_CR4","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/B:ANOR.0000032577.81139.84","volume":"130","author":"A Chabrier","year":"2004","unstructured":"Chabrier, A., Danna, E., Le Pape, C., Perron, L.: Solving a network design problem. Annals OR 130(1\u20134), 217\u2013239 (2004)","journal-title":"Annals OR"},{"key":"9481_CR5","unstructured":"Chimani, M., Spoerhase, J.: Network design problems with bounded distances via shallow-light steiner trees. CoRR arXiv:1409.6551 (2014)"},{"key":"9481_CR6","unstructured":"CSPLib: A problem library for constraints. http:\/\/www.csplib.org (1999)"},{"key":"9481_CR7","unstructured":"De Backer, B., Furnon, V.: Meta-heuristics in constraint programming experiments with tabu search on the vehicle routing problem. In: 2nd International Conference on Metaheuristics (1997)"},{"key":"9481_CR8","doi-asserted-by":"publisher","unstructured":"de Camargo, R., de Miranda, G., L\u00f8kketangen, A.: A new formulation and an exact approach for the many-to-many hub location-routing problem. Applied Mathematical Modelling 37(12\u201313), 7465\u20137480 (2013) https:\/\/doi.org\/10.1016\/j.apm.2013.02.035. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0307904X1300142X","DOI":"10.1016\/j.apm.2013.02.035"},{"issue":"1","key":"9481_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E Dijkstra","year":"1959","unstructured":"Dijkstra, E.: A Note on Two Problems in Connection with Graphs. Numerische Mathematik 1(1), 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"9481_CR10","unstructured":"Discus: Deliverable 7.2, Preliminary quantitative results for flat optical network. Tech. rep., The DISCUS Project (FP7 Grant 318137) (2014)"},{"key":"9481_CR11","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Khanna, S.: Designing networks with bounded pairwise distance. In: Proc. 21st Ann. ACM Symposium on Theory of Computing (STOC\u201999), pp. 750\u2013759 (1999)","DOI":"10.1145\/301250.301447"},{"key":"9481_CR12","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/11564751_18","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"G Dooms","year":"2005","unstructured":"Dooms, G., Deville, Y., Dupont, P.: Cp(graph): Introducing a graph computation domain in constraint programming. In: van Beek, P. (ed.) Principles and Practice of Constraint Programming - CP 2005, pp. 211\u2013225. Springer, Berlin Heidelberg, Berlin, Heidelberg (2005)"},{"issue":"4","key":"9481_CR13","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s11235-010-9381-4","volume":"49","author":"J Elias","year":"2012","unstructured":"Elias, J., Martignon, F., Carello, G.: Very large-scale neighborhood search algorithms for the design of service overlay networks. Telecommunication Systems 49(4), 391\u2013408 (2012). https:\/\/doi.org\/10.1007\/s11235-010-9381-4","journal-title":"Telecommunication Systems"},{"key":"9481_CR14","doi-asserted-by":"publisher","unstructured":"Gelareh, S., Maculan, N., Mahey, P., Monemi, R.: Hub-and-spoke network design and fleet deployment for string planning of liner shipping. Applied Mathematical Modelling 37(5), 3307\u20133321 (2013) https:\/\/doi.org\/10.1016\/j.apm.2012.07.017. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0307904X12004295","DOI":"10.1016\/j.apm.2012.07.017"},{"issue":"4","key":"9481_CR15","first-page":"5","volume":"39","author":"C Gomes","year":"2009","unstructured":"Gomes, C.: Computational sustainability: Computational methods for a sustainableenvironment, economy, and society. The Bridge 39(4), 5\u201313 (2009)","journal-title":"The Bridge"},{"issue":"2","key":"9481_CR16","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.cor.2006.03.022","volume":"35","author":"L Gouveia","year":"2008","unstructured":"Gouveia, L., Paias, A., Sharma, D.: Modeling and solving the rooted distance-constrained minimum spanning tree problem. Computers & OR 35(2), 600\u2013613 (2008). https:\/\/doi.org\/10.1016\/j.cor.2006.03.022","journal-title":"Computers & OR"},{"issue":"1\u20132","key":"9481_CR17","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10107-009-0297-2","volume":"128","author":"L Gouveia","year":"2011","unstructured":"Gouveia, L., Simonetti, L., Uchoa, E.: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as steiner tree problems over layered graphs. Math. Program. 128(1\u20132), 123\u2013148 (2011). https:\/\/doi.org\/10.1007\/s10107-009-0297-2","journal-title":"Math. Program."},{"issue":"4","key":"9481_CR18","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s002910050098","volume":"21","author":"J Hurink","year":"1999","unstructured":"Hurink, J.: An exponential neighborhood for a one-machine batching problem. OR Spectrum 21(4), 461\u2013476 (1999). https:\/\/doi.org\/10.1007\/s002910050098","journal-title":"OR Spectrum"},{"key":"9481_CR19","doi-asserted-by":"publisher","unstructured":"Kokangul, A., Ari, A.: Optimization of passive optical network planning. Applied Mathematical Modelling 35(7), 3345\u20133354 (2011) https:\/\/doi.org\/10.1016\/j.apm.2011.01.017. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0307904X11000308","DOI":"10.1016\/j.apm.2011.01.017"},{"key":"9481_CR20","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-29667-3_11","volume-title":"Communication Technologies for Vehicles","author":"D Kowalski","year":"2012","unstructured":"Kowalski, D., Nutov, Z., Segal, M.: Scheduling of vehicles in transportation networks. In: Vinel, A., Mehmood, R., Berbineau, M., Garcia, C., Huang, C.M., Chilamkurti, N. (eds.) Communication Technologies for Vehicles, pp. 124\u2013136. Springer, Berlin Heidelberg (2012)"},{"issue":"2","key":"9481_CR21","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1002\/net.21483","volume":"61","author":"R Mahjoub","year":"2011","unstructured":"Mahjoub, R., Simonetti, L., Uchoa, E.: Hop-level flow formulation for the survivable network design with hop constraints problem. Networks 61(2), 171\u2013179 (2011)","journal-title":"Networks"},{"key":"9481_CR22","doi-asserted-by":"crossref","unstructured":"Malitsky, Y., Mehta, D., O\u2019Sullivan, B., Simonis, H.: Tuning parameters of large neighborhood search for the machine reassignment problem. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp. 176\u2013192. Springer (2013)","DOI":"10.1007\/978-3-642-38171-3_12"},{"key":"9481_CR23","unstructured":"Medhi, D.: Network Routing: Algorithms, Protocols, and Architectures. Morgan Kaufmann, (2010)"},{"key":"9481_CR24","doi-asserted-by":"publisher","unstructured":"Mehta, D., O\u2019Sullivan, B., Ozturk, C., Quesada, L.: An adaptive large neighbourhood search for designing transparent optical core network. In: Telecommunications (ConTEL), 2015 13th International Conference on, pp. 1\u20138 (2015). https:\/\/doi.org\/10.1109\/ConTEL.2015.7231187","DOI":"10.1109\/ConTEL.2015.7231187"},{"key":"9481_CR25","doi-asserted-by":"publisher","unstructured":"Mehta, D., O\u2019Sullivan, B., Ozturk, C., Quesada, L., Simonis, H.: Designing an optical island in the core network: From routing to spectrum allocation. In: 2014 IEEE 26th International Conference on Tools with Artificial Intelligence, pp. 560\u2013567 (2014). https:\/\/doi.org\/10.1109\/ICTAI.2014.90","DOI":"10.1109\/ICTAI.2014.90"},{"key":"9481_CR26","doi-asserted-by":"crossref","unstructured":"Meyerson, A.: Online algorithms for network design. In: IN PROCEEDINGS OF THE 16TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, pp. 275\u2013280. ACM Press (2003)","DOI":"10.1145\/1007912.1007958"},{"key":"9481_CR27","doi-asserted-by":"publisher","unstructured":"Miranda, G., Luna, H., de Camargo, R., Pinto, L.: Tree network design avoiding congestion. Applied Mathematical Modelling 35(9), 4175\u20134188 (2011) https:\/\/doi.org\/10.1016\/j.apm.2011.02.046. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0307904X1100117X","DOI":"10.1016\/j.apm.2011.02.046"},{"key":"9481_CR28","unstructured":"Muller, L., Spoorendonk, S.: A hybrid adaptive large neighborhood search algorithm applied to a lot-sizing problem. DTU Management 2010. DTU Management (2010)"},{"issue":"1\u20132","key":"9481_CR29","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0167-9260(97)00009-6","volume":"22","author":"J Oh","year":"1997","unstructured":"Oh, J., Pyo, I., Pedram, M.: Constructing minimal spanning\/steiner trees with bounded path length. Integration 22(1\u20132), 137\u2013163 (1997)","journal-title":"Integration"},{"key":"9481_CR30","unstructured":"van Omme, N., Perron, L., Furnon, V.: or-tools user\u2019s manual. Tech. rep., Google (2014)"},{"key":"9481_CR31","unstructured":"Payne, D.: FTTP deployment options and economic challenges. In: Proceedings of the 36th European Conference and Exhibition on Optical Communication (ECOC 2009) (2009)"},{"key":"9481_CR32","doi-asserted-by":"crossref","unstructured":"Pisinger, D., Ropke, S.: Large neighborhood search. In: Handbook of metaheuristics, pp. 399\u2013419. Springer US (2010)","DOI":"10.1007\/978-1-4419-1665-5_13"},{"key":"9481_CR33","unstructured":"Prud\u2019homme, C., Fages, J., Lorca, X.: Choco3 Documentation. TASC, INRIA Rennes, LINA CNRS UMR 6241, COSLING S.A.S. (2014). http:\/\/www.choco-solver.org"},{"key":"9481_CR34","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-1-4419-1644-0_3","volume-title":"Hybrid Optimization: The Ten Years of CPAIOR","author":"JC R\u00e9gin","year":"2011","unstructured":"R\u00e9gin, J.C.: Global constraints: A survey. In: van Hentenryck, P., Milano, M. (eds.) Hybrid Optimization: The Ten Years of CPAIOR, pp. 63\u2013134. Springer, New York, New York, NY (2011)"},{"issue":"2","key":"9481_CR35","doi-asserted-by":"publisher","first-page":"S24","DOI":"10.1109\/MCOM.2014.6736741","volume":"52","author":"M Ruffini","year":"2014","unstructured":"Ruffini, M., Wosinska, L., Achouche, M., Chen, J., Doran, N., Farjady, F., Montalvo, J., Ossieur, P., O\u2019Sullivan, B., Parsons, N., Pfeiffer, T., Qiu, X., Raack, C., Rohde, H., Schiano, M., Townsend, P., Wessaly, R., Yin, X., Payne, D.: Discus: an end-to-end solution for ubiquitous broadband optical access. Communications Magazine, IEEE 52(2), S24\u2013S32 (2014). https:\/\/doi.org\/10.1109\/MCOM.2014.6736741","journal-title":"Communications Magazine, IEEE"},{"key":"9481_CR36","doi-asserted-by":"crossref","unstructured":"Ruthmair, M., Raidl, G.: A kruskal-based heuristic for the rooted delay-constrained minimum spanning tree problem. In: Computer Aided Systems Theory-EUROCAST 2009, pp. 713\u2013720. Springer (2009)","DOI":"10.1007\/978-3-642-04772-5_92"},{"key":"9481_CR37","unstructured":"Ziegelmann, M.: Constrained Shortest Paths and Related Problems - Constrained Network Optimization. VDM Verlag, Saarbr\u00fccken, Germany, Germany (2007)"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-021-09481-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-021-09481-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-021-09481-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T08:10:43Z","timestamp":1627719043000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-021-09481-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,23]]},"references-count":37,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["9481"],"URL":"https:\/\/doi.org\/10.1007\/s10732-021-09481-1","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2021,6,23]]},"assertion":[{"value":"31 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}