{"id":"https://openalex.org/W1966203848","doi":"https://doi.org/10.1109/itsc.2013.6728493","title":"Stochastic mobile facility routing and scheduling problem","display_name":"Stochastic mobile facility routing and scheduling problem","publication_year":2013,"publication_date":"2013-10-01","ids":{"openalex":"https://openalex.org/W1966203848","doi":"https://doi.org/10.1109/itsc.2013.6728493","mag":"1966203848"},"language":"en","primary_location":{"id":"doi:10.1109/itsc.2013.6728493","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2013.6728493","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"16th International IEEE Conference on Intelligent Transportation Systems (ITSC 2013)","raw_type":"proceedings-article"},"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/A5078632046","display_name":"Chao Lei","orcid":"https://orcid.org/0000-0002-3044-154X"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chao Lei","raw_affiliation_strings":["Department of Industrial Engineering, Tsinghua University, Beijing, China","Dept. of Ind. Eng., Tsinghua Univ., Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]},{"raw_affiliation_string":"Dept. of Ind. Eng., Tsinghua Univ., Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101840304","display_name":"Wei-Hua Lin","orcid":"https://orcid.org/0009-0004-0533-9836"},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wei-Hua Lin","raw_affiliation_strings":["Department of Systems and Industrial Engineering, University of Arizona, Tucson, Arizona, USA","[Dept. of Syst. & Ind. Eng., Univ. of Arizona, Tucson, AZ, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Systems and Industrial Engineering, University of Arizona, Tucson, Arizona, USA","institution_ids":["https://openalex.org/I138006243"]},{"raw_affiliation_string":"[Dept. of Syst. & Ind. Eng., Univ. of Arizona, Tucson, AZ, USA]","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100348897","display_name":"Lixin Miao","orcid":"https://orcid.org/0000-0002-2558-3885"},"institutions":[{"id":"https://openalex.org/I3131625388","display_name":"University Town of Shenzhen","ror":"https://ror.org/05f5j6225","country_code":"CN","type":"education","lineage":["https://openalex.org/I3131625388"]},{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lixin Miao","raw_affiliation_strings":["Modern Logistics Research Center, Tsinghua University, China","Modern Logistics Res. Center, Tsinghua Univ., Shenzhen, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Modern Logistics Research Center, Tsinghua University, China","institution_ids":["https://openalex.org/I99065089"]},{"raw_affiliation_string":"Modern Logistics Res. Center, Tsinghua Univ., Shenzhen, China","institution_ids":["https://openalex.org/I3131625388","https://openalex.org/I99065089"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015881114","display_name":"Mingyao Qi","orcid":"https://orcid.org/0000-0002-3678-6522"},"institutions":[{"id":"https://openalex.org/I3131625388","display_name":"University Town of Shenzhen","ror":"https://ror.org/05f5j6225","country_code":"CN","type":"education","lineage":["https://openalex.org/I3131625388"]},{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Mingyao Qi","raw_affiliation_strings":["Modern Logistics Research Center, Tsinghua University, China","Modern Logistics Res. Center, Tsinghua Univ., Shenzhen, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Modern Logistics Research Center, Tsinghua University, China","institution_ids":["https://openalex.org/I99065089"]},{"raw_affiliation_string":"Modern Logistics Res. Center, Tsinghua Univ., Shenzhen, China","institution_ids":["https://openalex.org/I3131625388","https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"49","issue":null,"first_page":"1823","last_page":"1828"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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.9994999766349792,"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.9994000196456909,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.71710205078125},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.614041268825531},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5925963521003723},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5758095383644104},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5639927387237549},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.5223960876464844},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.46982336044311523},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4615478813648224},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.45827603340148926},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.44704487919807434},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.150202214717865},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1219816505908966},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08061718940734863}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.71710205078125},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.614041268825531},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5925963521003723},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5758095383644104},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5639927387237549},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.5223960876464844},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.46982336044311523},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4615478813648224},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.45827603340148926},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.44704487919807434},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.150202214717865},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1219816505908966},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08061718940734863},{"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.1109/itsc.2013.6728493","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2013.6728493","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"16th International IEEE Conference on Intelligent Transportation Systems (ITSC 2013)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.4699999988079071,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1569990960","https://openalex.org/W1601649239","https://openalex.org/W1849639730","https://openalex.org/W1963938442","https://openalex.org/W1966175066","https://openalex.org/W1966197373","https://openalex.org/W1979163442","https://openalex.org/W1983688269","https://openalex.org/W1983916623","https://openalex.org/W1985053542","https://openalex.org/W1985536933","https://openalex.org/W1999795674","https://openalex.org/W2003281104","https://openalex.org/W2005327272","https://openalex.org/W2014979043","https://openalex.org/W2018638861","https://openalex.org/W2033411686","https://openalex.org/W2035535234","https://openalex.org/W2038426159","https://openalex.org/W2040896439","https://openalex.org/W2045045217","https://openalex.org/W2045121856","https://openalex.org/W2045254727","https://openalex.org/W2051510189","https://openalex.org/W2055338514","https://openalex.org/W2059100426","https://openalex.org/W2061637847","https://openalex.org/W2085495522","https://openalex.org/W2099011086","https://openalex.org/W2100140125","https://openalex.org/W2100387313","https://openalex.org/W2108462091","https://openalex.org/W2128634324","https://openalex.org/W2134531991","https://openalex.org/W2136272408","https://openalex.org/W2313758466","https://openalex.org/W3123446995","https://openalex.org/W4250535541","https://openalex.org/W4255204197"],"related_works":["https://openalex.org/W4312143452","https://openalex.org/W2018691209","https://openalex.org/W2809387092","https://openalex.org/W3138760849","https://openalex.org/W3033923386","https://openalex.org/W2045475564","https://openalex.org/W1985198755","https://openalex.org/W2133219022","https://openalex.org/W4226320320","https://openalex.org/W3210032805"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,16,36,41,56,62,68,71,84,97],"mobile":[3,24],"facility":[4],"routing":[5],"and":[6,18,64,70,103],"scheduling":[7],"problem":[8,45],"with":[9,29,61],"stochastic":[10,51],"demand":[11,31],"(MFRSPSD).":[12],"MFRSPSD":[13],"simultaneously":[14],"determines":[15],"route":[17],"schedule":[19],"of":[20,23,67,87],"a":[21,49],"fleet":[22],"facilities":[25],"which":[26,55],"serve":[27,77],"customers":[28],"uncertain":[30],"in":[32,54],"order":[33],"to":[34],"minimize":[35],"total":[37],"cost":[38],"generated":[39],"over":[40],"planning":[42],"horizon.":[43],"The":[44,92],"is":[46,90],"formulated":[47],"as":[48],"two-stage":[50],"programming":[52],"model,":[53],"first":[57],"stage":[58,73],"decision":[59],"deals":[60],"temporal":[63],"spatial":[65],"movement":[66],"MFs":[69,76],"second":[72],"handles":[74],"how":[75],"customer":[78],"demands.":[79],"An":[80],"algorithm":[81,98],"based":[82],"on":[83],"multicut":[85],"version":[86],"L-shaped":[88],"method":[89],"developed.":[91],"computational":[93],"results":[94],"show":[95],"that":[96],"yields":[99],"high":[100],"quality":[101],"upper":[102],"lower":[104],"bounds":[105],"within":[106],"reasonable":[107],"computation":[108],"time":[109],"for":[110],"medium":[111],"scale":[112],"problems.":[113]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}