Bi-level programming model and taboo search algorithm in industrial location under the condition of random price

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. © 2013 Springer Science+Business Media New York.