车队规模和混合车辆路径问题(FSMVRP):基于工厂容量和多日规划算法的适应性大邻域搜索启发式优化方案:牲畜饲料行业案例研究

{"title":"车队规模和混合车辆路径问题(FSMVRP):基于工厂容量和多日规划算法的适应性大邻域搜索启发式优化方案:牲畜饲料行业案例研究","authors":"A. Çelikdin","doi":"10.26650/jtl.2023.1101161","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":421325,"journal":{"name":"Journal of Transportation and Logistics","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fleet Size and Mix Vehicle Routing Problem (FSMVRP), Adapted Large Neighbourhood Search Heuristic Optimization ProposalWith a Plant-capacity and Multi-day Planning Algorithm: A Livestock Feed Industry Case Study\",\"authors\":\"A. Çelikdin\",\"doi\":\"10.26650/jtl.2023.1101161\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":421325,\"journal\":{\"name\":\"Journal of Transportation and Logistics\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-08-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Transportation and Logistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.26650/jtl.2023.1101161\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Transportation and Logistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26650/jtl.2023.1101161","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}