Parallel iterative solution-based tabu search for the obnoxious p-median problem

Chang, Jian; Wang, Lifang; Hao, Jin‐Kao; Wang, Yang

doi:10.1016/j.cor.2020.105155

Cited by 17 publications

(11 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, it is worth mentioning that the solution-based tabu search approach has led to highly effective algorithms for several NP-hard binary problems such as 0-1 multidimensional knapsack [29], multidemand multidimensional knapsack [30], minimum differential dispersion [31] and maximum min-sum dispersion [32] and obnoxious p-median [33]. Our study of using solutionbased tabu search for SUKP further confirms the usefulness of this approach for binary optimization.…”

Section: Computational Complexity and Discussionsupporting

confidence: 68%

“…The tabu search technology [23] has been successfully applied to solve many difficult optimization problems. Although most studies rely on the popular and well-known attributed-based tabu search (ABTS) as exemplified by the studies of [21,22,24,25,26], recent studies indicated that the solution-based tabu search (SBTS) [27,28] is a highly competitive approach for solving several notoriously difficult binary optimization problems such as 0/1 multidimensional knapsack [29], multidemand multidimensional knapsack [30], minimum differential dispersion [31], and maximum min-sum dispersion [32] and obnoxious p-median [33]. Compared to the ABTS method, SBTS has the advantage of avoiding the use of tabu tenure and simplifying the determination of tabu status.…”

Section: Introductionmentioning

confidence: 99%

“…However, SBTS requires more resources (to record all the encountered solutions) than ABTS. More information on the SBTS approach can be found in recent studies such as [30,31,32,33], while some interesting studies using ABTS are provided in [25,24,34,35,26]. The main contributions of this work are summarized as follows.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Multistart solution-based tabu search for the Set-Union Knapsack Problem

Wei

Hao

2021

Applied Soft Computing

View full text Add to dashboard Cite

Section: Computational Complexity and Discussionsupporting

confidence: 68%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Multistart solution-based tabu search for the Set-Union Knapsack Problem

Wei

Hao

2021

Applied Soft Computing

View full text Add to dashboard Cite

“…Chang and Wanga et al [9] solved OpM problem with a parallel iterative solution-based tabu search, where the tabu , where j 1 , j 2 ∈ S × S ⊆ J search was used to prevent cycling and stagnation of solutions.…”

Section: Introductionmentioning

confidence: 99%

Effect of Drop and Rebuilt Operator for Solving the Biobjective Obnoxious p-algorithm for dealing with a special case related to p-Median Problem

2023

IJML

View full text Add to dashboard Cite

In this paper, we solve the bi-objective obnoxious with a population-based method. The designed algorithm first determines a starting archive set by applying an iterative search on the equivalent problem, where an aggregate function is considered. Second, an adaptation of the dominating local search, combined with exchange operators, is considered for generating a series of new non-dominated solutions that enrich the reference archive set. Third, a drop and rebuild strategy is incorporated to the algorithm for iteratively highlighting the final Pareto front. An experimental part is given, where the performance of the method is evaluated on a set of benchmark instances of the literature. Its provided results are compared to those achieved by the more recent methods available in the literature. Encouraging results are reached.

show abstract

“…Examples of such facilities include garbage collection points in residential areas and the positioning of airports (obnoxious due to their air and sound pollution). Another example, by Chang et al (2021), is the location of quarantine sites during pandemics. These sites should be far from residential areas to reduce the chance of infections.…”

Section: Introductionmentioning

confidence: 99%

An iterated greedy algorithm with variable reconstruction size for the obnoxious p‐median problem

Mousavi,

Bhambar,

England

2023

Int Trans Operational Res

View full text Add to dashboard Cite

The obnoxious p‐median problem is a facility location problem where we maximise the sum of the distances between each client point and its nearest facility. Since it is nondeterministic polynomial‐time (NP)‐hard, most algorithms designed for the problem follow metaheuristic strategies to find high‐quality solutions in affordable time but with no optimality guarantee. In this paper, a variant of the iterated greedy algorithm is developed for the problem. It adopts the idea of increasing the search radius used in variable neighbourhood search by increasing the number of reconstructed components at each iteration with no improved solution, where the amount of the increase is determined dynamically based on the quality of the current solution. We demonstrate that the new algorithm significantly outperforms the current state‐of‐the‐art metaheuristic algorithms for this problem on standard datasets.

show abstract

Parallel iterative solution-based tabu search for the obnoxious p-median problem

Cited by 17 publications

References 20 publications

Multistart solution-based tabu search for the Set-Union Knapsack Problem

Multistart solution-based tabu search for the Set-Union Knapsack Problem

Effect of Drop and Rebuilt Operator for Solving the Biobjective Obnoxious p-algorithm for dealing with a special case related to p-Median Problem

An iterated greedy algorithm with variable reconstruction size for the obnoxious p‐median problem

Contact Info

Product

Resources

About