The OA-based swap method for the p-median problem

Authors:
Lin-Yu Tseng;Chih-Sheng Wu
Affiliations:
National Chung Hsing University, Institute of Networking and Multimedia, National Chung Hsing University, Department of Computer Science and Engineering, Taichung, Taiwan;National Chung Hsing University, Department of Computer Science and Engineering, Taichung, Taiwan
Venue:
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Year:
2009

Citing 7
Cited 0

The demand partitioning method for reducing aggregation errors in p-median problems

Computers and Operations Research - Special issue on aggregation and disaggregation in operations research
Variable Neighborhood Decomposition Search

Journal of Heuristics
Parallelization of the scatter search for the p-median problem

Parallel Computing - Special issue: Parallel computing in logistics
Algorithms of Ant System and Simulated Annealing for the p-median Problem

Automation and Remote Control
A Hybrid Heuristic for the p-Median Problem

Journal of Heuristics
Graph theory: An algorithmic approach (Computer science and applied mathematics)

Graph theory: An algorithmic approach (Computer science and applied mathematics)
Design and Analysis of Experiments

Design and Analysis of Experiments

Quantified Score

Hi-index	0.00

Visualization

Abstract

The location problems are important problems in the business world and have been widely studied. The p-median problem is one of the location problems. In this study, we propose an orthogonal array based swap method to solve the p-median problem. A local search method called the OA-interchange is designed. It utilizes the OA array and the Taguchi method to generate a set of solutions, and among this set of solutions, it finds the best one. The proposed OA-based swap method consists of iterative applications of the OA-interchange. Moreover, the proposed method has a scheme to control the strength of diversification and the strength of intensification. Testing of the OA-based swap method on the OR-Library and the fl1400 benchmarks reveals that the proposed method is competitive with other state-of-the-art methods reported in the literature.