{"id":"https://openalex.org/W3202862631","doi":"https://doi.org/10.4230/oasics.atmos.2021.17","title":"Efficient Algorithms for the Multi-Period Line Planning Problem in Public Transportation (Short Paper)","display_name":"Efficient Algorithms for the Multi-Period Line Planning Problem in Public Transportation (Short Paper)","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3202862631","doi":"https://doi.org/10.4230/oasics.atmos.2021.17","mag":"3202862631"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:14886","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.17","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.17","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047062567","display_name":"G\u00fcven\u00e7 \u015eahin","orcid":"https://orcid.org/0000-0002-8623-7257"},"institutions":[{"id":"https://openalex.org/I195893171","display_name":"Zuse Institute Berlin","ror":"https://ror.org/02eva5865","country_code":"DE","type":"facility","lineage":["https://openalex.org/I195893171"]},{"id":"https://openalex.org/I134235054","display_name":"Sabanc\u0131 \u00dcniversitesi","ror":"https://ror.org/049asqa32","country_code":"TR","type":"education","lineage":["https://openalex.org/I134235054"]}],"countries":["DE","TR"],"is_corresponding":true,"raw_author_name":"\u015eahin, G\u00fcven\u00e7","raw_affiliation_strings":["Industrial Engineering,Sabanci University, Istanbul, Turkey","Zuse Institut Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Industrial Engineering,Sabanci University, Istanbul, Turkey","institution_ids":["https://openalex.org/I134235054"]},{"raw_affiliation_string":"Zuse Institut Berlin, Germany","institution_ids":["https://openalex.org/I195893171"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076397560","display_name":"Amin Ahmadi Digehsara","orcid":"https://orcid.org/0000-0001-8973-1034"},"institutions":[{"id":"https://openalex.org/I134235054","display_name":"Sabanc\u0131 \u00dcniversitesi","ror":"https://ror.org/049asqa32","country_code":"TR","type":"education","lineage":["https://openalex.org/I134235054"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Ahmadi Digehsara, Amin","raw_affiliation_strings":["Industrial Engineering, Sabanci University, Istanbul, Turkey"],"affiliations":[{"raw_affiliation_string":"Industrial Engineering, Sabanci University, Istanbul, Turkey","institution_ids":["https://openalex.org/I134235054"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018583855","display_name":"Ralf Bornd\u00f6rfer","orcid":"https://orcid.org/0000-0001-7223-9174"},"institutions":[{"id":"https://openalex.org/I195893171","display_name":"Zuse Institute Berlin","ror":"https://ror.org/02eva5865","country_code":"DE","type":"facility","lineage":["https://openalex.org/I195893171"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Bornd\u00f6rfer, Ralf","raw_affiliation_strings":["Zuse Institut Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Zuse Institut Berlin, Germany","institution_ids":["https://openalex.org/I195893171"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047062567"],"corresponding_institution_ids":["https://openalex.org/I134235054","https://openalex.org/I195893171"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12112942,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"96","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9983000159263611,"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.9983000159263611,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9860000014305115,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/public-transport","display_name":"Public transport","score":0.6792752742767334},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6209821701049805},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6138401031494141},{"id":"https://openalex.org/keywords/transportation-planning","display_name":"Transportation planning","score":0.5809218883514404},{"id":"https://openalex.org/keywords/budget-constraint","display_name":"Budget constraint","score":0.5799316167831421},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5747576951980591},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.5350474119186401},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.524433434009552},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5124254822731018},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4789714813232422},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.4514613747596741},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4167368412017822},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33963510394096375},{"id":"https://openalex.org/keywords/transport-engineering","display_name":"Transport engineering","score":0.1743360161781311},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.1720663607120514},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1708458662033081},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15598520636558533},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.14992207288742065}],"concepts":[{"id":"https://openalex.org/C539828613","wikidata":"https://www.wikidata.org/wiki/Q178512","display_name":"Public transport","level":2,"score":0.6792752742767334},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6209821701049805},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6138401031494141},{"id":"https://openalex.org/C39118121","wikidata":"https://www.wikidata.org/wiki/Q1034047","display_name":"Transportation planning","level":2,"score":0.5809218883514404},{"id":"https://openalex.org/C8505890","wikidata":"https://www.wikidata.org/wiki/Q605095","display_name":"Budget constraint","level":2,"score":0.5799316167831421},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5747576951980591},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.5350474119186401},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.524433434009552},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5124254822731018},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4789714813232422},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.4514613747596741},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4167368412017822},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33963510394096375},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.1743360161781311},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.1720663607120514},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1708458662033081},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15598520636558533},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.14992207288742065},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","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},{"id":"https://openalex.org/C133425853","wikidata":"https://www.wikidata.org/wiki/Q60571","display_name":"Neoclassical economics","level":1,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:14886","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.17","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/oasics.atmos.2021.17","is_oa":true,"landing_page_url":"https://doi.org/10.4230/oasics.atmos.2021.17","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""},{"id":"mag:3202862631","is_oa":false,"landing_page_url":"https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/8406","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:14886","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.17","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.7200000286102295,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W21730770","https://openalex.org/W2339233888","https://openalex.org/W2944466431","https://openalex.org/W2005547391","https://openalex.org/W3188155151","https://openalex.org/W2209253126","https://openalex.org/W949847523","https://openalex.org/W2733247169","https://openalex.org/W2990925054","https://openalex.org/W2324668650","https://openalex.org/W2067840618","https://openalex.org/W2986766003","https://openalex.org/W2570639837","https://openalex.org/W2115618655","https://openalex.org/W2762828613","https://openalex.org/W2023052142","https://openalex.org/W2791449870","https://openalex.org/W2235530883","https://openalex.org/W2787314222","https://openalex.org/W2183629275"],"abstract_inverted_index":{"In":[0],"order":[1],"to":[2,62,76,95],"plan":[3],"and":[4,13,109],"schedule":[5],"a":[6,104],"demand-responsive":[7],"public":[8,66,97],"transportation":[9],"system,":[10],"both":[11],"temporal":[12],"spatial":[14],"changes":[15],"in":[16,88],"demand":[17],"should":[18],"be":[19],"taken":[20],"into":[21],"account":[22],"even":[23,69,84],"at":[24],"the":[25,31,45,48,52,56,85],"line":[26,33,53],"planning":[27,34,54],"stage.":[28],"We":[29],"study":[30],"multi-period":[32,57],"problem":[35],"with":[36,70],"integrated":[37],"decisions":[38],"regarding":[39],"dynamic":[40],"allocation":[41],"of":[42,51,82,103],"vehicles":[43],"among":[44],"lines.":[46],"Given":[47],"NP-hard":[49],"nature":[50],"problem,":[55],"version":[58],"is":[59],"clearly":[60],"difficult":[61],"solve":[63],"for":[64],"large":[65],"transit":[67,98],"networks":[68],"advanced":[71],"solvers.":[72],"It":[73],"becomes":[74],"necessary":[75],"develop":[77],"algorithms":[78],"that":[79],"are":[80],"capable":[81],"solving":[83],"very-large":[86],"instances":[87,92],"reasonable":[89],"time.":[90],"For":[91],"which":[93],"belong":[94],"real":[96],"networks,":[99],"we":[100],"present":[101],"results":[102],"heuristic":[105],"local":[106],"branching":[107],"algorithm":[108],"an":[110],"exact":[111],"approach":[112],"based":[113],"on":[114],"constraint":[115],"propagation.":[116]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2021-10-11T00:00:00"}