{"id":"https://openalex.org/W2062188707","doi":"https://doi.org/10.1016/0305-0548(86)90062-6","title":"A vehicle routing improvement algorithm comparison of a \u201cgreedy\u201d and a matching implementation for inventory routing","display_name":"A vehicle routing improvement algorithm comparison of a \u201cgreedy\u201d and a matching implementation for inventory routing","publication_year":1986,"publication_date":"1986-01-01","ids":{"openalex":"https://openalex.org/W2062188707","doi":"https://doi.org/10.1016/0305-0548(86)90062-6","mag":"2062188707"},"language":"en","primary_location":{"id":"doi:10.1016/0305-0548(86)90062-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0305-0548(86)90062-6","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers &amp; Operations Research","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/A5012490161","display_name":"Moshe Dror","orcid":null},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Moshe Dror","raw_affiliation_strings":["Industrial Engineering and Management, Ben-Gurion University of the Negev, Israel","Industrial Engineering and Management, Ben Gurion University of The Negev, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial Engineering and Management, Ben-Gurion University of the Negev, Israel","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"Industrial Engineering and Management, Ben Gurion University of The Negev, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038079773","display_name":"Larry Levy","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Larry Levy","raw_affiliation_strings":["College of Business and Management, University of Maryland at College Park, College Park, MD, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Business and Management, University of Maryland at College Park, College Park, MD, U.S.A","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":6.8498,"has_fulltext":false,"cited_by_count":110,"citation_normalized_percentile":{"value":0.96253175,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"13","issue":"1","first_page":"33","last_page":"45"},"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9966999888420105,"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"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9940000176429749,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.7989686727523804},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6623591184616089},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6532129049301147},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.617362380027771},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.59489905834198},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5506356954574585},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.546583354473114},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5223144888877869},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.48844781517982483},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.45143797993659973},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4187435805797577},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.3579985499382019},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.2833694815635681},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26548826694488525},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.12866032123565674},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06407922506332397}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.7989686727523804},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6623591184616089},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6532129049301147},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.617362380027771},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.59489905834198},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5506356954574585},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.546583354473114},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5223144888877869},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.48844781517982483},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.45143797993659973},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4187435805797577},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.3579985499382019},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.2833694815635681},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26548826694488525},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.12866032123565674},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06407922506332397},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0305-0548(86)90062-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0305-0548(86)90062-6","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers &amp; Operations Research","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":9,"referenced_works":["https://openalex.org/W15274158","https://openalex.org/W831830428","https://openalex.org/W1752229794","https://openalex.org/W1985278890","https://openalex.org/W2007214900","https://openalex.org/W2031095045","https://openalex.org/W2042986967","https://openalex.org/W2068081170","https://openalex.org/W6667955701"],"related_works":["https://openalex.org/W2285681610","https://openalex.org/W2157623912","https://openalex.org/W2062188707","https://openalex.org/W2379880827","https://openalex.org/W2127580152","https://openalex.org/W2347831160","https://openalex.org/W1918505850","https://openalex.org/W4225479426","https://openalex.org/W2162284356","https://openalex.org/W2166606842"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-22T06:23:43.705686","created_date":"2025-10-10T00:00:00"}
