{"id":"https://openalex.org/W2917468769","doi":"https://doi.org/10.1080/01605682.2018.1500977","title":"A combined fast greedy heuristic for the capacitated multicommodity network design problem","display_name":"A combined fast greedy heuristic for the capacitated multicommodity network design problem","publication_year":2019,"publication_date":"2019-02-22","ids":{"openalex":"https://openalex.org/W2917468769","doi":"https://doi.org/10.1080/01605682.2018.1500977","mag":"2917468769"},"language":"en","primary_location":{"id":"doi:10.1080/01605682.2018.1500977","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01605682.2018.1500977","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","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/A5023918832","display_name":"Naoto Katayama","orcid":"https://orcid.org/0000-0002-5389-6598"},"institutions":[{"id":"https://openalex.org/I59421653","display_name":"Ryutsu Keizai University","ror":"https://ror.org/008754496","country_code":"JP","type":"education","lineage":["https://openalex.org/I59421653"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Naoto Katayama","raw_affiliation_strings":["Ryutsu Keizai University, Matsudo, Chiba, Japan"],"raw_orcid":"https://orcid.org/0000-0002-5389-6598","affiliations":[{"raw_affiliation_string":"Ryutsu Keizai University, Matsudo, Chiba, Japan","institution_ids":["https://openalex.org/I59421653"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5023918832"],"corresponding_institution_ids":["https://openalex.org/I59421653"],"apc_list":null,"apc_paid":null,"fwci":1.8711,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.87252738,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"70","issue":"11","first_page":"1983","last_page":"1996"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9965999722480774,"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.9965999722480774,"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/T10539","display_name":"Sustainable Supply Chain Management","score":0.9883999824523926,"subfield":{"id":"https://openalex.org/subfields/1408","display_name":"Strategy and 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.9883000254631042,"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/heuristics","display_name":"Heuristics","score":0.7100105285644531},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7043156623840332},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6799721717834473},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.6513002514839172},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.5616426467895508},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5561792254447937},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5210625529289246},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5086508989334106},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5055427551269531},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.3837570250034332},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29769042134284973},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23913687467575073},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08271276950836182}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7100105285644531},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7043156623840332},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6799721717834473},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.6513002514839172},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.5616426467895508},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5561792254447937},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5210625529289246},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5086508989334106},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5055427551269531},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.3837570250034332},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29769042134284973},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23913687467575073},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08271276950836182},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/01605682.2018.1500977","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01605682.2018.1500977","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:taf:tjorxx:v:70:y:2019:i:11:p:1983-1996","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1080/01605682.2018.1500977","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2391457464","display_name":"Development of Analysis System for Integrated Closed-Loop Supply Chain Network Design Problems","funder_award_id":"17K01268","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G3659785373","display_name":"Development of Algorithms for Robustness Supply Chain Network Design Problems","funder_award_id":"25350454","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W638013724","https://openalex.org/W790504945","https://openalex.org/W1112549928","https://openalex.org/W1504989502","https://openalex.org/W2007402232","https://openalex.org/W2016885155","https://openalex.org/W2019698010","https://openalex.org/W2027918977","https://openalex.org/W2053891507","https://openalex.org/W2053961867","https://openalex.org/W2064035628","https://openalex.org/W2083931873","https://openalex.org/W2085525077","https://openalex.org/W2089233175","https://openalex.org/W2092836722","https://openalex.org/W2094151003","https://openalex.org/W2106852598","https://openalex.org/W2117768313","https://openalex.org/W2127635925","https://openalex.org/W2139575211","https://openalex.org/W2154219301","https://openalex.org/W2170354462","https://openalex.org/W2171985270","https://openalex.org/W2234356561","https://openalex.org/W2307820970","https://openalex.org/W2520636539","https://openalex.org/W4206058671","https://openalex.org/W4212907853"],"related_works":["https://openalex.org/W3119129187","https://openalex.org/W4231500168","https://openalex.org/W90079504","https://openalex.org/W3141113327","https://openalex.org/W3035974271","https://openalex.org/W2032436423","https://openalex.org/W2374451529","https://openalex.org/W1561045713","https://openalex.org/W2080904092","https://openalex.org/W2071199983"],"abstract_inverted_index":{"The":[0,50,88,100],"capacitated":[1,45],"multicommodity":[2,46,64],"network":[3,8,47,65],"design":[4,9,48,66],"problem":[5,107],"represents":[6],"a":[7,13,38,71,82,96],"system":[10],"and":[11,30,57,81],"has":[12],"wide":[14],"range":[15],"of":[16,23,78,113],"real-life":[17],"applications,":[18],"such":[19],"as":[20],"the":[21,44,62,76],"construction":[22],"logistics":[24],"networks,":[25,27,29],"transportation":[26],"communication":[28],"production":[31],"networks.":[32],"In":[33],"this":[34],"article,":[35],"we":[36],"introduce":[37],"fast":[39],"greedy":[40,51],"algorithm":[41,52,69,89],"for":[42,61,74,85,104],"solving":[43,105],"problem.":[49,67],"is":[53,109],"based":[54],"on":[55],"link-rerouting":[56,59],"partial":[58],"heuristics":[60],"uncapacitated":[63],"This":[68],"involves":[70],"capacity":[72],"scaling":[73],"reducing":[75],"number":[77],"candidate":[79],"arcs":[80],"restricted":[83],"branch-and-bound":[84],"improving":[86],"solutions.":[87],"succeeds":[90],"in":[91],"finding":[92],"good":[93],"solutions":[94],"within":[95],"short":[97],"computation":[98,102],"time.":[99],"average":[101],"time":[103],"benchmark":[106],"instances":[108],"only":[110],"several":[111],"tens":[112],"seconds.":[114]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}