Title :
Flow Capturing Location-allocation Problem with Piecewise Linear Value-Time Function Based on Max-min Ant Colony Optimization
Author :
Jun, Yang ; Min, Zhang
Author_Institution :
Sch. of Manage., Huazhong Univ. of Sci. & Technol., Wuhan
Abstract :
Flow capturing location-allocation problems are widely studied in the area of location theory, where they involve locating the facilities and assigning OD flows. For some commodity flows, unit value of flows changes with travel time. In this paper, we proposed flow capturing location-allocation problem with piecewise linear value-time function. A mixed integer planning model is formulated and transferred to capacitated fixed charged facility location problem with auxiliary network. Max-min ant colony optimization algorithm is developed to solve this problem. A computational study based on several random instances was carried out to test the performance of max-min ant algorithm
Keywords :
minimax techniques; piecewise linear techniques; auxiliary network; fixed charged facility location problem; flow capturing location-allocation problem; location theory; max-min ant colony optimization; mixed integer planning model; piecewise linear value-time function; Agricultural products; Ant colony optimization; Consumer electronics; Fluctuations; Heuristic algorithms; Information management; NP-hard problem; Piecewise linear techniques; Technology management; Testing;
Conference_Titel :
Computational Intelligence and Security, 2006 International Conference on
Conference_Location :
Guangzhou
Print_ISBN :
1-4244-0605-6
Electronic_ISBN :
1-4244-0605-6
DOI :
10.1109/ICCIAS.2006.295449
