C. Archetti, L.C. Coelho, M.G. Speranza, P. Vansteenwegen
{"title":"超越五十年的车辆路线:洞察历史和未来","authors":"C. Archetti, L.C. Coelho, M.G. Speranza, P. Vansteenwegen","doi":"10.1016/j.ejor.2025.06.014","DOIUrl":null,"url":null,"abstract":"Vehicle routing problems (VRPs) are a large class of well-studied and computationally hard combinatorial optimization problems. In the classical capacitated VRP, a fleet of homogeneous capacitated vehicles, that start and end their route at a depot, must satisfy customers’ demand at minimum cost. Many variants and extensions of this problem have been studied. In this paper, after discussing the capacitated VRP, we review the literature for the most-studied variants and extensions of the VRP and then focus on the most recent developments and trends.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"6 1","pages":""},"PeriodicalIF":6.0000,"publicationDate":"2025-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Beyond fifty years of vehicle routing: Insights into the history and the future\",\"authors\":\"C. Archetti, L.C. Coelho, M.G. Speranza, P. Vansteenwegen\",\"doi\":\"10.1016/j.ejor.2025.06.014\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Vehicle routing problems (VRPs) are a large class of well-studied and computationally hard combinatorial optimization problems. In the classical capacitated VRP, a fleet of homogeneous capacitated vehicles, that start and end their route at a depot, must satisfy customers’ demand at minimum cost. Many variants and extensions of this problem have been studied. In this paper, after discussing the capacitated VRP, we review the literature for the most-studied variants and extensions of the VRP and then focus on the most recent developments and trends.\",\"PeriodicalId\":55161,\"journal\":{\"name\":\"European Journal of Operational Research\",\"volume\":\"6 1\",\"pages\":\"\"},\"PeriodicalIF\":6.0000,\"publicationDate\":\"2025-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European Journal of Operational Research\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://doi.org/10.1016/j.ejor.2025.06.014\",\"RegionNum\":2,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Operational Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1016/j.ejor.2025.06.014","RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
Beyond fifty years of vehicle routing: Insights into the history and the future
Vehicle routing problems (VRPs) are a large class of well-studied and computationally hard combinatorial optimization problems. In the classical capacitated VRP, a fleet of homogeneous capacitated vehicles, that start and end their route at a depot, must satisfy customers’ demand at minimum cost. Many variants and extensions of this problem have been studied. In this paper, after discussing the capacitated VRP, we review the literature for the most-studied variants and extensions of the VRP and then focus on the most recent developments and trends.
期刊介绍:
The European Journal of Operational Research (EJOR) publishes high quality, original papers that contribute to the methodology of operational research (OR) and to the practice of decision making.