[1]彭 扬,陈子侠,吴承键.定位－运输路线安排问题的改进离散粒子群优化算法[J].智能系统学报,2010,5(1):74-79.
PENG Yang,CHEN Zi-xia,WU Cheng-jian.Improved discrete particle swarm optimization algorithm for locationrouting problems[J].CAAI Transactions on Intelligent Systems,2010,5(1):74-79.
点击复制
PENG Yang,CHEN Zi-xia,WU Cheng-jian.Improved discrete particle swarm optimization algorithm for locationrouting problems[J].CAAI Transactions on Intelligent Systems,2010,5(1):74-79.
定位－运输路线安排问题的改进离散粒子群优化算法
《智能系统学报》[ISSN 1673-4785/CN 23-1538/TP] 卷:
5
期数:
2010年第1期
页码:
74-79
栏目:
学术论文—智能系统
出版日期:
2010-02-25
- Title:
- Improved discrete particle swarm optimization algorithm for locationrouting problems
- 文章编号:
- 1673-4785(2010)01-0074-06
- 关键词:
- 定位－运输路线安排问题; 离散粒子群优化; 变异算子; 进化算法
- Keywords:
- location routing problem; discrete particle swarm optimization; mutation operator; evolution algorithm
- 分类号:
- TP301
- 文献标志码:
- A
- 摘要:
- 定位－运输路线安排问题(LRP)是集成物流中的一个NPhard难题，为求解一类特殊的LRP问题，提出改进的离散粒子群优化算法.该方法采用整体优化的思想，将LAP和VRP集成在一起.通过合适的粒子编码方式，并改进粒子的运动方程，引入相应的变异算子和趋同扰动算子等，使得算法的适用性和性能获得了改善.通过仿真实验及与另2个典型算法的比较分析，证明了该算法的有效性.
- Abstract:
- The locationrouting problem (LRP) is an NPhard problem in integrated logistics systems. An improved discrete particle swarm optimization (PSO) algorithm was developed to tackle a special kind of LRP. It adopted the principle of whole optimization, integrating the locationallocation problem (LAP) with a vehicle routing problem (VRP). First, a novel code for the particle was introduced. Next, the particle’s motion equation was improved, and the mutation operator and the disturbing operator against the population identical tendency were proposed, which improved the applicability and performance of the algorithm. A comparison of simulation results with those from two other typical algorithms showed the effectiveness of the proposed method.
- 参考文献/References:
-
［1］NAGY G, SALSHI S. Locationrouting: issues, models and methods［J］. European Journal of Operational Research, 2007, 177: 649672.
［2］MIN H, JAYARAMAN V, SRIVASTAVA R. Combined locationrouting problem: a synthesis and future research directions［J］. European Journal of Operational Research, 1998, 108: 115.
［3］TUZUN D, LAURA I. A twophase tabu search approach to the location routing problem［J］. European Journal of Operational Research, 1999， 116: 8799.
［4］LIU S C, LEE S B. A twophase heuristic method for the mutifacility location routing problem taking inventory control decisions into consideration［J］. The International Journal of Advanced Manufacturing Technology, 2003, 22: 941950.
［5］WU Taihis, LOW Chinyao, BAI Jiunnwei. Heuristic solution to multifacility locationrouting problems［J］. Computers & Operations Research, 2002, 29: 13931415.
［6］张 潜,高立群,刘雪梅，等.定位－运输路线安排问题的两阶段启发式算法［J］. 控制与决策，2004, 19(7): 773777.
ZHANG Qian, GAO Liqun, LIU Xuemei,et al. A twophase heuristic approach to the location routing problem［J］. Control and Decision, 2004, 19(7): 773777.
［7］张长星,党延忠.定位－运输路线安排问题的遗传算法研究［J］. 计算机工程与应用， 2004, 12: 6568.
ZHANG Changxing, DANG Yanzhong. A novel genetic algorithm for locationrouting problem［J］. Computer Engineering and Application, 2004, 12: 6568.
［8］KENNEDY J, EBERHART R C. Particle swarm optimization［C］//Proceedings of the IEEE International Conference on Neural Networks. Piscataway, USA, 1995: 19421948.
［9］KENNEDY J, EBERHART R C. A discrete binary version of the particle swarm algorithm［C］//Proceedings of the World Multiconference on Systemics, Cybernetics, and Informatics. Piscataway, USA, 1997: 41044109.
［10］ SALMAN A, AHMAD I, ALMADANI S. Particle swa rm optimization for task assignment problem［J］. Microprocessors and Microsystems, 2002, 26 (8): 363371.
［11】TASGETIRE M F, SEVKLI M, LIANG Y C,et al. Particle swarm optimization algorithm for permutation flowshop sequencing problem［C］//Proceedings of the 2004 Congress on Evolutionary Computation. Portland, USA, 2004: 536541.
［12］李 宁，邹 彤，孙德宝.带时间窗车辆路径问题的粒子群算法［J］. 系统工程理论与实践， 2004, 4: 130135.
LI Ning, ZOU Tong, SUN Debao. Particle swarm optimization for vehicle routing problem with time windows［J］. Systems EngineeringTheory & Practice, 2004, 4: 130135.
［13］钟一文,杨建刚，宁正元. 求解TSP问题的离散粒子群优化算法［J］. 系统工程理论与实践， 2006, 6: 8894.
ZHONG Yiwen, YANG Jiangang, NING Zhengyuan. Discrete particle swarm optimization algorithm for TSP problem［J］. Systems EngineeringTheory & Practice, 2006, 6: 8894.
［14］高 尚,韩 斌,吴小俊,等. 求解旅行商问题的混合粒子群优化算法［J］. 控制与决策, 2004, 19(11): 12861289.
GAO Shang, HAN Bin, WU Xiaojun, et al. Solving traveling salesman problem by hybrid particle swarm optimization algorithm［J］. Control and Decision, 2004, 19(11): 12861289.
备注/Memo
收稿日期：2008-06-30.
基金项目：
国家自然科学基金资助项目（70671096）；
浙江省科技计划重点资助项目（2007C23090）.
通信作者：彭 扬.E-mail: pengyang@mail.zjgsu.edu.cn.
作者简介：
彭 扬，男，1971年生，副教授、博士，主要研究方向为物流系统优化、计算智能等.主持和参与国家及省部级科研项目10余项，发表学术论文20余篇，其中被EI、ISTP检索9篇.
陈子侠，男，1962 年生，教授，浙江工商大学计算机与信息工程学院副院长，浙江工商大学现代物流研究所所长，中国物流学会常务理事.主要研究方向为物流系统工程、信息管理与信息系统等.主持或主要参与省部级纵向研究课题3项，承担中国第一汽车集团公司等企业横向研究项目20余项.曾获中国物流与采购科技进步二等奖、中国商业科学技术进步二等奖、浙江省第十二届哲学社会科学优秀成果奖三等奖、中国汽车工业科技进步奖、中国物流学会年会论文二等奖、杭州市自然科学优秀论文二等奖等.发表学术论文40余篇，出版专著、编著5部.
吴承键，男，1957年生，教授、博士，主要研究方向为物流与供应链管理、地理信息系统等.曾参加和主持多项省部级重点科研项目，获得省部级奖项6次.发表学术论文20余篇，其中被SCI、EI检索5篇，出版专著、编著3部.
更新日期/Last Update:
2010-03-31