Monkey Algorithm for Solving Logistics Center Location Selection Problem

Authors

Xiaoping Xu, School of Sciences, Xi'an University of Technology, Xi'an 710054, China;
Dongjie Zhang, School of Sciences, Xi'an University of Technology, Xi'an 710054, China;

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.

Recommended Citation

Xu, Xiaoping and Zhang, Dongjie (2018) "Monkey Algorithm for Solving Logistics Center Location Selection Problem," Journal of System Simulation: Vol. 30: Iss. 6, Article 34.
DOI: 10.16182/j.issn1004731x.joss.201806034
Available at: https://dc-china-simulation.researchcommons.org/journal/vol30/iss6/34

First Page

2272

Revised Date

2017-05-10

DOI Link

https://doi.org/10.16182/j.issn1004731x.joss.201806034

Last Page

2278

CLC

TP273+.4A

Recommended Citation

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

DOI

10.16182/j.issn1004731x.joss.201806034