OVRPSTW and Its Improved Genetic Algorithm

摘要：

Open vehicle routing problems with soft time windows (OVRPSTW) is a kind of basic open vehicle routing problem with time windows. In this paper, the model of the question is built. An improved genetic algorithm(IGA) is designed to solve the question. Benchmarks C and C2 are tested, and the results of the question obtained by IGA show that the model is right and the IGA is highly efficient in computational performance.

关键词： Open Vehicle Routing Problem Soft Time Windows , IGA

作者: Duan Fenghua

作者单位: School ofbussiness,Hunan University of Science and Technology, P. R. China,411201

会议类型: 国际会议

会议名称: 2010 Third International Symposium on Intelligent Ubiquitous and Education(2010年第三届智能普适计算与教育国际研讨会 IUCE 2010)

会议地点: 北京

会议语种:英文

页码: 496-499

在线出版日期: 2010-09-18（万方平台首次上网日期，不代表论文的发表时间）