Monkey Algorithm for Solving Logistics Center Location Selection Problem

doi:10.16182/j.issn1004731x.joss.201806034

Abstract

Abstract: The location selection of logistics center is the most basic problem that affects the whole development of logistics center; an improved monkey algorithm is used to solve the problem. The basic idea is that the chaos variables are used to generate the initial feasible solution of the monkey algorithm, the decreasing factor is taken as the climbing step in the climbing process and a chaotic search method is introduced in the looking process to improve the performance of the algorithm. Through simulation experiment, the solution results of typical function and logistics center location problem are given to illustrate the feasibility of the proposed method.

Key words: logistics center location, monkey algorithm, chaotic variables, descending factor, chaotic search method

CLC Number:

TP273+.4A

Xu Xiaoping, Zhang Dongjie. Monkey Algorithm for Solving Logistics Center Location Selection Problem[J]. Journal of System Simulation, 2018, 30(6): 2272-2278.

References

[1] Alfredo G, Díaz H.Cross Entropy for Multiobjective Optimization Problems with Linear Relaxations[J]. European Journal of Operational Research (S0377-2217), 2015, 243(2): 362-368.
[2] Francesco C, Giulio G, Shaban A.Multi-criteria Logistics Distribution Network Design for mass Customization[J]. International Journal of Applied Decision Sciences (S1755-8085), 2014, 7(2):151-167.
[3] Jayaram J, Avittathur B.Green Supply Chains: a Perspective from an Emerging Economy[J]. International Journal of Production Economics (S0925-5273), 2015, 1(164): 234-244.
[4] 贺媛媛, 赵秦, 栗惠英. 基于GIS与差分进化优化的应急物流配送中心选址[J]. 物流技术, 2013, 32(15): 139-140.
He Y Y, Zhao Q, Li H Y.Location of Emergency Logistics Distribution Centers Based on GIS and Differential Evolutionary Optimization[J]. Logistics SciTech, 2013, 32(15): 139-140.
[5] Hua X, Hu X, Yuan W.Research Optimization on Logistics Distribution Center Location based on Adaptive Particle Swarm Algorithm[J]. International Journal for Light and Electron Optics (S0030-4026), 2016, 127(20): 8443-8450.
[6] 胡大伟, 陈诚. 遗传算法(GA)和禁忌搜索算法(TS)在配送中心选址和路线问题中的应用[J]. 系统工程理论与实践, 2007, 27(9): 171-176.
Hu D W, Chen C.Application of GA and TS in Logistics Distribution Center Location and Routing Problem[J]. Systems Engineering Theory, 2007, 27(9): 171-176.
[7] Zhao R, Tang W.Monkey Algorithm for Global Numerical Optimization[J]. Journal of Uncertain Systems (S1752-8917), 2008, 2(3): 164-175.
[8] 赵涛, 夏雨, 宗玛利. 基于猴群算法的加气站项目进度研究[J]. 价值工程, 2010, 29(8): 90-92.
Zhao T, Xia Y, Zong M L.Optimization of Gas Filling Station Project Scheduling Problem Based on Monkey Algorithm[J]. Value Engineering, 2010, 29(8): 90-92.
[9] 张佳佳, 张亚平, 孙济洲. 基于猴群算法的入侵检测技术[J]. 计算机工程, 2011, 37(14): 131-133.
Zhang J J, Zhang Y P, Sun J Z.Intrusion Detection Technology Based on Monkey Algorithm[J]. Computer Engineering, 2011, 37(14): 131-133.
[10] Ituarte-Villarreal M, Lopez N, Espiritu F.Using the Monkey Algorithm for Hybrid Power Systems Optimization[J]. Procedia Computer Science (S1877-0509), 2012, 12: 344-349.
[11] 史振华, 陈暄. 云计算中一种改进的猴群算法在资源分配中研究[J]. 计算机测量与控制, 2015, 23(9): 3188-3191.
Shi Z H, Chen X.Research of an Improved Monkey Algorithm of Cloud Computing in Resource Allocation[J]. Computer Measurement and Control, 2015, 23(9): 3188-3191.
[12] 张婷婷. 有竞争的物流配送中心选址模型研究[J]. 物流科技, 2014, 37(11): 77-80.
Zhang T T.Study on Competitive Location Model of Logistics Distribution Center[J]. Logistics SciTech, 2014, 37(11): 77-80.
[13] 周刘喜, 张兴华, 李纬. 一种改进的多目标粒子群优化算法[J]. 计算机工程与应用, 2009, 45(33): 38-41. Zhou L X, Zhang X H, Li W. Improved Multi-objective Particle Swarm Optimization Algorithm[J]. Computer Engine ering and Applications, 2009, 45(33): 38-41.
[14] Yuan X, Dai X, Wu L.A Mutative-scale Pseudo- parallel Chaos Optimization Algorithm[J]. Soft Computing (S1432-7643), 2015, 19(5): 1215-1227.