{"title":"考虑物理工作负荷的分割配送开放车辆路径问题的遗传算法","authors":"Tarit Rattanamanee","doi":"10.1109/RI2C51727.2021.9559769","DOIUrl":null,"url":null,"abstract":"Last-mile delivery is an important part of a logistics activity in the city. Usually, delivery workers are required to manually unload goods at customer locations. These manual tasks induce physiological fatigue in the workers and increase delivery time. This paper discusses a genetic algorithm (GA) approach to the open vehicle routing problem with split delivery (SDOVRP), where manual unloading is addressed. The workers are pre-assigned to vehicle and split delivery is allowed. Its objective is to minimize the total cost of total fixed cost of vehicles and delivery workers and total transportation cost. For safety, the total physical workload imposed on each worker must not exceed the daily limit. Since an optimization approach cannot find the optimal solution within reasonable computation time especially when solving large size problem. A GA with heuristic for pre-determine split delivery is developed to solve the problem. The computational experiment results show that the GA approach is efficient and can obtain near-optimal SDOVRP solutions.","PeriodicalId":422981,"journal":{"name":"2021 Research, Invention, and Innovation Congress: Innovation Electricals and Electronics (RI2C)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Genetic Algorithm for Split Delivery Open Vehicle Routing Problem with Physical Workload Consideration\",\"authors\":\"Tarit Rattanamanee\",\"doi\":\"10.1109/RI2C51727.2021.9559769\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Last-mile delivery is an important part of a logistics activity in the city. Usually, delivery workers are required to manually unload goods at customer locations. These manual tasks induce physiological fatigue in the workers and increase delivery time. This paper discusses a genetic algorithm (GA) approach to the open vehicle routing problem with split delivery (SDOVRP), where manual unloading is addressed. The workers are pre-assigned to vehicle and split delivery is allowed. Its objective is to minimize the total cost of total fixed cost of vehicles and delivery workers and total transportation cost. For safety, the total physical workload imposed on each worker must not exceed the daily limit. Since an optimization approach cannot find the optimal solution within reasonable computation time especially when solving large size problem. A GA with heuristic for pre-determine split delivery is developed to solve the problem. The computational experiment results show that the GA approach is efficient and can obtain near-optimal SDOVRP solutions.\",\"PeriodicalId\":422981,\"journal\":{\"name\":\"2021 Research, Invention, and Innovation Congress: Innovation Electricals and Electronics (RI2C)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 Research, Invention, and Innovation Congress: Innovation Electricals and Electronics (RI2C)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RI2C51727.2021.9559769\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 Research, Invention, and Innovation Congress: Innovation Electricals and Electronics (RI2C)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RI2C51727.2021.9559769","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Genetic Algorithm for Split Delivery Open Vehicle Routing Problem with Physical Workload Consideration
Last-mile delivery is an important part of a logistics activity in the city. Usually, delivery workers are required to manually unload goods at customer locations. These manual tasks induce physiological fatigue in the workers and increase delivery time. This paper discusses a genetic algorithm (GA) approach to the open vehicle routing problem with split delivery (SDOVRP), where manual unloading is addressed. The workers are pre-assigned to vehicle and split delivery is allowed. Its objective is to minimize the total cost of total fixed cost of vehicles and delivery workers and total transportation cost. For safety, the total physical workload imposed on each worker must not exceed the daily limit. Since an optimization approach cannot find the optimal solution within reasonable computation time especially when solving large size problem. A GA with heuristic for pre-determine split delivery is developed to solve the problem. The computational experiment results show that the GA approach is efficient and can obtain near-optimal SDOVRP solutions.