{"title":"Stochastic Vehicle Routing Problem with Uncertain Demand and Travel Time and Simultaneous Pickups and Deliveries","authors":"Lingjuan Hou, Hong Zhou","doi":"10.1109/CSO.2010.38","DOIUrl":null,"url":null,"abstract":"Aiming at the stochastic vehicle routing problems with uncertain demand and travel time and with simultaneous pickups and deliveries, a stochastic programming model is formulated and an improved genetic algorithm is proposed for routes optimization. Self-adaptive mechanism is introduced for amending the fitness value to overcome the premature convergence effectively and to improve the efficiency of the algorithm. The performance of the algorithm is discussed under a variety of problem settings and parameters value by the numerical experiments and sensitivity analysis. Results demonstrate that not only the proposed algorithm obtains even better results, but also it has a good robustness.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Third International Joint Conference on Computational Science and Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSO.2010.38","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16
Abstract
Aiming at the stochastic vehicle routing problems with uncertain demand and travel time and with simultaneous pickups and deliveries, a stochastic programming model is formulated and an improved genetic algorithm is proposed for routes optimization. Self-adaptive mechanism is introduced for amending the fitness value to overcome the premature convergence effectively and to improve the efficiency of the algorithm. The performance of the algorithm is discussed under a variety of problem settings and parameters value by the numerical experiments and sensitivity analysis. Results demonstrate that not only the proposed algorithm obtains even better results, but also it has a good robustness.