{"id":"https://openalex.org/W7116936499","doi":"https://doi.org/10.1109/isc266238.2025.11293289","title":"An Approach to Formulate the Dial-a-Ride Problem with Linear Programming","display_name":"An Approach to Formulate the Dial-a-Ride Problem with Linear Programming","publication_year":2025,"publication_date":"2025-10-06","ids":{"openalex":"https://openalex.org/W7116936499","doi":"https://doi.org/10.1109/isc266238.2025.11293289"},"language":null,"primary_location":{"id":"doi:10.1109/isc266238.2025.11293289","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isc266238.2025.11293289","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Smart Cities Conference (ISC2)","raw_type":"proceedings-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/A5016161945","display_name":"Oytun Arslan","orcid":null},"institutions":[{"id":"https://openalex.org/I40527276","display_name":"Universit\u00e4t der Bundeswehr M\u00fcnchen","ror":"https://ror.org/05kkv3f82","country_code":"DE","type":"education","lineage":["https://openalex.org/I1315109972","https://openalex.org/I40527276","https://openalex.org/I4387152969"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Oytun Arslan","raw_affiliation_strings":["University of the Bundeswehr Munich,Chair of Intelligent, Multimodal Transport Systems,Munich,Germany"],"affiliations":[{"raw_affiliation_string":"University of the Bundeswehr Munich,Chair of Intelligent, Multimodal Transport Systems,Munich,Germany","institution_ids":["https://openalex.org/I40527276"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002724563","display_name":"Silja Hoffmann","orcid":"https://orcid.org/0000-0002-0499-0342"},"institutions":[{"id":"https://openalex.org/I40527276","display_name":"Universit\u00e4t der Bundeswehr M\u00fcnchen","ror":"https://ror.org/05kkv3f82","country_code":"DE","type":"education","lineage":["https://openalex.org/I1315109972","https://openalex.org/I40527276","https://openalex.org/I4387152969"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Silja Hoffmann","raw_affiliation_strings":["University of the Bundeswehr Munich,Chair of Intelligent, Multimodal Transport Systems,Munich,Germany"],"affiliations":[{"raw_affiliation_string":"University of the Bundeswehr Munich,Chair of Intelligent, Multimodal Transport Systems,Munich,Germany","institution_ids":["https://openalex.org/I40527276"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016161945"],"corresponding_institution_ids":["https://openalex.org/I40527276"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.53398009,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.9847000241279602,"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"}},"topics":[{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.9847000241279602,"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.011699999682605267,"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"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.0006000000284984708,"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/heuristics","display_name":"Heuristics","score":0.6567000150680542},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.609499990940094},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.560699999332428},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.45879998803138733},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.42809998989105225},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.3765000104904175},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.3637000024318695}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7117000222206116},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6567000150680542},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.609499990940094},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.579200029373169},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.560699999332428},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.45879998803138733},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.42809998989105225},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.3765000104904175},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.3637000024318695},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31790000200271606},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.31470000743865967},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.3142000138759613},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.3138999938964844},{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.3052000105381012},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.2533999979496002}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isc266238.2025.11293289","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isc266238.2025.11293289","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Smart Cities Conference (ISC2)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1595455506","https://openalex.org/W1980402561","https://openalex.org/W2031236641","https://openalex.org/W2051358678","https://openalex.org/W2079487902","https://openalex.org/W2112686410","https://openalex.org/W2515943586","https://openalex.org/W2565919573","https://openalex.org/W2781638039","https://openalex.org/W2792846035","https://openalex.org/W2792987450","https://openalex.org/W2990590392","https://openalex.org/W3197375104","https://openalex.org/W3207987314","https://openalex.org/W4283027325","https://openalex.org/W4320153550","https://openalex.org/W4388068216"],"related_works":[],"abstract_inverted_index":{"Recent":[0],"developments":[1],"in":[2,91,124,159],"autonomous":[3],"vehicle":[4],"technology":[5],"have":[6,147],"paved":[7],"the":[8,50,54,66,79,83,88,92,97,114,125,143,150,172,183,195],"way":[9],"to":[10,154,171,181],"new":[11],"mobility":[12,25],"solutions,":[13,157],"such":[14],"as":[15,32,68,85,87,127],"ride-pooling,":[16,113],"which":[17],"has":[18],"become":[19],"a":[20,33,42,62,132,139],"popular":[21],"form":[22],"of":[23,53,96,112,131,142,161,185,197],"on-demand":[24],"systems.":[26],"Ride-pooling":[27],"is":[28,99,136,152,179],"most":[29],"commonly":[30],"modeled":[31],"dial-a-ride":[34],"problem":[35,80],"(DARP).":[36],"In":[37],"this":[38],"paper,":[39],"we":[40,60],"introduce":[41],"mixed":[43],"integer":[44],"linear":[45],"programming":[46],"(MILP)":[47],"formulation":[48,64,77,126,151],"for":[49,56,138],"exact":[51,156],"solution":[52],"DARP":[55],"immediate":[57],"requests.":[58,199],"Hereby":[59],"use":[61],"well-known":[63],"from":[65,105],"literature":[67],"basis,":[69],"extend":[70],"it":[71],"and":[72,101,118,189],"adapt":[73],"where":[74],"necessary.":[75],"The":[76],"solves":[78],"by":[81],"considering":[82],"operator":[84],"well":[86],"passenger":[89],"perspectives":[90],"objective":[93],"function.":[94],"Rejection":[95],"requests":[98],"possible,":[100],"vehicles":[102],"can":[103],"start":[104],"any":[106],"network":[107,135],"positions.":[108],"Two":[109],"important":[110],"parameters":[111,193],"maximum":[115,119,186,190],"waiting":[116,187],"time":[117,188],"detour":[120,191],"ratio,":[121],"are":[122],"incorporated":[123],"well.":[128],"An":[129],"example":[130],"square":[133],"grid":[134],"provided":[137],"better":[140],"comprehension":[141],"problem.":[144],"Numerical":[145],"experiments":[146],"shown":[148],"that":[149],"able":[153],"find":[155],"but":[158],"case":[160],"larger":[162],"scenarios":[163],"heuristics":[164],"or":[165],"metaheuristics":[166],"might":[167],"be":[168],"needed":[169],"due":[170],"high":[173],"computational":[174],"time.":[175],"Additionally,":[176],"an":[177],"analysis":[178],"performed":[180],"observe":[182],"impacts":[184],"ratio":[192],"on":[194],"number":[196],"served":[198]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-12-23T00:00:00"}