{"id":"https://openalex.org/W2076594916","doi":"https://doi.org/10.1080/13658810903514180","title":"Have a nice trip: an algorithm for identifying excess routes under satisfaction constraints","display_name":"Have a nice trip: an algorithm for identifying excess routes under satisfaction constraints","publication_year":2010,"publication_date":"2010-10-06","ids":{"openalex":"https://openalex.org/W2076594916","doi":"https://doi.org/10.1080/13658810903514180","mag":"2076594916"},"language":"en","primary_location":{"id":"doi:10.1080/13658810903514180","is_oa":false,"landing_page_url":"https://doi.org/10.1080/13658810903514180","pdf_url":null,"source":{"id":"https://openalex.org/S4210181446","display_name":"International Journal of Geographical Information Systems","issn_l":"0269-3798","issn":["0269-3798","1362-3087"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Geographical Information Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014264930","display_name":"Hans Skov-Petersen","orcid":"https://orcid.org/0000-0003-3383-7221"},"institutions":[{"id":"https://openalex.org/I124600578","display_name":"Landscape Institute","ror":"https://ror.org/00gg9m594","country_code":"GB","type":"other","lineage":["https://openalex.org/I124600578"]},{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK","GB"],"is_corresponding":true,"raw_author_name":"H. Skov-Petersen","raw_affiliation_strings":["\n Forest & Landscape, Denmark, University of Copenhagen, Copenhagen, Denmark","Forest and Landscape Denmark, University of Copenhagen, Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"\n Forest & Landscape, Denmark, University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124600578"]},{"raw_affiliation_string":"Forest and Landscape Denmark, University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057902603","display_name":"Martin Zachariasen","orcid":"https://orcid.org/0000-0002-2329-3606"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]},{"id":"https://openalex.org/I4210088332","display_name":"University College Copenhagen","ror":"https://ror.org/004r9h172","country_code":"DK","type":"education","lineage":["https://openalex.org/I4210088332"]},{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"M. Zachariasen","raw_affiliation_strings":["\n Department of Computer Science, University of Copenhagen, Copenhagen, Denmark","Department of Computer Science, University of Copenhagen, Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"\n Department of Computer Science, University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696","https://openalex.org/I83467386","https://openalex.org/I4210088332"]},{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030929560","display_name":"Pimin Konstantin Kefaloukos","orcid":null},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]},{"id":"https://openalex.org/I4210088332","display_name":"University College Copenhagen","ror":"https://ror.org/004r9h172","country_code":"DK","type":"education","lineage":["https://openalex.org/I4210088332"]},{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"P.K. Kefaloukos","raw_affiliation_strings":["\n Department of Computer Science, University of Copenhagen, Copenhagen, Denmark","Department of Computer Science, University of Copenhagen, Copenhagen, Denmark"],"affiliations":[{"raw_affiliation_string":"\n Department of Computer Science, University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696","https://openalex.org/I83467386","https://openalex.org/I4210088332"]},{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5014264930"],"corresponding_institution_ids":["https://openalex.org/I124055696","https://openalex.org/I124600578"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.10759261,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"24","issue":"11","first_page":"1745","last_page":"1758"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12644","display_name":"Wildlife-Road Interactions and Conservation","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/2303","display_name":"Ecology"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12644","display_name":"Wildlife-Road Interactions and Conservation","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/2303","display_name":"Ecology"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9847000241279602,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10298","display_name":"Urban Transport and Accessibility","score":0.9839000105857849,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6476843953132629},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6191978454589844},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6101976037025452},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5752257108688354},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5238309502601624},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49682310223579407},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.47851479053497314},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.457964688539505},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45373764634132385},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.43996116518974304},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4307384192943573},{"id":"https://openalex.org/keywords/trips-architecture","display_name":"TRIPS architecture","score":0.42822641134262085},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.42399317026138306},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.22496917843818665},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2180688977241516},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.211506187915802},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1978553831577301},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.149492084980011},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13766667246818542}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6476843953132629},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6191978454589844},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6101976037025452},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5752257108688354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5238309502601624},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49682310223579407},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.47851479053497314},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.457964688539505},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45373764634132385},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.43996116518974304},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4307384192943573},{"id":"https://openalex.org/C157085824","wikidata":"https://www.wikidata.org/wiki/Q2384809","display_name":"TRIPS architecture","level":2,"score":0.42822641134262085},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.42399317026138306},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.22496917843818665},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2180688977241516},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.211506187915802},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1978553831577301},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.149492084980011},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13766667246818542},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/13658810903514180","is_oa":false,"landing_page_url":"https://doi.org/10.1080/13658810903514180","pdf_url":null,"source":{"id":"https://openalex.org/S4210181446","display_name":"International Journal of Geographical Information Systems","issn_l":"0269-3798","issn":["0269-3798","1362-3087"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Geographical Information Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/a7378f20-db5a-11df-825b-000ea68e967b","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/a7378f20-db5a-11df-825b-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Skov-Petersen , H , Zachariasen , M & Kefaloukos , P K B 2010 , ' Have a nice trip : an algorithm for identifying excess routes under satisfaction constraints ' , International Journal of Geographical Information Science , vol. 24 , no. 11 , pp. 1745-1758 . https://doi.org/10.1080/13658810903514180","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.6399999856948853}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1483123661","https://openalex.org/W1975346227","https://openalex.org/W1977534427","https://openalex.org/W2008618146","https://openalex.org/W2029341065","https://openalex.org/W2039677715","https://openalex.org/W2083342911","https://openalex.org/W2091202128","https://openalex.org/W2114772697","https://openalex.org/W2118382442","https://openalex.org/W2118724179","https://openalex.org/W2135580136","https://openalex.org/W2136052486","https://openalex.org/W2170173074","https://openalex.org/W2281218127","https://openalex.org/W2555883910","https://openalex.org/W2946046356","https://openalex.org/W3145128584"],"related_works":["https://openalex.org/W1524973174","https://openalex.org/W2569549435","https://openalex.org/W2091348864","https://openalex.org/W2784687883","https://openalex.org/W2354343466","https://openalex.org/W2997121997","https://openalex.org/W3014398131","https://openalex.org/W1540285992","https://openalex.org/W2784763367","https://openalex.org/W2294834135"],"abstract_inverted_index":{"Abstract":[0],"Analysis":[1],"of":[2,15,78,81,89,95,162,191,199],"potential":[3,96],"spatial":[4],"behavior":[5],"in":[6,43,108,140],"transport":[7],"infrastructures":[8],"is":[9],"usually":[10],"carried":[11],"out":[12],"by":[13],"means":[14],"a":[16,24,87,122,160,171],"digital":[17],"network.":[18],"A":[19,155],"basic":[20],"condition":[21],"for":[22,50,83,133],"such":[23,167,179],"network":[25,51,126],"analysis":[26,52,127,148],"has":[27],"traditionally":[28],"been":[29],"the":[30,64,69,76,79],"desire":[31],"to":[32,35,39,59,86,98,114,125,131,156,178],"find":[33],"solutions":[34,58,85,177],"optimization":[36,60,106],"problems":[37,92,103,107],"and":[38,68,152,158,197],"achieve":[40],"greater":[41],"efficiency":[42],"industry.":[44],"Geographic":[45],"information":[46],"system":[47],"(GIS)":[48],"tools":[49,82],"are":[53,94,137],"overwhelmingly":[54],"targeted":[55],"at":[56],"finding":[57,84],"problems,":[61],"which":[62],"include":[63],"shortest":[65],"path":[66],"problem":[67,77],"traveling":[70],"salesman":[71],"problem.":[72],"This":[73],"article":[74],"addresses":[75],"lack":[80,111],"class":[88],"constraint":[90],"satisfaction":[91,102,188],"that":[93,109,136,164,174],"interest":[97],"behavioral":[99],"geographers.":[100],"Constraint":[101],"differ":[104],"from":[105,154],"they":[110],"an":[112],"expression":[113],"be":[115,129],"maximized":[116],"or":[117,139],"minimized.":[118],"We":[119,169],"describe":[120],"how":[121],"constraint-based":[123],"approach":[124],"can":[128,165,175],"applied":[130],"search":[132],"'excess":[134],"routes'":[135],"longer":[138],"other":[141],"ways":[142],"exceed":[143],"single,":[144],"optimal":[145],"routes.":[146],"Our":[147],"considers":[149],"both":[150],"round-trips":[151],"travel":[153],"B":[157],"defines":[159],"set":[161],"constraints":[163],"characterize":[166],"paths.":[168],"present":[170],"labeling":[172],"algorithm":[173],"generate":[176],"excess":[180,184],"route":[181],"problems.":[182],"Keywords:":[183],"routesexcess":[185],"travelnetwork":[186],"analysisconstrained":[187],"Acknowledgment":[189],"Copyright":[190],"map":[192],"data":[193],"use:":[194],"National":[195],"Survey":[196],"Cadastre":[198],"Denmark":[200],"(G15-99).":[201]},"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-03-16T09:10:04.655348","created_date":"2025-10-10T00:00:00"}