The bipartite quadratic assignment problem and extensions

Punnen, Abraham P.; Wang, Yan

doi:10.1016/j.ejor.2015.10.006

Cited by 10 publications

(8 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Let us now analyze some heuristics for BQAP1 and BQAP2 from the domination analysis [2,6,12,26,28] point of view. First, we consider two local search heuristics that performed very well in experimental analysis [21].…”

Section: Domination Analysis Of Heuristicsmentioning

confidence: 99%

Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis

Ćustić¹,

Punnen²

2015

Preprint

Self Cite

View full text Add to dashboard Cite

In this paper we study the complexity and domination analysis in the context of the bipartite quadratic assignment problem. Two variants of the problem, denoted by BQAP1 and BQAP2, are investigated. A formula for calculating the average objective function value A of all solutions is presented whereas computing the median objective function value is shown to be NP-hard. We show that any heuristic algorithm that produces a solution with objective function value at most A has the domination ratio at least 1 mn . Analogous results for the standard quadratic assignment problem is an open question. We show that computing a solution whose objective function value is no worse than that of, is NP-hard for any fixed natural numbers a and b such that α = a b > 1. However, a solution with the domination number Ω(m n−1 n m−1 +m n+1 n+mn m+1 ) for BQAP1 and Ω(m m−1 n n−1 + m 2 n n + m m n 2 ) for BQAP2, can be found in O(m 3 n 3 ) time.

show abstract

Section: Domination Analysis Of Heuristicsmentioning

confidence: 99%

Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis

Ćustić¹,

Punnen²

2015

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…BQAP1 and BQAP2 are known to be strongly NP-hard [21]. To the best of our knowledge, theoretical properties of these problems are not investigated thoroughly in the literature.…”

Section: Introductionmentioning

confidence: 98%

“…Experimental analysis of the local search approaches for BQAP1 based on the three neighborhoods described above is presented in [21]. Our goal here is to analyze the local search optimal solution quality in terms of domination and compared to the average solution value.…”

Section: Swap Based Neighborhoodsmentioning

confidence: 99%

“…First, we consider two local search heuristics that performed very well in experimental analysis [21].…”

Section: Domination Analysis Of Heuristicsmentioning

confidence: 99%

“…The problems BQAP1 and BQAP2 were studied by Punnen and Wang in [21] where they proposed efficient heuristic algorithms to solve these problems. They also reported extensive experimental results establishing the quality of their heuristic solutions.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis

usti

Punnen

2017

Operations Research Letters

Self Cite

View full text Add to dashboard Cite

show abstract

Metaheuristics for Solving Global and Engineering Optimization Problems: Review, Applications, Open Issues and Challenges

Houssein,

Saeed,

et al. 2024

Arch Computat Methods Eng

View full text Add to dashboard Cite

The greatest and fastest advances in the computing world today require researchers to develop new problem-solving techniques capable of providing an optimal global solution considering a set of aspects and restrictions. Due to the superiority of the metaheuristic Algorithms (MAs) in solving different classes of problems and providing promising results, MAs need to be studied. Numerous studies of MAs algorithms in different fields exist, but in this study, a comprehensive review of MAs, its nature, types, applications, and open issues are introduced in detail. Specifically, we introduce the metaheuristics' advantages over other techniques. To obtain an entire view about MAs, different classifications based on different aspects (i.e., inspiration source, number of search agents, the updating mechanisms followed by search agents in updating their positions, and the number of primary parameters of the algorithms) are presented in detail, along with the optimization problems including both structure and different types. The application area occupies a lot of research, so in this study, the most widely used applications of MAs are presented. Finally, a great effort of this research is directed to discuss the different open issues and challenges of MAs, which help upcoming researchers to know the future directions of this active field. Overall, this study helps existing researchers understand the basic information of the metaheuristic field in addition to directing newcomers to the active areas and problems that need to be addressed in the future.

show abstract

The bipartite quadratic assignment problem and extensions

Cited by 10 publications

References 37 publications

Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis

Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis

Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis

Metaheuristics for Solving Global and Engineering Optimization Problems: Review, Applications, Open Issues and Challenges

Contact Info

Product

Resources

About