An improved hybrid genetic algorithm: new results for the quadratic assignment problem

Misevičius, Alfonsas

doi:10.1016/j.knosys.2004.03.001

Cited by 101 publications

(42 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In Misevicius' (2004) study of quadratic assignment problem, iterated local search was used to obtained higher quality solution by reconstruction of existing solution and continued following of improvement procedure. The iterated local search method benefits users in getting optimal solution faster as it needs a few steps to reach the next local optimal compared to random choosing of individual from the beginning.…”

Section: Hybrid Genetic Algorithm With Local Searchmentioning

confidence: 99%

A Review on Automated Menu Planning Approaches

Ngo¹,

Cheah²,

Goh³

et al. 2016

Journal of Computer Science

View full text Add to dashboard Cite

Abstract:Planning is widely been used in many areas such as in medicine, administration, business, logistics, education, environment and family matters. In automated planning research, the word "plans" refers specifically to plans of action. It is about the representation of future behavior, generally a series of action, with temporal and other constraints on them for execution by some agents. Theoretically, planning is an important part of rational behavior. In this study, we review some of the studies that have been conducted in menu planning. It covers the introduction of menu planning, the state of the arts for nutrition care expert systems and the approaches that have been applied. Furthermore, the advantages and limitations of the methods commonly used for menu planning are also highlighted in this study.

show abstract

Section: Hybrid Genetic Algorithm With Local Searchmentioning

confidence: 99%

A Review on Automated Menu Planning Approaches

Ngo¹,

Cheah²,

Goh³

et al. 2016

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…The algorithms used in the comparison are as follows: the robust tabu search algorithm (RoTS) (Taillard 1991), the reactive tabu search algorithm (ReTS) (Battiti and Tecchiolli 1994), the enhanced tabu search algorithm (ETS) (Misevicius 2005), and the improved hybrid genetic algorithm (IHGA) (Misevicius 2004). The following are the performance measures for the algorithms: (a)δ-the average relative deviation from the best known solution (BKS) [δ = 100(z − z ♦ )/z ♦ (%), wherez is the average objective function value over K runs of the algorithm and z ♦ denotes the best known value of the objective function (BKVs can be found in QAPLIB)]; (b) C 1% -the number of solutions (over K runs) for which δ≤1 (δ = 100(z − z ♦ )/z ♦ (%), where z is the objective function value of a single run); (c) C bks -the number of BKSs.…”

Section: Computational Experimentsmentioning

confidence: 99%

“…Therefore, the attention of the researchers is focused on the development of heuristic methods [like ant colony optimization (Gambardella et al 1999), evolution strategies (Nissen 1994), genetic algorithms (Drezner 2003;Merz and Freisleben 2000;Misevicius 2004), greedy randomized adaptive search procedures (Li et al 1994), hybrid heuristics (McLoughlin and Cedeño 2005;Tseng and Liang 2005;Xu et al 2006), iterated local search (Stützle 2006), simulated annealing (Bölte and Thonemann 1996), tabu search (Battiti and Tecchiolli 1994;Drezner 2005;James et al 2009;Misevicius 2005;Taillard 1991;Voß 1995), very large-scale neighbourhood search (Ahuja et al 2007)]. More exhaustive surveys of the heuristic algorithms for the QAP can be found in Burkard et al (1998), Loiola et al (2007) and Voß (2000).…”

mentioning

confidence: 99%

An implementation of the iterated tabu search algorithm for the quadratic assignment problem

Misevičius¹

2011

OR Spectrum

Self Cite

View full text Add to dashboard Cite

In this paper, we describe an implementation of the iterated tabu search (ITS) algorithm for the quadratic assignment problem (QAP), which is one of the wellknown problems in combinatorial optimization. The medium-and large-scale QAPs are not, to this date, practically solvable to optimality, therefore heuristic algorithms are widely used. In the proposed ITS approach, intensification and diversification mechanisms are combined in a proper way. The goal of intensification is to search for good solutions in the neighbourhood of a given solution, while diversification is responsible for escaping from local optima and moving towards new regions of the search space. In particular, the following enhancements were implemented: new formula for fast evaluation of the objective function and efficient data structure; extended intensification mechanisms (including randomized tabu criterion, combination of tabu search and local search, dynamic tabu list maintaining); enhanced diversification strategy using periodic tabu tenure and special mutation procedure. The ITS algorithm is tested on the different instances taken from the QAP library QAPLIB. The results from the experiments demonstrate promising efficiency of the proposed algorithm, especially for the random QAP instances.

show abstract

“…Misevičius [14,15] generated the initial population with improving solutions obtained by random permutations by local search procedures based on the ruin and recreate procedure and a tabu search.…”

Section: Initializationmentioning

confidence: 99%

A memetic algorithm for the quadratic multiple container packing problem

Soak

Lee

2010

Appl Intell

View full text Add to dashboard Cite

In this paper, we propose a new memetic algorithm for the quadratic multiple container packing problem. The proposed memetic algorithm is based on the adaptive link adjustment evolutionary algorithm (ALA-EA) and it incorporates heuristic fitness improvement schemes into the ALA-EA. In addition, we propose a new powerful initialization method for the QMCPP.The proposed algorithm is compared to the previous approaches. We report that it can find much improved final solutions at most benchmark instances. Moreover, even the best solutions of the first generation show better than the previous known best solutions at most of instances especially with density d = 0.75.In addition, we compare the proposed memetic algorithm to the NetKey based evolutionary algorithm for analyzing features of the ALA-EA.Keywords Evolutionary algorithm · Memetic algorithm · Quadratic multiple container packing problem · Adaptive link adjustment

show abstract

An improved hybrid genetic algorithm: new results for the quadratic assignment problem

Cited by 101 publications

References 22 publications

A Review on Automated Menu Planning Approaches

A Review on Automated Menu Planning Approaches

An implementation of the iterated tabu search algorithm for the quadratic assignment problem

A memetic algorithm for the quadratic multiple container packing problem

Contact Info

Product

Resources

About