{"title":"基于交叉熵方法的权系数随机需求车辆路径问题","authors":"Yue Qiu","doi":"10.1109/ICCCS.2009.20","DOIUrl":null,"url":null,"abstract":"The cross-entropy (CE) method is a new generic approach to combinatorial and multi-extremal optimization and rare event simulation. Vehicle Routing Problem has been approved a NP problem and it belongs to classical Combination Optimization hard problem. An effective algorithm based on cross-entropy is designed to solve the model which named Vehicle Routing Problem with Weight Coefficients and Stochastic Demands (WVRPSD) with weight coefficients and stochastic demands. Numerical experiments have been conducted and the results indicate that the method can effectively solve this problem.","PeriodicalId":103274,"journal":{"name":"2009 International Conference on Computer and Communications Security","volume":"178 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Vehicle Routing Problem with Weight Coefficients and Stochastic Demands Based on the Cross-Entropy Method\",\"authors\":\"Yue Qiu\",\"doi\":\"10.1109/ICCCS.2009.20\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The cross-entropy (CE) method is a new generic approach to combinatorial and multi-extremal optimization and rare event simulation. Vehicle Routing Problem has been approved a NP problem and it belongs to classical Combination Optimization hard problem. An effective algorithm based on cross-entropy is designed to solve the model which named Vehicle Routing Problem with Weight Coefficients and Stochastic Demands (WVRPSD) with weight coefficients and stochastic demands. Numerical experiments have been conducted and the results indicate that the method can effectively solve this problem.\",\"PeriodicalId\":103274,\"journal\":{\"name\":\"2009 International Conference on Computer and Communications Security\",\"volume\":\"178 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Computer and Communications Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCS.2009.20\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Computer and Communications Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCS.2009.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Vehicle Routing Problem with Weight Coefficients and Stochastic Demands Based on the Cross-Entropy Method
The cross-entropy (CE) method is a new generic approach to combinatorial and multi-extremal optimization and rare event simulation. Vehicle Routing Problem has been approved a NP problem and it belongs to classical Combination Optimization hard problem. An effective algorithm based on cross-entropy is designed to solve the model which named Vehicle Routing Problem with Weight Coefficients and Stochastic Demands (WVRPSD) with weight coefficients and stochastic demands. Numerical experiments have been conducted and the results indicate that the method can effectively solve this problem.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
