{"id":"https://openalex.org/W46238588","doi":"https://doi.org/10.1007/978-3-642-53878-0_10","title":"Evolutionary Algorithm with Geographic Heuristics for Urban Public Transportation","display_name":"Evolutionary Algorithm with Geographic Heuristics for Urban Public Transportation","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W46238588","doi":"https://doi.org/10.1007/978-3-642-53878-0_10","mag":"46238588"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-53878-0_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-53878-0_10","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5045376424","display_name":"Jolanta Koszelew","orcid":"https://orcid.org/0000-0003-1315-8926"},"institutions":[{"id":"https://openalex.org/I1323121030","display_name":"Bialystok University of Technology","ror":"https://ror.org/02bzfsy61","country_code":"PL","type":"education","lineage":["https://openalex.org/I1323121030"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Jolanta Koszelew","raw_affiliation_strings":["Faculty of Computer Science, Bialystok University of Technology, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Bialystok University of Technology, Poland","institution_ids":["https://openalex.org/I1323121030"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012639529","display_name":"K Ostrowski","orcid":"https://orcid.org/0000-0002-7120-396X"},"institutions":[{"id":"https://openalex.org/I1323121030","display_name":"Bialystok University of Technology","ror":"https://ror.org/02bzfsy61","country_code":"PL","type":"education","lineage":["https://openalex.org/I1323121030"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Krzysztof Ostrowski","raw_affiliation_strings":["Faculty of Computer Science, Bialystok University of Technology, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Bialystok University of Technology, Poland","institution_ids":["https://openalex.org/I1323121030"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1323121030"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3512,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.57683616,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"191","last_page":"207"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.996999979019165,"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"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.996999979019165,"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/T12725","display_name":"transportation and logistics systems","score":0.9952999949455261,"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/T11106","display_name":"Data Management and Algorithms","score":0.9833999872207642,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.9019595384597778},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7087780237197876},{"id":"https://openalex.org/keywords/public-transport","display_name":"Public transport","score":0.6999512910842896},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6695771217346191},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5601769685745239},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5417107343673706},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48137834668159485},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.4730616807937622},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4363086521625519},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.34525853395462036},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23985707759857178},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.18929588794708252},{"id":"https://openalex.org/keywords/transport-engineering","display_name":"Transport engineering","score":0.16556304693222046},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1237286925315857},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09822598099708557}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.9019595384597778},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7087780237197876},{"id":"https://openalex.org/C539828613","wikidata":"https://www.wikidata.org/wiki/Q178512","display_name":"Public transport","level":2,"score":0.6999512910842896},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6695771217346191},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5601769685745239},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5417107343673706},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48137834668159485},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.4730616807937622},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4363086521625519},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.34525853395462036},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23985707759857178},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.18929588794708252},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.16556304693222046},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1237286925315857},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09822598099708557},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-53878-0_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-53878-0_10","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8199999928474426,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W111981999","https://openalex.org/W119169328","https://openalex.org/W172918197","https://openalex.org/W764808283","https://openalex.org/W1530547402","https://openalex.org/W1540356715","https://openalex.org/W1543301019","https://openalex.org/W1574508260","https://openalex.org/W1601277319","https://openalex.org/W1665992737","https://openalex.org/W1964915778","https://openalex.org/W1984407615","https://openalex.org/W1986652726","https://openalex.org/W2010327686","https://openalex.org/W2038472377","https://openalex.org/W2089338760","https://openalex.org/W2104872182","https://openalex.org/W2124761449","https://openalex.org/W2135926883","https://openalex.org/W2144050074","https://openalex.org/W2166236009","https://openalex.org/W2169542477","https://openalex.org/W2227557434"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W2164188042","https://openalex.org/W4306878646","https://openalex.org/W2054495636","https://openalex.org/W2031913815"],"abstract_inverted_index":null,"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}