Skip to main content

Cut Latifah

University of Sumatera Utara, Mathematic, Graduate Student

Followers

208

Following

142

Public Views

Panos M Pardalos

University of Florida

Graz University of Technology

Paulo Boaventura-Netto

Universidade Federal do Rio de Janeiro (UFRJ)

Güneş Erdoğan

University of Southampton

catherine roucairol

Université Versailles Saint-Quentin en Yvelines

University of Connecticut-storrs

University of South Africa

Paulo Boaventura Netto

Aston University

Interests

Uploads

Papers by Cut Latifah

QAP Introduction

Quadratic assignment problems (QAPs) belong to the most difficult combinatorial optimization prob... more Quadratic assignment problems (QAPs) belong to the most difficult combinatorial optimization problems. Because of their many real-world applications, many authors have investigated this problem class. For a monograph on QAPs, see the book by Çela [176]. A volume with selected papers on this topic was edited by Pardalos and Wolkowicz [536]. Some of the more recent surveys are Burkard [130], Pardalos, Rendl, and Wolkowicz [535], Burkard, Çela, Pardalos, and Pitsoulis [142], Rendl [574], and Loiola, Maia de Abreu, Boaventura-Netto, Hahn, and Querido [464]. The Quadratic Assignment Problem Library (QAPLIB), set up by Burkard, Karisch, and Rendl [151] and currently maintained by P. Hahn at http://www.seas.upenn.edu/qaplib/, contains not only many test examples with computational results, but also a detailed bibliography on this topic and a survey on the latest results.

DEVELOPING AN IMPROVED ALGORITHM FOR SOLVING QAP

A genetic approach to the quadratic assignment problem

Computers & Operations Research, Jan 1, 1995

The Quadratic Assignment Problem (QAP) is a well-known combinatorialoptimization problem with a w... more The Quadratic Assignment Problem (QAP) is a well-known combinatorialoptimization problem with a wide variety of practical applications. Although manyheuristics and semi-enumerative procedures for QAP have been proposed, no dominantalgorithm has emerged. In this paper, we describe a Genetic Algorithm (GA) approachto QAP. Genetic algorithms are a class of randomized parallel search heuristics whichemulate biological natural selection on a population of

ACO algorithms for the quadratic assignment problem

Management Science, Jan 1, 1970

Tabu search applied to the quadratic assignment problem

Informs Journal on Computing, Jan 1, 1990

QAPLIB–a quadratic assignment problem library

European Journal of Operational Research, Jan 1, 1996

A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem

Quadratic Assignment and …, Jan 1, 1994

A greedy randomized adaptive search procedure (GRASP) is a randomized heuristic that has been sho... more A greedy randomized adaptive search procedure (GRASP) is a randomized heuristic that has been shown to quickly produce good quality solutions for a wide variety of combinatorial optimization problems. In this paper, we describe a GRASP for the quadratic assignment problem. We review basic concepts of GRASP: construction and local search algorithms. The implementation of GRASP for the quadratic assignment problem is described in detail. Computational experience on a large set of standard test problems (QAPLIB) is presented.

Optimal and suboptimal algorithms for the quadratic assignment problem

Journal of the society for industrial and applied …, Jan 1, 1962

Page 1. J. Soc. Indust. Appl. Math. Vol. 10, No. 2, June, 1962 Printed in USA OPTIMAL AND SUBOPTI... more

Ant colonies for the quadratic assignment problem

Future Generation Computer Systems, Jan 1, 2001

Ant Colonies optimization take inspiration from the behavior of real ant colonies to solve optimi... more Ant Colonies optimization take inspiration from the behavior of real ant colonies to solve optimization problems. This paper presents a parallel model for ant colonies to solve the quadratic assignment problem (QAP). The cooperation between simulated ants is provided by a pheromone matrix that plays the role of a global memory. The exploration of the search space is guided by the evolution of pheromones levels, while exploitation has been boosted by a tabu local search heuristic. Special care has also been taken in the design of a diversification phase, based on a frequency matrix. We give results that have been obtained on benchmarks from the QAP library. We show that they compare favorably with other algorithms dedicated for the QAP.

The quadratic assignment problem

European Journal of Operational Research, Jan 1, 1984

This paper aims at describing the state of the art on quadratic assignment problems (QAPs). It di... more This paper aims at describing the state of the art on quadratic assignment problems (QAPs). It discusses the most important developments in all aspects of the QAP such as linearizations, QAP polyhedra, algorithms to solve the problem to optimality, heuristics, polynomially solvable special cases, and asymptotic behavior. Moreover, it also considers problems related to the QAP, e.g. the biquadratic assignment problem, and discusses the relationship between the QAP and other well known combinatorial optimization problems, e.g. the traveling salesman problem, the graph partitioning problem, etc. The paper will appear in the Handbook of Combinatorial Optimization to be published by Kluwer Academic Publishers, P. Pardalos and D.-Z. Du, eds.

The ant system applied to the quadratic assignment problem

IEEE Transactions on Knowledge and Data Engineering, Jan 1, 1999

In recent years there has been growing interest in algorithms inspired by the observation of natu... more

Robust taboo search for the quadratic assignment problem

Parallel Computing, Jan 1, 1991

QAP Introduction

Quadratic assignment problems (QAPs) belong to the most difficult combinatorial optimization prob... more Quadratic assignment problems (QAPs) belong to the most difficult combinatorial optimization problems. Because of their many real-world applications, many authors have investigated this problem class. For a monograph on QAPs, see the book by Çela [176]. A volume with selected papers on this topic was edited by Pardalos and Wolkowicz [536]. Some of the more recent surveys are Burkard [130], Pardalos, Rendl, and Wolkowicz [535], Burkard, Çela, Pardalos, and Pitsoulis [142], Rendl [574], and Loiola, Maia de Abreu, Boaventura-Netto, Hahn, and Querido [464]. The Quadratic Assignment Problem Library (QAPLIB), set up by Burkard, Karisch, and Rendl [151] and currently maintained by P. Hahn at http://www.seas.upenn.edu/qaplib/, contains not only many test examples with computational results, but also a detailed bibliography on this topic and a survey on the latest results.

DEVELOPING AN IMPROVED ALGORITHM FOR SOLVING QAP

A genetic approach to the quadratic assignment problem

Computers & Operations Research, Jan 1, 1995

The Quadratic Assignment Problem (QAP) is a well-known combinatorialoptimization problem with a w... more The Quadratic Assignment Problem (QAP) is a well-known combinatorialoptimization problem with a wide variety of practical applications. Although manyheuristics and semi-enumerative procedures for QAP have been proposed, no dominantalgorithm has emerged. In this paper, we describe a Genetic Algorithm (GA) approachto QAP. Genetic algorithms are a class of randomized parallel search heuristics whichemulate biological natural selection on a population of

ACO algorithms for the quadratic assignment problem

Management Science, Jan 1, 1970

Tabu search applied to the quadratic assignment problem

Informs Journal on Computing, Jan 1, 1990

QAPLIB–a quadratic assignment problem library

European Journal of Operational Research, Jan 1, 1996

A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem

Quadratic Assignment and …, Jan 1, 1994

A greedy randomized adaptive search procedure (GRASP) is a randomized heuristic that has been sho... more A greedy randomized adaptive search procedure (GRASP) is a randomized heuristic that has been shown to quickly produce good quality solutions for a wide variety of combinatorial optimization problems. In this paper, we describe a GRASP for the quadratic assignment problem. We review basic concepts of GRASP: construction and local search algorithms. The implementation of GRASP for the quadratic assignment problem is described in detail. Computational experience on a large set of standard test problems (QAPLIB) is presented.

Optimal and suboptimal algorithms for the quadratic assignment problem

Journal of the society for industrial and applied …, Jan 1, 1962

Page 1. J. Soc. Indust. Appl. Math. Vol. 10, No. 2, June, 1962 Printed in USA OPTIMAL AND SUBOPTI... more

Ant colonies for the quadratic assignment problem

Future Generation Computer Systems, Jan 1, 2001

Ant Colonies optimization take inspiration from the behavior of real ant colonies to solve optimi... more Ant Colonies optimization take inspiration from the behavior of real ant colonies to solve optimization problems. This paper presents a parallel model for ant colonies to solve the quadratic assignment problem (QAP). The cooperation between simulated ants is provided by a pheromone matrix that plays the role of a global memory. The exploration of the search space is guided by the evolution of pheromones levels, while exploitation has been boosted by a tabu local search heuristic. Special care has also been taken in the design of a diversification phase, based on a frequency matrix. We give results that have been obtained on benchmarks from the QAP library. We show that they compare favorably with other algorithms dedicated for the QAP.

The quadratic assignment problem

European Journal of Operational Research, Jan 1, 1984

This paper aims at describing the state of the art on quadratic assignment problems (QAPs). It di... more This paper aims at describing the state of the art on quadratic assignment problems (QAPs). It discusses the most important developments in all aspects of the QAP such as linearizations, QAP polyhedra, algorithms to solve the problem to optimality, heuristics, polynomially solvable special cases, and asymptotic behavior. Moreover, it also considers problems related to the QAP, e.g. the biquadratic assignment problem, and discusses the relationship between the QAP and other well known combinatorial optimization problems, e.g. the traveling salesman problem, the graph partitioning problem, etc. The paper will appear in the Handbook of Combinatorial Optimization to be published by Kluwer Academic Publishers, P. Pardalos and D.-Z. Du, eds.

The ant system applied to the quadratic assignment problem

IEEE Transactions on Knowledge and Data Engineering, Jan 1, 1999

In recent years there has been growing interest in algorithms inspired by the observation of natu... more

Robust taboo search for the quadratic assignment problem

Parallel Computing, Jan 1, 1991