|
R. Abbiw-Jackson
, B. Golden
, S. Raghavan
and E. Wasil
, A divide-and-conquer local search heuristic for data visualization, Computers & Operations Research, 33 (2006)
, 3070-3087.
doi: 10.1016/j.cor.2005.01.020.
|
|
R. K. Ahuja
, J. B. Orlin
and A. Tiwari
, A greedy genetic algorithm for the quadratic assignment problem, Computers & Operations Research, 27 (2000)
, 917-934.
doi: 10.1016/S0305-0548(99)00067-2.
|
|
E. M. Arkin
, R. Hassin
and M. Sviridenko
, Approximating the maximum quadratic assignment problem, Information Processing Letters, 77 (2001)
, 13-16.
doi: 10.1016/S0020-0190(00)00151-4.
|
|
A. Blanchard
, S. Elloumi
, A. Faye
and N. Wicker
, A cutting algorithm for the quadratic assignment problem, INFOR, 41 (2003)
, 35-49.
|
|
S. H. Bokhari,
Assignment Problems in Parallel and Distributed Computing, Kluwer Academic Publishers, Boston, MA, 1987.
|
|
E. S. Buffa
, G. C. Armour
and T. E. Vollmann
, Allocating facilities with CRAFT, Harvard Business Review, 42 (1964)
, 136-158.
|
|
R. E. Burkard
, S. E. Karisch
and F. Rendl
, QAPLIB -A quadratic assignment problem library, Journal of Global Optimization, 10 (1997)
, 391-403.
doi: 10.1023/A:1008293323270.
|
|
R. E. Burkard, E. Cela, G. Rote and G. J. Woeginger, The quadratic assignment problem with a monotone Anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases, in: Proceedings of the 5th International Conference on Integer Programming and Combinatorial Optimization, Vancouver, British Columbia, Canada, (1996), 204-218.
|
|
E. Cela,
The Quadratic Assignment Problem: Theory and Algorithms, Combinatorial Optimization (eds. D. Z. Du and P. Pardalos), Kluwer Academic Publishers, London, 1998.
|
|
V. M. Demidenko
, G. Finke
and V. S. Gordon
, Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices, Journal of Mathematical Modeling and Algorithms, 5 (2006)
, 167-187.
doi: 10.1007/s10852-005-9013-2.
|
|
M. Dorigo,
Optimization, Learning and Natural Algorithms, Ph. D thesis, Politecnico di Milano, Italie, 1992.
|
|
E. Duman
and I. Or
, The quadratic assignment problem in the context of the printed circuit board assembly process, Computers & Operations Research, 34 (2007)
, 163-179.
doi: 10.1016/j.cor.2005.05.004.
|
|
B. Eschermann and H. J. Wunderlich, Optimized synthesis of self-testable finite state machines, in: Proceedings of the 20th International Symposium Fault-Tolerant Computing (FTCS 20), Newcastle Upon Tyne, UK, (1990), 390-397.
doi: 10.1109/FTCS.1990.89393.
|
|
H. Eskandar
, A. Sadollah
, A. Bahreininejad
and M. Hamdi
, Water cycle algorithm-A novel metaheuristic optimization method for solving constrained engineering optimization problems, Computers & Structures, 110/111 (2012)
, 151-166.
|
|
R. N. Gasimov
and O. Ustun
, Solving the quadratic assignment problem using F-MSG algorithm, Journal of Industrial and Management Optimization, 3 (2007)
, 173-191.
doi: 10.3934/jimo.2007.3.173.
|
|
G. Gutin
and A. Yeo
, Polynomial approximation algorithms for TSP and QAP with a factorial domination number, Discrete Applied Mathematics, 119 (2002)
, 107-116.
doi: 10.1016/S0166-218X(01)00267-0.
|
|
P. M. Hahn
, W. L. Hightower
, T. A. Johnson
, M. Guignard-Spielberg
and C. Roucairol
, Tree elaboration strategies in branch and bound algorithms for solving the quadratic assignment problem, Yugoslavian Journal of Operational Research, 11 (2001)
, 41-60.
|
|
J. H. Holland,
Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, 1975.
|
|
L. J. Hubert,
Assignment Methods in Combinatorial Data Analysis, Marcel Dekker Inc., New York, 1987.
|
|
J. Kennedy and R. C. Eberhart, Particle swarm optimization, in: Proceedings of IEEE International Conference on Neural Networks, Piscataway, NJ, (1995), 1942-1948.
doi: 10.1109/ICNN.1995.488968.
|
|
I. K. Kim
, D. W. Jung
and R. H. Park
, Document image binarization based on topographic analysis using a water flow model, Pattern Recognition, 35 (2002)
, 265-277.
doi: 10.1016/S0031-3203(01)00027-9.
|
|
Y. Li, P. M. Pardalos and M. G. C. Resende, A greedy randomized adaptive search procedure for the quadratic assignment problem, in Quadratic Assignment and Related Problems(eds. P. M. Pardalos and H. Wolkowicz), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 16 (1994), 237-261.
|
|
M. Lim
, Y. Yuan
and S. Omatu
, Extensive testing of a hybrid genetic algorithm for solving quadratic assignment problems, Computational Optimization and Applications, 23 (2002)
, 47-64.
doi: 10.1023/A:1019972523847.
|
|
V. Maniezzo
and A. Colorni
, The ant system applied to the quadratic assignment problem, IEEE Transactions on Knowledge and Data Engineering, 11 (1999)
, 769-778.
doi: 10.1109/69.806935.
|
|
P. Merz
and B. Freisleben
, Fitness landscape analysis and memetic algorithms for the quadratic assignment problem, IEEE Transactions on Evolutionary Computation, 4 (2000)
, 337-352.
|
|
S. Nakrani
and C. Tovey
, On honey bees and dynamic server allocation in internet hosting centers, Adaptive Behaviors, 12 (2004)
, 223-240.
doi: 10.1177/105971230401200308.
|
|
H. H. Oh
, K. T. Lim
and S. I. Chien
, An improved binarization algorithm based on a water flow model for document image with inhomogeneous backgrounds, Pattern Recognition, 38 (2005)
, 2612-2625.
doi: 10.1016/j.patcog.2004.11.025.
|
|
A. S. Ramkumar
, S. G. Ponnambalam
and N. Jawahar
, A population-based hybrid ant system for quadratic assignment formulations in facility layout design, International Journal of Advanced Manufacturing Technology, 44 (2009)
, 548-558.
doi: 10.1007/s00170-008-1849-y.
|
|
A. S. Ramkumar
, S. G. Ponnambalam
and N. Jawahar
, Iterated fast local search algorithm for solving quadratic assignment problems, Robotics and Computer-Integrated Manufacturing, 24 (2008)
, 392-401.
doi: 10.1016/j.rcim.2007.01.004.
|
|
D. F. Rossin
, M. C. Springer
and B. D. Klein
, New complexity measures for the facility layout problem: An empirical study using traditional and neural network analysis, Computers & Industrial Engineering, 36 (1999)
, 585-602.
doi: 10.1016/S0360-8352(99)00153-9.
|
|
S. Sahni
and T. Gonzalez
, P-complete approximation problems, Journal of the ACM, 23 (1976)
, 555-565.
doi: 10.1145/321958.321975.
|
|
H. Q. Saremi
, B. Abedin
and A. M. Kermani
, Website structure improvement: Quadratic assignment problem approach and ant colony metaheuristic technique, Applied Mathematics and Computation, 195 (2008)
, 285-298.
doi: 10.1016/j.amc.2007.04.095.
|
|
A. Shukla, A modified bat algorithm for the quadratic assignment problem, in: Proceedings of IEEE Congress on Evolutionary Computation (CEC' 15), Sendai, Japan, (2015), 486-490.
doi: 10.1109/CEC.2015.7256929.
|
|
H. Shah-Hosseini, Problem solving by intelligent water drops, in: Proceedings of IEEE Congress on Evolutionary Computation (CEC' 07), Singapore, (2007), 3226-3231.
|
|
H. Shah-Hosseini
, Intelligent water drops algorithm: A new optimization method for solving the multiple knapsack problem, International Journal of Intelligent Computing and Cybernetics, 1 (2008)
, 193-212.
doi: 10.1108/17563780810874717.
|
|
H. Shah-Hosseini
, The intelligent water drops algorithm: A nature-inspired swarm-based optimization algorithm, International Journal of Bio-Inspired Computation, 1 (2009)
, 71-79.
|
|
S. P. Singh
and R. R. K. Sharma
, Two-level modified simulated annealing based approach for solving facility layout problem, International Journal of Production Research, 46 (2008)
, 3563-3582.
|
|
E. Taillard
, Comparison of iterative searches for the quadratic assignment problem, Location Science, 3 (1995)
, 87-105.
doi: 10.1016/0966-8349(95)00008-6.
|
|
T. H. Tran
and K. M. Ng
, A water flow algorithm for flexible flow shop scheduling with intermediate buffers, Journal of Scheduling, 14 (2011)
, 483-500.
doi: 10.1007/s10951-010-0205-x.
|
|
T. H. Tran
and K. M. Ng
, A hybrid water flow algorithm for multi-objective flexible flow shop scheduling problems, Engineering Optimization, 45 (2013)
, 483-502.
doi: 10.1080/0305215X.2012.685072.
|
|
K. Y. Wong
and P. C. See
, A hybrid ant colony optimization algorithm for solving facility layout problems formulated as quadratic assignment problems, Engineering Computations: International Journal for Computer-Aided Engineering and Software, 27 (2010)
, 117-128.
|
|
T. H. Wu
, S. H. Chung
and C. C. Chang
, A water flow-like algorithm for manufacturing cell formation problems, European Journal of Operational Research, 205 (2010)
, 346-360.
doi: 10.1016/j.ejor.2010.01.020.
|
|
X. Yang
, Q. Lu
, C. Li
and X. Liao
, Biological computation of the solution to the quadratic assignment problem, Applied Mathematics and Computation, 200 (2008)
, 369-377.
doi: 10.1016/j.amc.2007.11.016.
|
|
F. C. Yang
and Y. P. Wang
, Water flow-like algorithm for object grouping problems, Journal of the Chinese Institute of Industrial Engineers, 24 (2007)
, 475-488.
|
|
Y. J. Zheng
, Water wave optimization: A new nature-inspired metaheuristic, Computers & Operations Research, 55 (2015)
, 1-11.
doi: 10.1016/j.cor.2014.10.008.
|