{"id":"https://openalex.org/W2096305430","doi":"https://doi.org/10.1287/opre.35.2.254","title":"Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints","display_name":"Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints","publication_year":1987,"publication_date":"1987-04-01","ids":{"openalex":"https://openalex.org/W2096305430","doi":"https://doi.org/10.1287/opre.35.2.254","mag":"2096305430"},"language":"en","primary_location":{"id":"doi:10.1287/opre.35.2.254","doi":"https://doi.org/10.1287/opre.35.2.254","is_oa":false,"landing_page_url":"https://doi.org/10.1287/opre.35.2.254","pdf_url":null,"source":{"id":"https://openalex.org/S125775545","display_name":"Operations Research","issn_l":"0030-364X","issn":["0030-364X","1526-5463"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a-star","anvur-class-a","anvur-scientific","cwts-core","fnege-1-star","ft50","jufo-3","norway-2","poland-140","russia-white-list-1","utd24","vabb-shw"],"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research","raw_type":"journal-article"},"volume":null,"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/A5111629781","display_name":"Marius M. Solomon","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Marius M. Solomon","raw_affiliation_strings":["Northeastern University, Boston, Massachusetts"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, Massachusetts","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111629781"],"corresponding_institution_ids":["https://openalex.org/I12912129"],"apc_list":null,"apc_paid":null,"fwci":22.6406,"has_fulltext":false,"cited_by_count":4321,"citation_normalized_percentile":{"value":0.99489933,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"35","issue":"2","first_page":"254","last_page":"265"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":1.0,"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":1.0,"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.0,"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/T12306","display_name":"Urban and Freight Transport Logistics","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/vehicle-routing-problem","display_name":"vehicle routing","score":0.8510000109672546},{"id":"https://openalex.org/keywords/vehicle-scheduling","display_name":"vehicle scheduling","score":0.8339999914169312},{"id":"https://openalex.org/keywords/time-windows","display_name":"time windows","score":0.8080000281333923},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.8690000176429749},{"id":"https://openalex.org/keywords/heuristics","display_name":"heuristics","score":0.9279999732971191},{"id":"https://openalex.org/keywords/insertion-heuristic","display_name":"insertion heuristic","score":0.9089999794960022},{"id":"https://openalex.org/keywords/computational-performance","display_name":"computational performance","score":0.5040000081062317}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7905710935592651},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7068807482719421},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6553674936294556},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6271418333053589},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6030724048614502},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5102732181549072},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.5057322978973389},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.44391679763793945},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4113607108592987},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3820279836654663},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1960972547531128},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06965258717536926},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1287/opre.35.2.254","doi":"https://doi.org/10.1287/opre.35.2.254","is_oa":false,"landing_page_url":"https://doi.org/10.1287/opre.35.2.254","pdf_url":null,"source":{"id":"https://openalex.org/S125775545","display_name":"Operations Research","issn_l":"0030-364X","issn":["0030-364X","1526-5463"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a-star","anvur-class-a","anvur-scientific","cwts-core","fnege-1-star","ft50","jufo-3","norway-2","poland-140","russia-white-list-1","utd24","vabb-shw"],"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.124.8593","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124.8593","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.banaan.org/~vinnoo/pdf1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.186.6295","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.6295","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.iro.umontreal.ca/%7Edift6751/paper_solomon.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W622823531","https://openalex.org/W1997403587","https://openalex.org/W2041903679","https://openalex.org/W2049287714","https://openalex.org/W2058892401","https://openalex.org/W2062045653","https://openalex.org/W2062893072","https://openalex.org/W2093489541","https://openalex.org/W2093665022","https://openalex.org/W2099179308","https://openalex.org/W2104654522","https://openalex.org/W2108753073","https://openalex.org/W2111581650","https://openalex.org/W2121180493","https://openalex.org/W2124573898","https://openalex.org/W2139445665","https://openalex.org/W2148673189","https://openalex.org/W2163873159","https://openalex.org/W2172122819","https://openalex.org/W2513094291","https://openalex.org/W2574572942","https://openalex.org/W2622502145","https://openalex.org/W2999341115","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W2018691209","https://openalex.org/W4312143452","https://openalex.org/W3119129187","https://openalex.org/W2470251263","https://openalex.org/W2193306078","https://openalex.org/W2280479546","https://openalex.org/W3142508129"],"abstract_inverted_index":{"This":[0],"paper":[1],"considers":[2],"the":[3,20,32,67,74,76,88],"design":[4],"and":[5,12,59,85,87],"analysis":[6],"of":[7,23,43,51,66,69,78],"algorithms":[8],"for":[9,35],"vehicle":[10],"routing":[11,58],"scheduling":[13,60,89],"problems":[14],"with":[15,80],"time":[16,81],"window":[17],"constraints.":[18],"Given":[19],"intrinsic":[21],"difficulty":[22],"this":[24],"problem":[25,55,100],"class,":[26],"approximation":[27],"methods":[28],"seem":[29],"to":[30,72],"offer":[31],"most":[33],"promise":[34],"practical":[36],"size":[37],"problems.":[38],"After":[39],"describing":[40],"a":[41],"variety":[42],"heuristics,":[44],"we":[45],"conduct":[46],"an":[47,104],"extensive":[48],"computational":[49],"study":[50],"their":[52,83],"performance.":[53],"The":[54],"set":[56],"includes":[57],"environments":[61],"that":[62,93],"differ":[63],"in":[64,98,102],"terms":[65],"type":[68],"data":[70],"used":[71],"generate":[73],"problems,":[75],"percentage":[77],"customers":[79],"windows,":[82],"tightness":[84],"positioning,":[86],"horizon.":[90],"We":[91],"found":[92],"several":[94],"heuristics":[95],"performed":[96],"well":[97],"different":[99],"environments;":[101],"particular":[103],"insertion-type":[105],"heuristic":[106],"consistently":[107],"gave":[108],"very":[109],"good":[110],"results.":[111]},"counts_by_year":[{"year":2026,"cited_by_count":244},{"year":2025,"cited_by_count":258},{"year":2024,"cited_by_count":219},{"year":2023,"cited_by_count":253},{"year":2022,"cited_by_count":223},{"year":2021,"cited_by_count":216},{"year":2020,"cited_by_count":273},{"year":2019,"cited_by_count":219},{"year":2018,"cited_by_count":198},{"year":2017,"cited_by_count":181},{"year":2016,"cited_by_count":179},{"year":2015,"cited_by_count":172},{"year":2014,"cited_by_count":185},{"year":2013,"cited_by_count":171},{"year":2012,"cited_by_count":164}],"updated_date":"2026-10-10T09:11:00.788812","created_date":"2025-10-10T00:00:00"}