| 基于偏好信息的多目标旅行商问题Pareto优化求解 |
| |
| 引用本文： | 李锋.基于偏好信息的多目标旅行商问题Pareto优化求解[J].系统工程学报,2011,26(5). |
| |
| 作者姓名： | 李锋 |
| |
| 作者单位： | 华南理工大学工商管理学院,广东广州,510640 |
| |
| 基金项目： | 华南理工大学中央高校基本科研业务费专项资金资助项目 |
| |
| 摘 要： | 多目标旅行商问题(MOTSP)是经典旅行商问题的扩展,其优化目标包含了距离、成本、收益及风险等多个相互冲突的指标.本文提出了一种基于偏好的Pareto演化算法p-PEA用于建模并求解此NP-hard问题.该优化算法建立在MOTSP的智能体仿真模型之上,从而解决了数学建模不能真实再现实际MOTSP中众多影响因素的问题.通过仿真的方法,算法能够得到MOTSP可行解的各项评价指标值.在此基础士,通过设计演化算法搜索问题的Pareto优化解集.其中,将决策者的决策偏好信息引入到Pareto优化解集的求解过程中,所得结果将更合理.最后,以一个130个城市的旅行商问题为例验证了算法的有效性.
|
| 关 键 词： | 多目标旅行商问题 Pareto优化 演化算法 基于智能体的建模 偏好 |
Preference-based Pareto optimization of multi-objective traveling salesman problems |
| |
| LI Feng.Preference-based Pareto optimization of multi-objective traveling salesman problems[J].Journal of Systems Engineering,2011,26(5). |
| |
| Authors: | LI Feng |
| |
| Institution: | LI Feng (School of Business Administration,South China University of Technology,Guangzhou 510640,China) |
| |
| Abstract: | The multi-objective traveling salesman problems(MOTSP) are a generalization of the well-known traveling salesman problem where multiple conflicting objectives include optimizing distance,cost,profit,risk of the tour,etc.This paper proposes a preference-based Pareto evolutionary algorithm,named p-PEA,to model and solve this NP-hard problem.The algorithm is built on framework of agent-based simulation model,where MOTSP is represented as an agent model.In this way,various factors of practical MOTSP are easier ... |
| |
| Keywords: | multi-object traveling salesman problem Pareto optimization evolutionary algorithm agentbased modeling preference |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
