Hybrid Genetic Algorithm for Solving the p-Median Problem

A GIS-Based Optimization Framework for Competitive Multi-Facility Location-Routing Problem

“…Several studies (Hosage and Goodchild 1986;Bianchi and Church 1993;Dibble and Densham 1993;Church and Sorensen 1996;Bozkaya et al 2002;Estivill-Castro and Torres-Velazquez 1999;Jaramillo et al 2002;Xiao et al 2002;Xiao 2006) have attempted to solve variants of p-median, p-center, and other related problems. A recent survey by Xiao et al (2007) provides a thorough review of these studies from the viewpoint of multi-objective decision making.…”

Robust Distance-Based Clustering with Applications to Spatial Data Mining

“…For finding high quality approximate solutions, hill-climbing variations of an interchange heuristic [18,38,58,84] are considered very effective [29,59,62]. Other alternatives have been also explored: tabu search [73], genetic algorithms [45,7,8,31,32], and simulated annealing [58]. The trade-off of effort versus quality tends to favor hill-climbers over these methods.…”

Automatic Domain Decomposition in Finite Element Method – A Comparative Study

“…Gradually, by combining graph theory concepts such as k-median and p-median of a graph with the domain decomposition problem, the Artificial Intelligent (AI) approaches such as meta-heuristic algorithms are employed to optimize it. Kaveh et al [13][14][15][16], Beitollahi et al [17], Christofides and Beasley [18], Osman and Christofides [19], Kariv and Hakimi [20], and Estivill-Castro and Torres-Velázquez [21] are some of the scientists that utilized AI approaches as well as graph theory concepts in this manner.…”