{"id":"https://openalex.org/W2109396997","doi":"https://doi.org/10.1002/net.3230220204","title":"Optimal routing and process scheduling for a mobile service facility","display_name":"Optimal routing and process scheduling for a mobile service facility","publication_year":1992,"publication_date":"1992-03-01","ids":{"openalex":"https://openalex.org/W2109396997","doi":"https://doi.org/10.1002/net.3230220204","mag":"2109396997"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230220204","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220204","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5001359670","display_name":"Umit Akinc","orcid":null},"institutions":[{"id":"https://openalex.org/I47251452","display_name":"Wake Forest University","ror":"https://ror.org/0207ad724","country_code":"US","type":"education","lineage":["https://openalex.org/I47251452"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Umit Akinc","raw_affiliation_strings":["School of Business and Accountancy, Wake Forest University Winston Salem, North Carolina 27109"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Business and Accountancy, Wake Forest University Winston Salem, North Carolina 27109","institution_ids":["https://openalex.org/I47251452"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072467080","display_name":"Kizhanatham Srikanth","orcid":null},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kizhanatham Srikanth","raw_affiliation_strings":["College of Business Administration, University of Illinois, at Chicago Circle, Chicago, Illinois 60680"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Business Administration, University of Illinois, at Chicago Circle, Chicago, Illinois 60680","institution_ids":["https://openalex.org/I39422238"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5001359670"],"corresponding_institution_ids":["https://openalex.org/I47251452"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.0344,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.80537015,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"22","issue":"2","first_page":"163","last_page":"183"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9980999827384949,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7233753204345703},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.694627046585083},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6166486144065857},{"id":"https://openalex.org/keywords/service","display_name":"Service (business)","score":0.5632069110870361},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.47760841250419617},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.460886687040329},{"id":"https://openalex.org/keywords/mobile-service","display_name":"Mobile service","score":0.4458240568637848},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44019898772239685},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40419918298721313},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3481253385543823},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3409267067909241},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18523931503295898},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18373170495033264}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7233753204345703},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.694627046585083},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6166486144065857},{"id":"https://openalex.org/C2780378061","wikidata":"https://www.wikidata.org/wiki/Q25351891","display_name":"Service (business)","level":2,"score":0.5632069110870361},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.47760841250419617},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.460886687040329},{"id":"https://openalex.org/C2780559388","wikidata":"https://www.wikidata.org/wiki/Q1247189","display_name":"Mobile service","level":3,"score":0.4458240568637848},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44019898772239685},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40419918298721313},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3481253385543823},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3409267067909241},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18523931503295898},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18373170495033264},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C136264566","wikidata":"https://www.wikidata.org/wiki/Q159810","display_name":"Economy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230220204","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220204","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W149977709","https://openalex.org/W1538346180","https://openalex.org/W1964683996","https://openalex.org/W1988615825","https://openalex.org/W1995274002","https://openalex.org/W2008200956","https://openalex.org/W2008593696","https://openalex.org/W2009803313","https://openalex.org/W2010140631","https://openalex.org/W2017697298","https://openalex.org/W2039347155","https://openalex.org/W2042986967","https://openalex.org/W2045254727","https://openalex.org/W2055360661","https://openalex.org/W2058748455","https://openalex.org/W2061796769","https://openalex.org/W2066558813","https://openalex.org/W2114552889","https://openalex.org/W2125690626","https://openalex.org/W2134531991","https://openalex.org/W2324108981","https://openalex.org/W4294358747"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W2054495636","https://openalex.org/W2164188042","https://openalex.org/W4306878646","https://openalex.org/W2046552997","https://openalex.org/W2913191894","https://openalex.org/W3157689847","https://openalex.org/W4389782626"],"abstract_inverted_index":{"Abstract":[0],"This":[1,157],"paper":[2],"deals":[3],"with":[4],"the":[5,24,40,55,60,82,101,109,112,117,125,144],"problem":[6,62,105],"of":[7,16,28,114,127,136,146],"delivering":[8],"a":[9,13,29,66,79,87,162],"well\u2010defined":[10],"service":[11,31,35,119,132],"to":[12,48,69,107,142,173],"given":[14],"set":[15,126],"points":[17,129],"efficiently.":[18],"Efficiencies":[19],"are":[20,181],"sought":[21],"through":[22],"providing":[23],"services":[25],"by":[26,161],"use":[27],"mobile":[30,38,118],"unit":[32,120],"(MSU).":[33],"The":[34,104],"facility":[36,83],"is":[37,84,106,155,159],"in":[39],"sense":[41],"that":[42,94,116],"it":[43,130],"can":[44,75],"move":[45,147],"from":[46,78],"point":[47,49,71],"at":[50,86,90,134],"some":[51,91],"\u201cmove\u201d":[52],"cost.":[53],"Unlike":[54],"traveling":[56],"salesman\u2010type":[57],"problems":[58],"however":[59],"present":[61],"does":[63],"not":[64],"require":[65],"physical":[67],"visit":[68,123],"every":[70],"for":[72],"servicing.":[73],"Points":[74],"be":[76],"serviced":[77],"distance,":[80],"while":[81,133],"stationed":[85],"nearby":[88],"point,":[89],"\u201cprocessing\u201d":[92],"cost":[93],"may":[95],"depend":[96],"on":[97],"many":[98],"factors,":[99],"including":[100],"distance":[102],"involved.":[103],"find":[108],"subset":[110],"and":[111,124,148,166,169],"sequence":[113],"nodes":[115,139],"should":[121,131],"physically":[122],"other":[128],"each":[135],"these":[137],"visited":[138],"so":[140],"as":[141],"minimize":[143],"sum":[145],"processing":[149],"costs.":[150],"A":[151],"Lagrangean\u2010based":[152],"branch\u2010and\u2010bound":[153],"algorithm":[154,158],"proposed.":[156],"aided":[160],"powerful":[163],"upper\u2010boundig":[164],"routine":[165],"sensitivity":[167],"tests":[168],"logical":[170],"dominance":[171],"rules":[172],"fix":[174],"zero/one":[175],"variables.":[176],"Somewhat":[177],"encouraging":[178],"computational":[179],"results":[180],"presented.":[182]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}