Results 11  20
of
29
2000): Progress in solving the Nugent instances of the quadratic assignment problem. Working
"... ..."
Parallel Branch and Bound Algorithms on Internet Connected Workstations
 High Performance Computing and Communcations
, 2005
"... Abstract. By the use of the GRIBB software for distributed computing across the Internet, we are investigating the obstacles and the potential for efficient parallelization of Branch and Bound algorithms. Experiments have been carried out using two different applications, i.e. the Quadratic Assignme ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. By the use of the GRIBB software for distributed computing across the Internet, we are investigating the obstacles and the potential for efficient parallelization of Branch and Bound algorithms. Experiments have been carried out using two different applications, i.e. the Quadratic Assignment Problem (QAP) and the Traveling Salesman Problem (TSP). The results confirm the potential of the approach, and underline the requirements of the problem, algorithm and architecture for the approach to be successful. 1
Digital Object Identifier Recent advances in the solution of quadratic assignment problems
, 2003
"... Abstract. The quadratic assignment problem (QAP) is notoriously difficult for exact solution methods. In the past few years a number of longopen QAPs, including those posed by ..."
Abstract
 Add to MetaCart
Abstract. The quadratic assignment problem (QAP) is notoriously difficult for exact solution methods. In the past few years a number of longopen QAPs, including those posed by
Solving Quadratic Assignment Problem (QAP) Using Invasive Weed Optimization Algorithm
"... Abstract A new powerful optimization algorithm inspired from colonizing weeds is utilized to solve the wellknown quadratic assignment problem (QAP) which is of application in a large number of practical areas such as plant layout, machinery layout and so on. A set of reference numerical problems f ..."
Abstract
 Add to MetaCart
Abstract A new powerful optimization algorithm inspired from colonizing weeds is utilized to solve the wellknown quadratic assignment problem (QAP) which is of application in a large number of practical areas such as plant layout, machinery layout and so on. A set of reference numerical problems from QAPLIB is taken in order to evaluate the efficiency of the algorithm compared with the previous ones which had been applied to solve the addressed problem. The results indicate that the algorithm outperforms the competitive ones for a sizable number of the problems as the problems' dimensions increase.
Solving the Multiobjective Quadratic Assignment Problem Using a fast messy Genetic Algorithm
"... Abstract The multiobjective quadratic assignment problem is an NPcomplete problem with a multitude of realworld applications. The specific application addressed in this paper is the minimization of communication flows in a heterogenous mix of unmanned aerial vehicles. Developed is a multiobject ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract The multiobjective quadratic assignment problem is an NPcomplete problem with a multitude of realworld applications. The specific application addressed in this paper is the minimization of communication flows in a heterogenous mix of unmanned aerial vehicles. Developed is a multiobjective approach to solving the general mQAP for this UAV application. The combinatoric nature of this problem calls for a stochastic search algorithm; moreover, the MultiObjective fast messy Genetic Algorithm (MOMGAII) [22] is used for experimentation. Results indicate that much of the Pareto optimal points are found. 1
Hybrid ARQ Symbol Mapping in Digital Wireless Communication Systems Based on the Quadratic 3dimensional Assignment Problem (Q3AP)
"... Abstract: We report on the development of algorithms ..."
Solving Large Quadratic Assignment Problems on Computational Grids
"... The quadratic assignment problem (QAP) is among the hardest combinatorial optimization problems. Some instances of sizeÂ£Â¥ Â¤ 30 have remained unsolved for decades. The solution of these problems requires both improvements in mathematical programming algorithms and the utilization of powerful compu ..."
Abstract
 Add to MetaCart
(Show Context)
The quadratic assignment problem (QAP) is among the hardest combinatorial optimization problems. Some instances of sizeÂ£Â¥ Â¤ 30 have remained unsolved for decades. The solution of these problems requires both improvements in mathematical programming algorithms and the utilization of powerful computational platforms. In this article we describe a novel approach to solve QAPs using a stateoftheart branchandbound algorithm running on a federation of geographically distributed resources known as a computational grid. Solution of QAPs of unprecedented complexity, including the nug30, kra30b, and tho30 instances, is reported.
Solving Quadratic Assignment Problem on Cluster with a Bound of Reformulation Linearization Techniques
"... Abstract In this paper ¤, we propose an parallel branchandbound algorithm for the quadratic assignment problem based upon an efficient lower bound calculation developed by Hahn and Grant. The sequential version is very easy to achieve with the Bob++ library and the results are very encouraging. Fo ..."
Abstract
 Add to MetaCart
Abstract In this paper ¤, we propose an parallel branchandbound algorithm for the quadratic assignment problem based upon an efficient lower bound calculation developed by Hahn and Grant. The sequential version is very easy to achieve with the Bob++ library and the results are very encouraging. For the parallel implementation of our algorithm, we ported our Bob++ library to the high level grid programming and runtime environment Athapascan. The performances obtaining with this algorithm running on one cluster for some instances of qap ¨ (size 25) are competitive.