{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:44:43Z","timestamp":1740141883524,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,1,31]],"date-time":"2018-01-31T00:00:00Z","timestamp":1517356800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004385","name":"Universiteit Gent","doi-asserted-by":"publisher","award":["01D36416","IOP 2016"],"award-info":[{"award-number":["01D36416","IOP 2016"]}],"id":[{"id":"10.13039\/501100004385","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s10288-018-0371-9","type":"journal-article","created":{"date-parts":[[2018,1,31]],"date-time":"2018-01-31T08:49:15Z","timestamp":1517388555000},"page":"411-439","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Generating constrained length personalized bicycle tours"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0895-0476","authenticated-orcid":false,"given":"P.","family":"Stroobant","sequence":"first","affiliation":[]},{"given":"P.","family":"Audenaert","sequence":"additional","affiliation":[]},{"given":"D.","family":"Colle","sequence":"additional","affiliation":[]},{"given":"M.","family":"Pickavet","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,31]]},"reference":[{"key":"371_CR1","doi-asserted-by":"publisher","unstructured":"Alivand M, Hochmair HH (2015) Choice set generation for modeling scenic route choice behavior with geographic information systems. Trans Res Rec J Trans Res Board 2495:101\u2013111. https:\/\/doi.org\/10.3141\/2495-11 , ISSN 0361-1981","DOI":"10.3141\/2495-11"},{"key":"371_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.compenvurbsys.2014.10.004","volume":"50","author":"M Alivand","year":"2015","unstructured":"Alivand M, Hochmair H, Srinivasan S (2015) Analyzing how travelers choose scenic routes using route choice models. Comput Environ Urban Syst 50:41\u201352. https:\/\/doi.org\/10.1016\/j.compenvurbsys.2014.10.004","journal-title":"Comput Environ Urban Syst"},{"key":"371_CR3","unstructured":"Bast H, Delling D, Goldberg A, M\u00fcller-Hannemann M, Thomas P, Peter S, Dorothea W, Werneck RF (2014) Route planning in transportation networks. Technical report, April 2015. http:\/\/arxiv.org\/abs\/1504.05140"},{"key":"371_CR4","unstructured":"Dees J, Geisberger R, Sanders P, Bader R (2010) Defining and computing alternative routes in road networks. CoRR, abs\/1002.4, February 2010. http:\/\/arxiv.org\/abs\/1002.4330"},{"key":"371_CR5","doi-asserted-by":"publisher","unstructured":"Demeyer S, Audenaert P, Pickavet M, Demeester P (2014) Dynamic and stochastic routing for multimodal transportation systems. IET Intell Transp Syst 8(2):112\u2013123. https:\/\/doi.org\/10.1049\/iet-its.2012.0065 , ISSN 1751-956X","DOI":"10.1049\/iet-its.2012.0065"},{"key":"371_CR6","unstructured":"Fu ZJ, Hochmair H (2009) Web based bicycle trip planning for broward county, Florida. GIS Center, 31"},{"key":"371_CR7","doi-asserted-by":"publisher","unstructured":"Geisberger R, Sanders P, Schultes D, Delling D (2008) Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: Experimental algorithms, vol 5038 LNCS, pp 319\u2013333. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-540-68552-4_24 , ISBN 3540685480","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"371_CR8","doi-asserted-by":"publisher","unstructured":"Gemsa A, Pajor T, Wagner D, Z\u00fcndorf T (2013) Efficient computation of jogging routes. In: Lecture Notes in Computer Science, vol 7933 LNCS, pp 272\u2013283. https:\/\/doi.org\/10.1007\/978-3-642-38527-8_25 , ISBN 9783642385261","DOI":"10.1007\/978-3-642-38527-8_25"},{"key":"371_CR9","unstructured":"Gutman R (2004) Reach-based routing: a new approach to shortest path algorithms optimized for road networks. In: Proceedings 6th workshop on algorithm engineering and experiments, pp 100\u2013111, Philadelphia, 2004. Society for Industrial and Applied Mathematics. http:\/\/www.siam.org\/meetings\/alenex04\/abstacts\/rgutman1.pdf , ISBN 0-89871-564-4"},{"key":"371_CR10","unstructured":"Hochmair H (2004) Decision support for bicycle route planning in urban environments. In: Proceedings of the 7th AGILE conference on geographic information science, pp 697\u2013706. Association of Geographic Information Laboratories in Europe"},{"key":"371_CR11","doi-asserted-by":"publisher","unstructured":"Hrncir J, Nemet M, Hrncir J, Song Q, Zilecky P, Nemet M, Jakob M (2014) Bicycle route planning with route choice preferences. In: Proceedings of the twenty-first European conference on artificial intelligence, pp 1149\u20131154. Elsevier and Springer. https:\/\/doi.org\/10.3233\/978-1-61499-419-0-1149 , ISBN 9781614994190","DOI":"10.3233\/978-1-61499-419-0-1149"},{"key":"371_CR12","doi-asserted-by":"publisher","unstructured":"Hrncir J, Zilecky P, Song Q, Jakob M (2015) Speedups for multi-criteria urban bicycle routing. OASIcs: OpenAccess Series in Informatics 48:28. https:\/\/doi.org\/10.4230\/OASIcs.ATMOS.2015.16 , ISSN 2190-6807. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2015\/5458\/","DOI":"10.4230\/OASIcs.ATMOS.2015.16"},{"key":"371_CR13","doi-asserted-by":"publisher","unstructured":"Karp RM (1978) A characterization of the minimum cycle mean in a digraph. Discrete Math 23(3):309\u2013311. https:\/\/doi.org\/10.1016\/0012-365X(78)90011-0 , ISSN 0012365X. http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X78900110","DOI":"10.1016\/0012-365X(78)90011-0"},{"key":"371_CR14","doi-asserted-by":"publisher","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems, 1st edn. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-540-24777-7 , ISBN 3642073115","DOI":"10.1007\/978-3-540-24777-7"},{"key":"371_CR15","doi-asserted-by":"publisher","unstructured":"Lawler EL, Wood DE (1966) Branch-and-bound methods: a survey. Oper Res 14(4):699\u2013719. https:\/\/doi.org\/10.1287\/opre.14.4.699 , ISSN 0030-364X","DOI":"10.1287\/opre.14.4.699"},{"key":"371_CR16","doi-asserted-by":"publisher","unstructured":"Loiola EM, de Abreu NMM, Boaventura-Netto PO, Hahn P, Querido T (2007) A survey for the quadratic assignment problem. Eur J Oper Res 176(2):657\u2013690. https:\/\/doi.org\/10.1016\/j.ejor.2005.09.032 , ISSN 03772217","DOI":"10.1016\/j.ejor.2005.09.032"},{"key":"371_CR17","unstructured":"Paraskevopoulos A, Zaroliagis C (2013) Improved alternative route planning. In: 13th Workshop on algorithmic approaches for transportation modelling, optimization, and systems, vol\u00a033, pp 108\u2013122. Optimization and Systems, 2013. http:\/\/hal.archives-ouvertes.fr\/hal-00871739\/"},{"key":"371_CR18","doi-asserted-by":"publisher","unstructured":"Pucher J, Buehler R, Merom D, Bauman A (2011) Walking and cycling in the United States, 2001\u20132009: evidence from the national household travel surveys. Am J Public Health 101(Suppl. 1):310\u2013317. https:\/\/doi.org\/10.2105\/AJPH.2010.300067 , ISSN 00900036","DOI":"10.2105\/AJPH.2010.300067"},{"key":"371_CR19","unstructured":"Rostami B, Chassein A, Hopf M, Frey D, Buchheim C, Malucelli F, Goerigk M (2016) The quadratic shortest path problem: complexity, approximability, and solution methods. Technical report, 2016. http:\/\/www.optimization-online.org\/DB_HTML\/2016\/02\/5341.html"},{"key":"371_CR20","doi-asserted-by":"publisher","unstructured":"Schieferdecker D, Kobitzsch M, Radermacher M (2013) Evolution and evaluation of the penalty method for alternative graphs. In: Proceedings of the 13th workshop on algorithmic approaches for transportation modeling, optimization, and systems (ATMOS\u201913), vol\u00a033, pp 94\u2013107. https:\/\/doi.org\/10.4230\/OASIcs.ATMOS.2013.94 . http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2013\/4247 , ISBN 9783939897583","DOI":"10.4230\/OASIcs.ATMOS.2013.94"},{"key":"371_CR21","doi-asserted-by":"publisher","unstructured":"Song Q, Zilecky P, Jakob M, Hrncir J (2014) Exploring pareto routes in multi-criteria urban bicycle routing. In: 17th international IEEE conference on intelligent transportation systems (ITSC), pp 1781. IEEE Intelligent Transportation Systems Society, 2014. https:\/\/doi.org\/10.1109\/ITSC.2014.6957951 , ISBN 2153-0009;21530009. http:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?arnumber=6957951","DOI":"10.1109\/ITSC.2014.6957951"},{"key":"371_CR22","doi-asserted-by":"crossref","unstructured":"Storandt S (2012) Route planning for bicycles\u2014exact constrained shortest paths made practical via contraction hierarchy. In: Proceedings of the twenty-second international conference on automated planning and scheduling, pp 234\u2013242, ISBN 9781577355625","DOI":"10.1609\/icaps.v22i1.13495"},{"key":"371_CR23","doi-asserted-by":"publisher","unstructured":"Su JG, Winters M, Nunes M, Brauer M (2010) Designing a route planner to facilitate and promote cycling in Metro Vancouver, Canada. Transp Res A Policy Pract 44(7):495\u2013505. https:\/\/doi.org\/10.1016\/j.tra.2010.03.015 , ISSN 09658564","DOI":"10.1016\/j.tra.2010.03.015"},{"key":"371_CR24","doi-asserted-by":"publisher","unstructured":"Turverey RJ, Cheng DD, Blair ON, Roth JT, Lamp GM (2010) Charlottesville bike route planner. In: 2010 IEEE systems and information engineering design symposium, SIEDS10, pp 68\u201372. https:\/\/doi.org\/10.1109\/SIEDS.2010.5469679","DOI":"10.1109\/SIEDS.2010.5469679"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-018-0371-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-018-0371-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-018-0371-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T19:32:18Z","timestamp":1693510338000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-018-0371-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,31]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["371"],"URL":"https:\/\/doi.org\/10.1007\/s10288-018-0371-9","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2018,1,31]]},"assertion":[{"value":"18 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}