Abstract
In this paper, the Bi-level programming model with random prize is presented to solve the industrial location problem. In terms of the binary coding, and controlling the location numbers on the operation of neighborhood, three kinds of neighbor domain are proposed by introducing the taboo search algorithm. In order to improve the taboo search algorithm for the efficiency and effectiveness of the addressed algorithm, the research utilizes a penalty function to deal with the constraints of the total amount of investment as well as introducing the principal of the model and TS. The representative example is used to illustrate the correctness of the optimal algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The full name of all s. t. in the paper are subject to.
References
William, G.T.: Timing market entry with a contribution-maximization approach to location-allocation decisions. Eur. J. Oper. Res. 4(2), 95–106(1980)
HodgBon, J.: A flow-capturing location allocation model. Geogr. Anal. 22(3), 270–279 (1990)
Willoughby, K.A., Uyeno, D.H.: Resolving splits in location/allocation modeling: a heuristic procedure for transit center decisions. Transport. Res. E. Logist. Transport. Rev. 37(1), 71–83 (2001)
Hsieh, K.H., Tien, F.C.: Self-organizing feature maps for solving location-allocation problems with rectilinear distances. Comput. Oper. Res. 31(7), 1017–1031 (2004)
Zhou, J., Liu, B.D.: New stochastic models for capacitated location-allocation. Comput. Eng. 45(1), 111–125 (2003)
Louwers, D., Kip, B.J.: A facility location allocation model for reusing carpet materials. Comput. Ind. Eng. 36(4), 855–869 (1999)
Niu, H-m: Class of traffic optimization model with stochastic parameters and genetic algorithm. J. Syst. Eng. 17(2), 103–108 (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this paper
Cite this paper
Qu, Y., Jiang, Zp. (2013). Bi-Level Programming Model and Taboo Search Algorithm in Industrial Location Under the Condition of Random Price. In: Wong, W.E., Ma, T. (eds) Emerging Technologies for Information Systems, Computing, and Management. Lecture Notes in Electrical Engineering, vol 236. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7010-6_45
Download citation
DOI: https://doi.org/10.1007/978-1-4614-7010-6_45
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-7009-0
Online ISBN: 978-1-4614-7010-6
eBook Packages: EngineeringEngineering (R0)