摘要
将客户满意度作为优化目标引入开放式车辆路径问题。使用梯形模糊数表示客户满意度,建立基于客户满意度的开放式车辆路径问题的数学模型。将改进的最邻近插入法和最廉价插入法作为后优化过程与粒子群优化算法结合求解该问题。分析2种混合算法的计算复杂度,通过实验仿真对算法进行分析比较。
The mathematical model of Open Vehicle Routing Problem（OVRP） based on satisfaction of customers is founded according to setting virtual delivery center. The hybrid Particle Swarm Optimization（PSO） algorithm is presented for the problem. The improvement nearest neighbor algorithm and cheapest insertion algorithm are combined with PSO as the post-optimization-procedure. The hybrid algorithms＇ complexities are analyzed. These algorithms are analyzed and compared through experiments.
出处
《计算机工程》
CAS
CSCD
北大核心
2009年第17期193-194,197,共3页
Computer Engineering
关键词
客户满意度
开放式车辆路径问题
粒子群优化算法
satisfaction of customers
Open Vehicle Routing Problem（OVRP）
Particle Swarm Optimization（PSO） algorithm
