{"title":"配送系统中车辆路径问题的遗传算法","authors":"K. Uchimura, H. Sakaguchi, T. Nakashima","doi":"10.1109/VNIS.1994.396825","DOIUrl":null,"url":null,"abstract":"Genetic algorithms are proposed as a new learning paradigm for combinatorial optimization that models a natural evolution mechanism. The authors attempt to apply genetic algorithms to the vehicle routing problem. As it is easy to generate the same gene while a generation shift goes on, it is feared that a solution will fall into a local minimum. The authors propose a new method that does not permit overlapping of genes. Some experiments are performed on digital road maps. The authors' results show that the genetic algorithms can effectively find optimum solutions.<<ETX>>","PeriodicalId":338322,"journal":{"name":"Proceedings of VNIS'94 - 1994 Vehicle Navigation and Information Systems Conference","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Genetic algorithms for vehicle routing problem in delivery system\",\"authors\":\"K. Uchimura, H. Sakaguchi, T. Nakashima\",\"doi\":\"10.1109/VNIS.1994.396825\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Genetic algorithms are proposed as a new learning paradigm for combinatorial optimization that models a natural evolution mechanism. The authors attempt to apply genetic algorithms to the vehicle routing problem. As it is easy to generate the same gene while a generation shift goes on, it is feared that a solution will fall into a local minimum. The authors propose a new method that does not permit overlapping of genes. Some experiments are performed on digital road maps. The authors' results show that the genetic algorithms can effectively find optimum solutions.<<ETX>>\",\"PeriodicalId\":338322,\"journal\":{\"name\":\"Proceedings of VNIS'94 - 1994 Vehicle Navigation and Information Systems Conference\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-08-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of VNIS'94 - 1994 Vehicle Navigation and Information Systems Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VNIS.1994.396825\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of VNIS'94 - 1994 Vehicle Navigation and Information Systems Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VNIS.1994.396825","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Genetic algorithms for vehicle routing problem in delivery system
Genetic algorithms are proposed as a new learning paradigm for combinatorial optimization that models a natural evolution mechanism. The authors attempt to apply genetic algorithms to the vehicle routing problem. As it is easy to generate the same gene while a generation shift goes on, it is feared that a solution will fall into a local minimum. The authors propose a new method that does not permit overlapping of genes. Some experiments are performed on digital road maps. The authors' results show that the genetic algorithms can effectively find optimum solutions.<>