[1]PENG Yang,CHEN Zi-xia,WU Cheng-jian.Improved discrete particle swarm optimization algorithm for locationrouting problems[J].CAAI Transactions on Intelligent Systems,2010,5(1):74-79.
Copy

Improved discrete particle swarm optimization algorithm for locationrouting problems

CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume: 5 Number of periods: 2010 1 Page number: 74-79 Column: 学术论文—智能系统 Public date: 2010-02-25
Title:
Improved discrete particle swarm optimization algorithm for locationrouting problems
Author(s):
PENG Yang;  CHEN Zi-xia;  WU Cheng-jian
College of Computer Science & Information Engineering, Zhejiang Gongshang University, Hangzhou 310018, China
Keywords:
location routing problem;  discrete particle swarm optimization;  mutation operator;  evolution algorithm
CLC:
TP301
DOI:
-
Abstract:
The locationrouting problem (LRP) is an NPhard 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 locationallocation 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. Locationrouting: issues, models and methods［J］. European Journal of Operational Research, 2007, 177: 649672.
［2］MIN H, JAYARAMAN V, SRIVASTAVA R. Combined locationrouting problem: a synthesis and future research directions［J］. European Journal of Operational Research, 1998, 108: 115.
［3］TUZUN D, LAURA I. A twophase tabu search approach to the location routing problem［J］. European Journal of Operational Research, 1999， 116: 8799.
［4］LIU S C, LEE S B. A twophase heuristic method for the mutifacility location routing problem taking inventory control decisions into consideration［J］. The International Journal of Advanced Manufacturing Technology, 2003, 22: 941950.
［5］WU Taihis, LOW Chinyao, BAI Jiunnwei. Heuristic solution to multifacility locationrouting problems［J］. Computers & Operations Research, 2002, 29: 13931415.
［6］张 潜,高立群,刘雪梅，等.定位－运输路线安排问题的两阶段启发式算法［J］. 控制与决策，2004, 19(7): 773777.
ZHANG Qian, GAO Liqun, LIU Xuemei,et al. A twophase heuristic approach to the location routing problem［J］. Control and Decision, 2004, 19(7): 773777.
［7］张长星,党延忠.定位－运输路线安排问题的遗传算法研究［J］. 计算机工程与应用， 2004, 12: 6568.
 ZHANG Changxing, DANG Yanzhong. A novel genetic algorithm for locationrouting problem［J］. Computer Engineering and Application, 2004, 12: 6568.
［8］KENNEDY J, EBERHART R C. Particle swarm optimization［C］//Proceedings of the IEEE International Conference on Neural Networks. Piscataway, USA, 1995: 19421948.
［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: 41044109.
［10］ SALMAN A, AHMAD I, ALMADANI S. Particle swa rm optimization for task assignment problem［J］. Microprocessors and Microsystems, 2002, 26 (8): 363371.
［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: 536541.
［12］李 宁，邹 彤，孙德宝.带时间窗车辆路径问题的粒子群算法［J］. 系统工程理论与实践， 2004, 4: 130135.
 LI Ning, ZOU Tong, SUN Debao. Particle swarm optimization for vehicle routing problem with time windows［J］. Systems EngineeringTheory & Practice, 2004, 4: 130135.
［13］钟一文,杨建刚，宁正元. 求解TSP问题的离散粒子群优化算法［J］. 系统工程理论与实践， 2006, 6: 8894.
ZHONG Yiwen, YANG Jiangang, NING Zhengyuan. Discrete particle swarm optimization algorithm for TSP problem［J］. Systems EngineeringTheory & Practice, 2006, 6: 8894.
［14］高 尚,韩 斌,吴小俊,等. 求解旅行商问题的混合粒子群优化算法［J］. 控制与决策, 2004, 19(11): 12861289.
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): 12861289.
Similar References:

Memo

-

Last Update: 2010-03-31

Copyright © CAAI Transactions on Intelligent Systems