Multiple Trajectory Search for Uncapacitated Facility Location Problems

Author

Tseng, Lin-yu ; Wu, Chih-Sheng

Author_Institution

Dept. of Comput. Sci. & Eng., Nat. Chung Hsing Univ., Taichung, Taiwan

Volume

2

fYear

2009

fDate

24-26 April 2009

Firstpage

965

Lastpage

968

Abstract

In this study, a novel metaheuristic called the multiple trajectory search (MTS) is proposed to solve the uncapacitated facility location problem (UFLP). The multiple trajectory search hybridizes a global search method (the Trajectory_Search) and a local search method (the Variable_Neighborhood_Search). The application of the multiple trajectory search to the benchmarks ORLIB and GHOSH had been conducted. The performance comparison with other state-of-the-art methods reveals that the proposed method is very competitive.

Keywords

facility location; search problems; global search method; local search method; metaheuristic; multiple trajectory search; uncapacitated facility location problem; variable neighborhood search; Approximation algorithms; Computer networks; Computer science; Costs; Customer service; Genetic algorithms; Heuristic algorithms; NP-hard problem; Search methods; Sun; metaheuristic; multiple trajectory search; uncapacitated facility location problem;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Sciences and Optimization, 2009. CSO 2009. International Joint Conference on

Conference_Location

Sanya, Hainan

Print_ISBN

978-0-7695-3605-7

Type

conf

DOI

10.1109/CSO.2009.340

Filename

5194103