{"id":"https://openalex.org/W2003890550","doi":"https://doi.org/10.1002/net.3230210704","title":"A multiphase approach to the period routing problem","display_name":"A multiphase approach to the period routing problem","publication_year":1991,"publication_date":"1991-12-01","ids":{"openalex":"https://openalex.org/W2003890550","doi":"https://doi.org/10.1002/net.3230210704","mag":"2003890550"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230210704","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230210704","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/A5051316058","display_name":"Robert A. Russell","orcid":"https://orcid.org/0000-0002-6819-8194"},"institutions":[{"id":"https://openalex.org/I87208437","display_name":"University of Tulsa","ror":"https://ror.org/04wn28048","country_code":"US","type":"education","lineage":["https://openalex.org/I87208437"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Robert A. Russell","raw_affiliation_strings":["Quantitative Methods and MIS, The University of Tulsa, 600 South College, Tulsa, Oklahoma 74104"],"affiliations":[{"raw_affiliation_string":"Quantitative Methods and MIS, The University of Tulsa, 600 South College, Tulsa, Oklahoma 74104","institution_ids":["https://openalex.org/I87208437"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111626753","display_name":"Dave Gribbin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dave Gribbin","raw_affiliation_strings":["Gribbin Development Co., Jenks, Oklahoma 74037"],"affiliations":[{"raw_affiliation_string":"Gribbin Development Co., Jenks, Oklahoma 74037","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051316058"],"corresponding_institution_ids":["https://openalex.org/I87208437"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":81,"citation_normalized_percentile":{"value":0.1874896,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"21","issue":"7","first_page":"747","last_page":"765"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"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.9998999834060669,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9775000214576721,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9753000140190125,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/heuristic","display_name":"Heuristic","score":0.7429318428039551},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.7148170471191406},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7000343799591064},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6946110725402832},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.6570413112640381},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6089270114898682},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.547956645488739},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4663856029510498},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4476550817489624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2414599061012268},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10187795758247375}],"concepts":[{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7429318428039551},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.7148170471191406},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7000343799591064},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6946110725402832},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6570413112640381},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6089270114898682},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.547956645488739},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4663856029510498},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4476550817489624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2414599061012268},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10187795758247375},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230210704","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230210704","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":13,"referenced_works":["https://openalex.org/W1983945124","https://openalex.org/W2002709723","https://openalex.org/W2042986967","https://openalex.org/W2044038315","https://openalex.org/W2045719928","https://openalex.org/W2068081170","https://openalex.org/W2111581650","https://openalex.org/W2124573898","https://openalex.org/W2125009529","https://openalex.org/W2140318223","https://openalex.org/W2169496078","https://openalex.org/W2172122819","https://openalex.org/W2617045890"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W2164188042","https://openalex.org/W1925942709","https://openalex.org/W2047683846","https://openalex.org/W2044902158","https://openalex.org/W2082154838","https://openalex.org/W2109912052","https://openalex.org/W1711527768"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2],"article,":[3],"we":[4],"present":[5],"a":[6,31,42,65,99],"multiphase":[7,115],"approach":[8,116],"to":[9,46,103],"the":[10,19,81,86,91,114],"period":[11,15,92],"routing":[12,16,93],"problem.":[13,69,94],"The":[14,35,52,70],"problem":[17],"involves":[18,55],"design":[20],"of":[21,38,41,74,90],"effective":[22],"vehicle":[23,88],"routes":[24,89],"that":[25,59,78,113],"satisfy":[26],"customer":[27],"service":[28],"frequencies":[29],"over":[30,119],"specified":[32],"planning":[33],"horizon.":[34],"first":[36],"phase":[37,54,72,97],"analysis":[39],"consists":[40,73],"generalized":[43],"network":[44],"approximation":[45],"achieve":[47],"an":[48,56,75],"efficient":[49],"initial":[50],"solution.":[51],"second":[53],"interchange":[57,76],"heuristic":[58,77],"reduces":[60,80],"distribution":[61,82],"costs":[62,83],"by":[63,84],"solving":[64],"surrogate":[66],"traveling":[67],"salesman":[68],"third":[71],"further":[79,105],"addressing":[85],"actual":[87],"A":[95],"fourth":[96],"utilizes":[98],"0\u20131":[100],"integer":[101],"model":[102],"attempt":[104],"improvements.":[106],"Computational":[107],"results":[108],"on":[109],"test":[110],"problems":[111],"indicate":[112],"yields":[117],"improvements":[118],"previous":[120],"best":[121],"solutions.":[122]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
