zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Variable neighbourhood search: methods and applications. (English) Zbl 1185.90211
Summary: Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building heuristics, based upon systematic changes of neighbourhoods both in descent phase, to find a local minimum, and in perturbation phase to emerge from the corresponding valley. It was first proposed in 1997 and has since then rapidly developed both in its methods and its applications. In the present paper, these two aspects are thoroughly reviewed and an extensive bibliography is provided. Moreover, one section is devoted to newcomers. It consists of steps for developing a heuristic for any particular problem. Those steps are common to the implementation of other metaheuristics.
MSC:
90C59Approximation methods and heuristics
References:
[1]Abraham, A., Liu, H., & Zhao, M. (2008). Particle swarm scheduling for work-flow applications in distributed computing environments. Studies in Computational Intelligence, 128, 327–342. · Zbl 1151.90581 · doi:10.1007/978-3-540-78985-7_13
[2]Alba, E., & Domínguez, E. (2006). Comparative analysis of modern optimization tools for the p-median problem. Statistics and Computing, 16(3), 251–260. · doi:10.1007/s11222-006-8079-7
[3]Almada-Lobo, B., Oliveira, J. F., & Carravilla, M. A. (2008). Production planning and scheduling in the glass container industry: A VNS approach. International Journal of Production Economics, 114(1), 363–375. · doi:10.1016/j.ijpe.2007.02.052
[4]Aloise, D. J., Aloise, D., Rocha, C. T. M., Ribeiro, C. C., Ribeiro, J. C., & Moura, L. S. S. (2006). Scheduling workover rigs for onshore oil production. Discrete Applied Mathematics, 154(5), 695–702. · Zbl 1120.90015 · doi:10.1016/j.dam.2004.09.021
[5]Amaldi, E., Liberti, L., Maffioli, F., & Maculan, N. (2009). Edge-swapping algorithms for the minimum fundamental cycle basis problem. Mathematical Methods of Operations Research, 69(2), 205–233. · Zbl 1163.90036 · doi:10.1007/s00186-008-0255-4
[6]Andreatta, A., & Ribeiro, C. (2002). Heuristics for the phylogeny problem. Journal of Heuristics, 8(4), 429–447. · Zbl 1041.68546 · doi:10.1023/A:1015439913121
[7]Anghinolfi, D., & Paolucci, M. (2007). Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach. Computers and Operations Research, 34(11), 3471–3490. · Zbl 1127.90020 · doi:10.1016/j.cor.2006.02.009
[8]Aouchiche, M., & Hansen, P. (2005). Recherche à voisinage variable de graphes extrèmes 13. À propos de la maille. RAIRO Operations Research, 39, 275–293 (French). · Zbl 1132.05032 · doi:10.1051/ro:2006006
[9]Aouchiche, M., & Hansen, P. (2007a). Automated results and conjectures on average distance in graphs. Graph Theory in Paris, Trends in Mathematics, VI, 21–36. · doi:10.1007/978-3-7643-7400-6_3
[10]Aouchiche, M., & Hansen, P. (2007b). On a conjecture about the Randic index. Discrete Mathematics, 307, 262–265. · Zbl 1110.05051 · doi:10.1016/j.disc.2006.06.025
[11]Aouchiche, M., & Hansen, P. (2008a). Bounding average distance using order and minimum degree. Les Cahiers du GERAD G-2008-35. To appear in Graph Theory Notes of New York.
[12]Aouchiche, M., & Hansen, P. (2008b). Nordhaus-Gaddum relations for proximity and remoteness in graphs. Les Cahiers du GERAD G-2008-36.
[13]Aouchiche, M., Caporossi, G., & Cvetković, D. (2001). Variable neighborhood search for extremal Variations on Graffiti 105graphs 8. Congressus Numerantium, 148, 129–144.
[14]Aouchiche, M., Bonnefoy, J. M., Fidahoussen, A., Caporossi, G., Hansen, P., Hiesse, L., Lacheré, J., & Monhait, A. (2005a). Variable neighborhood search for extremal graphs 14. The AutoGraphiX 2 system. In L. Liberti & N. Maculan (Eds.), Global optimization: from theory to implementation (pp. 281–309). Berlin: Springer.
[15]Aouchiche, M., Caporossi, G., Hansen, P., & Laffay, M. (2005b). AutoGraphiX: a survey. Electronic Notes in Discrete Mathematics, 22, 515–520. · Zbl 1200.05002 · doi:10.1016/j.endm.2005.06.090
[16]Aouchiche, M., Hansen, P., & Stevanović, D. (2005c). Variable neighborhood search for extremal graphs 17. Further conjectures and results about the index. Les Cahiers du GERAD G-2005-78. To appear in Discusiones Mathematicae: Graph Theory.
[17]Aouchiche, M., Hansen, P., & Zheng, M. (2006). Variable neighborhood search for extremal graphs 18. Conjectures and results about the Randic index. MATCH Communications in Mathematical and Computer Chemistry, 56(3), 541–550.
[18]Aouchiche, M., Caporossi, G., & Hansen, P. (2007a). Variable neighborhood search for extremal graphs 20. Automated comparison of graph invariants. MATCH Communications in Mathematical and Computer Chemistry, 58(2), 365–384.
[19]Aouchiche, M., Caporossi, G., & Hansen, P. (2007b). Variable neighborhood search for extremal graphs 27. Families of extremal graphs. Les Cahiers du GERAD G-2007-87.
[20]Aouchiche, M., Favaron, O., & Hansen, P. (2007c). Recherche à voisinage variable de graphes extrèmes 26. Nouveaux résultats sur la maille (French). Les Cahiers du GERAD G-2007-55.
[21]Aouchiche, M., Hansen, P., & Zheng, M. (2007d). Variable neighborhood search for extremal graphs 19. Further conjectures and results about the Randic index. MATCH Communications in Mathematical and Computer Chemistry, 58(1), 83–102.
[22]Aouchiche, M., Bell, F. K., Cvetković, D., Hansen, P., Rowlinson, P., Simić, S. K., & Stevanović, D. (2008). Variable neighborhood search for extremal graphs 16. Some conjectures related to the largest eigenvalue of a graph. European Journal of Operational Research, 191(3), 661–676. · Zbl 1160.90494 · doi:10.1016/j.ejor.2006.12.059
[23]Aouchiche, M., Brinkmann, G., & Hansen, P. (2009a). Variable neighborhood search for extremal graphs 21. Conjectures and results about the independence number. Discrete Applied Mathematics, 156(13), 2530–2542. · Zbl 1173.05022 · doi:10.1016/j.dam.2008.03.011
[24]Aouchiche, M., Favaron, O., & Hansen, P. (2009b). Variable neighborhood search for extremal graphs 22. Extending bounds for independence to upper irredundance. Discrete Applied Mathematics. doi: 10.1016/j.dam.2009.04.004 .
[25]Archetti, C., Hertz, A., & Speranza, M. G. (2007). Metaheuristics for the team orienteering problem. Journal of Heuristics, 13(1), 49–76. · Zbl 05193457 · doi:10.1007/s10732-006-9004-0
[26]Audet, C., Brimberg, J., Hansen, P., & Mladenović, N. (2004). Pooling problem: alternate formulation and solution methods. Management Science, 50, 761–776. · Zbl 1232.90349 · doi:10.1287/mnsc.1030.0207
[27]Audet, C., Báchard, V., & Le Digabel, S. (2008). Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search. Journal of Global Optimization, 41(2), 299–318. · Zbl 1157.90535 · doi:10.1007/s10898-007-9234-1
[28]Avanthay, C., Hertz, A., & Zufferey, N. (2003). A variable neighborhood search for graph coloring. European Journal of Operational Research, 151(2), 379–388. · Zbl 1053.90050 · doi:10.1016/S0377-2217(02)00832-9
[29]Aydin, M. E., & Sevkli, M. (2008). Sequential and parallel variable neighborhood search algorithms for job shop scheduling. Studies in Computational Intelligence, 128, 125–144. · Zbl 1151.90391 · doi:10.1007/978-3-540-78985-7_6
[30]Baum, E. B. (1986). Toward practical ’neural’ computation for combinatorial optimization problems. In J. Denker (Ed.), Neural networks for computing. American Institute of Physics.
[31]Behnamian, J., Fatemi Ghomi, S. M. T., & Zandieh, M. (2009a). A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic. Expert Systems with Applications, 36(8), 11057–11069. · Zbl 05857213 · doi:10.1016/j.eswa.2009.02.080
[32]Behnamian, J., Zandieh, M., & Fatemi Ghomi, S. M. T. (2009b). Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm. Expert Systems with Applications, 36(6), 9637–9644. · Zbl 05857050 · doi:10.1016/j.eswa.2008.10.007
[33]Belacel, N., Hansen, P., & Mladenović, N. (2002). Fuzzy J-means: a new heuristic for fuzzy clustering. Pattern Recognition, 35(10), 2193–2200. · Zbl 1006.68882 · doi:10.1016/S0031-3203(01)00193-5
[34]Belacel, N., Čuperlović-Culf, M., Laflamme, M., & Ouellette, R. (2004a). Fuzzy J-means and VNS methods for clustering genes from microarray data. Bioinformatics, 20(11), 1690–1701. · doi:10.1093/bioinformatics/bth142
[35]Belacel, N., Čuperlović-Culf, M., Ouellette, R., & Boulassel, M. R. (2004b). The variable neighborhood search metaheuristic for fuzzy clustering cDNA microarray gene expression data. In M. H. Hamza (Ed.), Artificial intelligence and applications. Calgary: Acta Press.
[36]Belacel, N., Raval, H. B., & Punnen, A. P. (2007). Learning multicriteria fuzzy classification method PROAFTN from data. Computers and Operations Research, 34(7), 1885–1898. · Zbl 1186.68353 · doi:10.1016/j.cor.2005.07.019
[37]Belhaiza, S., de Abreu, N., Hansen, P., & Oliveira, C. (2007). Variable neighborhood search for extremal graphs 11. Bounds on algebraic connectivity. In D. Avis, A. Hertz, & O. Marcotte (Eds.), Graph theory and combinatorial optimization (pp. 1–16).
[38]Beltrán, J. D., Calderón, J. E., Jorge-Cabrera, R., Moreno-Pérez, J. A., & Moreno-Vega, J. M. (2004). GRASP-VNS hybrid for the strip packing problem. In Hybrid metaheuristics 2004 (pp. 79–90).
[39]Benati, S. (2008). Categorical data fuzzy clustering: an analysis of local search heuristics. Computers and Operations Research, 35(3), 766–775. · Zbl 05202096 · doi:10.1016/j.cor.2006.05.001
[40]Benati, S., & Hansen, P. (2002). The maximum capture problem with random utilities: problem formulation and algorithms. European Journal of Operational Research, 143(3), 518–530. · Zbl 1082.90543 · doi:10.1016/S0377-2217(01)00340-X
[41]Bischoff, M., & Dächert, K. (2009). Allocation search methods for a generalized class of location-allocation problems. European Journal of Operational Research, 192(3), 793–807. · Zbl 1157.90486 · doi:10.1016/j.ejor.2007.10.022
[42]Blazewicz, J., Pesch, E., Sterna, M., & Werner, F. (2005). Metaheuristics for late work minimization in two-machine flow shop with common due date. In Lecture notes in artificial intelligence (Vol. 3698, pp. 222–234). Berlin: Springer.
[43]Blazewicz, J., Pesch, E., Sterna, M., & Werner, F. (2008). Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date. Computers and Operations Research, 35(2), 574–599. · Zbl 1141.90018 · doi:10.1016/j.cor.2006.03.021
[44]Bouffard, V., & Ferland, J. A. (2007). Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem. Journal of Scheduling, 10(6), 375–386. · Zbl 1153.90415 · doi:10.1007/s10951-007-0043-7
[45]Bräysy, O. (2003). A reactive variable neighborhood search for the vehicle routing problem with time windows. INFORMS Journal on Computing, 15(4), 347–368. · Zbl 1238.90136 · doi:10.1287/ijoc.15.4.347.24896
[46]Brimberg, J., & Mladenović, N. (1996). A variable neighborhood algorithm for solving the continuous location-allocation problem. Studies in Locational Analysis, 10, 1–12.
[47]Brimberg, J., Hansen, P., Mladenović, N., & Taillard, É. (2000). Improvements and comparison of heuristics for solving the multisource Weber problem. Operations Research, 48(3), 444–460. · doi:10.1287/opre.48.3.444.12431
[48]Brimberg, J., Hansen, P., Lih, K.-W., Mladenović, N., & Breton, M. (2003). An oil pipeline design problem. Operations Research, 51(2), 228–239. · Zbl 1163.90592 · doi:10.1287/opre.51.2.228.12786
[49]Brimberg, J., Mladenović, N., & Salhi, S. (2004). The multi-source Weber problem with constant opening cost. Journal of the Operational Research Society, 55, 640–646. · Zbl 1060.90680 · doi:10.1057/palgrave.jors.2601754
[50]Brimberg, J., Hansen, P., & Mladenović, N. (2006a). Decomposition strategies for large-scale continuous location–allocation problems. IMA Journal of Management Mathematics, 17, 307–316. · Zbl 1126.90043 · doi:10.1093/imaman/dpl002
[51]Brimberg, J., Urošević, D., & Mladenović, N. (2006b). Variable neighborhood search for the vertex weighted k-cardinality tree problem. European Journal of Operational Research, 171(1), 74–84. · Zbl 1087.90061 · doi:10.1016/j.ejor.2004.07.061
[52]Brimberg, J., Hansen, P., Laporte, G., Mladenović, N., & Urošević, D. (2008a). The maximum return-on-investment plant location problem with market share. Journal of the Operational Research Society, 59(3), 399–406. · Zbl 1145.90416 · doi:10.1057/palgrave.jors.2602349
[53]Brimberg, J., Mladenović, N., & Urošević, D. (2008b). Local and variable neighborhood search for the k-cardinality subgraph problem. Journal of Heuristics, 14(5), 501–517. · Zbl 1211.90298 · doi:10.1007/s10732-007-9046-y
[54]Brimberg, J., Mladenović, N., Urošević, D., & Ngai, E. (2009). Variable neighborhood search for the heaviest k-subgraph. Computers and Operations Research, 36(11), 2885–2891. · Zbl 1162.90540 · doi:10.1016/j.cor.2008.12.020
[55]Brusco, M., & Steinley, D. (2007a). A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices. Journal of Mathematical Psychology, 51(5), 325–338. · Zbl 1151.91731 · doi:10.1016/j.jmp.2007.07.001
[56]Brusco, M. J., & Steinley, D. (2007b). A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning. Psychometrika, 72(4), 583–600. · Zbl 05488634 · doi:10.1007/s11336-007-9013-4
[57]Brusco, M. J., Köhn, H.-F., & Stahl, S. (2008). Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis. Psychometrika, 73(3), 503–522. · doi:10.1007/s11336-007-9049-5
[58]Brusco, M. J., Singh, R., & Steinley, D. (2009). Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis. Psychometrika. doi: 10.1007/s11336-009-9130-3 .
[59]Burke, E. K., & Kendall, G. (2005). Search methodologies. Introductory tutorials in optimization and decision support techniques. Berlin: Springer.
[60]Burke, E. K., Cowling, P., & Keuthen, R. (2001). Effective local and guided variable neighborhood search methods for the asymmetric travelling salesman problem. In Lecture notes in computer science (Vol. 2037, pp. 203–212). Berlin: Springer.
[61]Canuto, S., Resende, M., & Ribeiro, C. (2001). Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks, 31(3), 201–206.
[62]Caporossi, G., & Hansen, P. (2000). Variable neighborhood search for extremal graphs 1. The AutoGraphiX system. Discrete Mathematics, 212, 29–44. · Zbl 0947.90130 · doi:10.1016/S0012-365X(99)00206-X
[63]Caporossi, G., & Hansen, P. (2004). Variable neighborhood search for extremal graphs 5. Three ways to automate finding conjectures. Discrete Mathematics, 276(1–3), 81–94. · Zbl 1031.05068 · doi:10.1016/S0012-365X(03)00311-X
[64]Caporossi, G., Cvetković, D., Gutman, I., & Hansen, P. (1999a). Variable neighborhood search for extremal graphs 2. Finding graphs with extremal energy. Journal of Chemical Information and Computer Sciences, 39, 984–996.
[65]Caporossi, G., Dobrynin, A. A., Gutman, I., & Hansen, P. (1999b). Trees with palindromic Hosoya polynomials. Graph Theory Notes of New York, 37, 10–16.
[66]Caporossi, G., Gutman, I., & Hansen, P. (1999c). Variable neighborhood search for extremal graphs 4. Chemical trees with extremal connectivity index. Computers and Chemistry, 23(5), 469–477. · Zbl 05467539 · doi:10.1016/S0097-8485(99)00031-5
[67]Caporossi, G., Gutman, I., Hansen, P., & Pavlović, L. (2003). Graphs with maximum connectivity index. Computational Biology and Chemistry, 27, 85–90. · doi:10.1016/S0097-8485(02)00016-5
[68]Caporossi, G., Alamargot, D., & Chesnet, D. (2004). Using the computer to study the dynamics of the handwriting processes. In Lecture notes in computer science (Vol. 3245, pp. 242–254). Berlin: Springer.
[69]Carrabs, F., Cordeau, J.-F., & Laporte, G. (2007). Variable neighbourhood search for the pickup and delivery traveling salesman problem with LIFO loading. INFORMS Journal on Computing, 19(4), 618–632. · Zbl 1241.90103 · doi:10.1287/ijoc.1060.0202
[70]Carrizosa, E., Martín-Barragán, B., Plastria, F., & Romero Morales, D. (2007). On the selection of the globally optimal prototype subset for nearest-neighbor classification. INFORMS Journal on Computing, 19(3), 470–479. · Zbl 1241.90086 · doi:10.1287/ijoc.1060.0183
[71]Chen, C.-L., & Chen, C.-L. (2009). Hybrid metaheuristic for unrelated parallel machine scheduling with sequence-dependent setup times. International Journal of Advanced Manufacturing Technology, 43(1–2), 161–169. · doi:10.1007/s00170-008-1692-1
[72]Chyu, C.-C., & Chen, Z.-J. (2009). Scheduling jobs under constant period-by-period resource availability to maximize project profit at a due date. International Journal of Advanced Manufacturing Technology, 42(5–6), 569–580. · doi:10.1007/s00170-008-1614-2
[73]Claro, J., & de Sousa, J. P. (2008). A multiobjective metaheuristic for a mean-risk multistage capacity investment problem. Journal of Heuristics. doi: 10.1007/s10732-008-9090-2 .
[74]Consoli, S., Darby-Dowman, K., Mladenović, N., & Moreno Pérez, J. A. (2009a). Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem. European Journal of Operational Research, 196(2), 440–449. · Zbl 1163.90766 · doi:10.1016/j.ejor.2008.03.014
[75]Consoli, S., Darby-Dowman, K., Mladenović, N., & Moreno-Pérez, J. A. (2009b). Variable neighbourhood search for the minimum labelling Steiner tree problem. Annals of Operations Research. doi: 10.1007/s10479-008-0507-y .
[76]Costa, M. C., Monclar, F. R., & Zrikem, M. (2002). Variable neighborhood decomposition search for the optimization of power plant cable layout. Journal of Intelligent Manufacturing, 13(5), 353–365. · doi:10.1023/A:1019980525722
[77]Cote, P., Wong, T., & Sabourin, R. (2005). A hybrid multi-objective evolutionary algorithm for the uncapacitated exam proximity problem. In Lecture notes in computer science (Vol. 3616, pp. 294–312). Berlin: Springer.
[78]Cowling, P. I., & Keuthen, R. (2005). Embedded local search approaches for routing optimization. Computers and Operations Research, 32(3), 465–490. · Zbl 1061.90092 · doi:10.1016/S0305-0548(03)00248-X
[79]Crainic, T., Gendreau, M., Hansen, P., & Mladenović, N. (2004). Cooperative parallel variable neighborhood search for the p-median. Journal of Heuristics, 10, 289–310.
[80]Crispim, J., & Brandao, J. (2001). Reactive tabu search and variable neighborhood descent applied to the vehicle routing problem with backhauls. In MIC’2001 (pp. 631–636). Porto, 2001.
[81]Cvetkovic, D., Simic, S., Caporossi, G., & Hansen, P. (2001). Variable neighborhood search for extremal graphs 3. On the largest eigenvalue of color-constrained trees. Linear and Multilinear Algebra, 49, 143–160. · Zbl 1003.05058 · doi:10.1080/03081080108818690
[82]Czogalla, J., & Fink, A. (2008). On the effectiveness of particle swarm optimization and variable neighborhood descent for the continuous flow-shop scheduling problem. Studies in Computational Intelligence, 128, 61–89. · Zbl 1151.90402 · doi:10.1007/978-3-540-78985-7_3
[83]Dahal, K., Remde, S., Cowling, P., & Colledge, N. (2008). Improving metaheuristic performance by evolving a variable fitness function. In Lecture notes in computer science (Vol. 4972, pp. 170–181). Berlin: Springer.
[84]Davidon, W. C. (1959). Variable metric algorithm for minimization. Argonne National Laboratory Report ANL-5990.
[85]Davidović, T., Hansen, P., & Mladenović, N. (2005). Permutation-based genetic, tabu, and variable neighborhood search heuristics for multiprocessor scheduling with communication delays. Asia-Pacific Journal of Operational Research, 22(3), 297–326. · Zbl 1085.90020 · doi:10.1142/S021759590500056X
[86]De Paula, M. R., Ravetti, M. G., Mateus, G. R., & Pardalos, P. M. (2007). Solving parallel machines scheduling problems with sequence-dependent setup times using Variable Neighbourhood Search. IMA Journal of Management Mathematics, 18(2), 101–115. · Zbl 1177.90151 · doi:10.1093/imaman/dpm016
[87]de Souza, M. C., & Martins, P. (2008). Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem. European Journal of Operational Research, 191(3), 677–690. · Zbl 1160.90499 · doi:10.1016/j.ejor.2006.12.061
[88]Degila, J. R., & Sansò, B. (2004). Topological design optimization of a Yottabit-per-second lattice network. IEEE Journal on Selected Areas in Communications, 22(9), 1613–1625. · doi:10.1109/JSAC.2004.829642
[89]Del Pia, A., & Filippi, C. (2006). A variable neighborhood descent algorithm for a real waste collection problem with mobile depots. International Transactions in Operational Research, 13(2), 125–141. · Zbl 1127.90391 · doi:10.1111/j.1475-3995.2006.00539.x
[90]Desrosiers, J., Mladenović, N., & Villeneuve, D. (2005). Design of balanced MBA student teams. Journal of the Operational Research Society, 56(1), 60–66. · Zbl 1122.91368 · doi:10.1057/palgrave.jors.2601775
[91]Dias, T. C. S., de Sousa, G. F., Macambira, E. M., Cabral, L. D. A. F., & Fampa, M. H. C. (2006). An efficient heuristic for the ring star problem. In Lecture notes in computer science (Vol. 4007, pp. 24–35). Berlin: Springer.
[92]Domínguez-Marín, P., Nickel, S., Hansen, P., & Mladenović, N. (2005). Heuristic procedures for solving the discrete ordered median problem. Annals of Operations Research, 136(1), 145–173. · Zbl 1105.90332 · doi:10.1007/s10479-005-2043-3
[93]Dražić, M., Kovacevic-Vujcić, V., Cangalović, M., & Mladenović, N. (2006). GLOB–A new VNS-based software for global optimization. In L. Liberti & N. Maculan (Eds.), Global optimization: from theory to implementation (pp. 135–144). Berlin: Springer.
[94]Dražić, M., Lavor, C., Maculan, N., & Mladenović, N. (2008). A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule. European Journal of Operational Research, 185(3), 1265–1273. · Zbl 1175.90444 · doi:10.1016/j.ejor.2006.06.052
[95]Drezner, Z., Hahn, P. M., & Taillard, E. D. (2005). Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods. Annals of Operations Research, 139(1), 65–94. · Zbl 1091.90033 · doi:10.1007/s10479-005-3444-z
[96]du Merle, O., Villeneuve, D., Desrosiers, J., & Hansen, P. (1999). Stabilized column generation. Discrete Mathematics, 194(1–3), 229–237. · Zbl 0949.90063 · doi:10.1016/S0012-365X(98)00213-1
[97]du Merle, O., Hansen, P., Jaumard, B., & Mladenović, N. (2000). An interior point algorithm for minimum sum-of-squares clustering. SIAM Journal on Scientific Computing, 21, 1485–1505.
[98]Duarte, A., Sanchez, A., Fernandez, F., & Cabido, R. (2005). A low-level hybridization between memetic algorithm and VNS for the max-cut problem. In GECCO 2005–Genetic and evolutionary computation conference (pp. 999–1006).
[99]Estellon, B., Gardi, F., & Nouioua, K. (2006). Large neighborhood improvements for solving car sequencing problems. RAIRO Operations Research, 40(4), 355–379. · Zbl 1151.90523 · doi:10.1051/ro:2007003
[100]Estellon, B., Gardi, F., & Nouioua, K. (2008). Two local search approaches for solving real-life car sequencing problems. European Journal of Operational Research, 191(3), 928–944. · Zbl 1156.90361 · doi:10.1016/j.ejor.2007.04.043
[101]Fathali, J., & Kakhki, H. T. (2006). Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases. European Journal of Operational Research, 170(2), 440–462. · Zbl 1085.90007 · doi:10.1016/j.ejor.2004.05.027
[102]Felipe, Á., Ortuño, M. T., & Tirado, G. (2009). The double traveling salesman problem with multiple stacks: a variable neighborhood search approach. Computers and Operations Research, 36(11), 2983–2993. · Zbl 1162.90353 · doi:10.1016/j.cor.2009.01.015
[103]Festa, P., Pardalos, P. M., Resende, M. G. C., & Ribeiro, C. C. (2002). Randomized heuristics for the MAX-CUT problem. Optimization Methods and Software, 17(6), 1033–1058. · Zbl 1032.90073 · doi:10.1080/1055678021000090033
[104]Fischetti, M., & Lodi, A. (2003). Local branching. Mathematical Programming, 98(1–3), 23–47. · Zbl 1060.90056 · doi:10.1007/s10107-003-0395-5
[105]Fischetti, M., Polo, C., & Scantamburlo, M. (2004). A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem. Networks, 44(2), 61–72. · Zbl 1055.90054 · doi:10.1002/net.20017
[106]Fleszar, K., & Hindi, K. S. (2002). New heuristics for one-dimensional bin-packing. Computers and Operations Research, 29, 821–839. · Zbl 0994.90134 · doi:10.1016/S0305-0548(00)00082-4
[107]Fleszar, K., & Hindi, K. S. (2004). Solving the resource-constrained project scheduling problem by a variable neighborhood search. European Journal of Operational Research, 155(2), 402–413. · Zbl 1045.90028 · doi:10.1016/S0377-2217(02)00884-6
[108]Fleszar, K., & Hindi, K. S. (2008). An effective VNS for the capacitated p-median problem. European Journal of Operational Research, 191(3), 612–622. · Zbl 1160.90496 · doi:10.1016/j.ejor.2006.12.055
[109]Fleszar, K., Osman, I. H., & Hindi, K. S. (2009). A variable neighbourhood search algorithm for the open vehicle routing problem. European Journal of Operational Research, 195(3), 803–809. · Zbl 1155.90323 · doi:10.1016/j.ejor.2007.06.064
[110]Fletcher, R., & Powell, M. J. D. (1963). Rapidly convergent descent method for minimization. The Computer Journal, 6, 163–168.
[111]Fowler, P. W., Hansen, P., Caporossi, G., & Soncini, A. (2001). Variable neighborhood search for extremal graphs 7. Polyenes with maximum HOMO-LUMO gap. Chemical Physics Letters, 49, 143–146.
[112]Gagné, C., Gravel, M., & Price, W. L. (2005). Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems. Journal of the Operational Research Society, 56, 687–698. · Zbl 1095.90120 · doi:10.1057/palgrave.jors.2601868
[113]Galinier, P., & Hertz, A. (2006). A survey of local search methods for graph coloring. Computers and Operations Research, 33(9), 2547–2562. · Zbl 1086.90060 · doi:10.1016/j.cor.2005.07.028
[114]Gao, J., Sun, L., & Gen, M. (2008). A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Computers and Operations Research, 35(9), 2892–2907. · Zbl 1144.90379 · doi:10.1016/j.cor.2007.01.001
[115]García, C. G., Pérez-Brito, D., Campos, V., & Martí, R. (2006). Variable neighborhood search for the linear ordering problem. Computers and Operations Research, 33(12), 3549–3565. · Zbl 1094.90039 · doi:10.1016/j.cor.2005.03.032
[116]García-López, F., Melián-Batista, B., Moreno-Pérez, J. A., & Moreno-Vega, J. M. (2002). The parallel variable neighborhood search for the p-median problem. Journal of Heuristics, 8(3), 375–388. · Zbl 1012.68796 · doi:10.1023/A:1015013919497
[117]Garey, M. R., & Johnson, D. S. (1978). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman.
[118]Garroi, J.-J., Goos, P., & Sörensen, K. (2009). A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation. Journal of Statistical Planning and Inference, 139(1), 30–44. · Zbl 05363133 · doi:10.1016/j.jspi.2008.05.014
[119]Gavranović, H. (2008). Local search and suffix tree for car-sequencing problem with colors. European Journal of Operational Research, 191(3), 972–980. · Zbl 1156.90375 · doi:10.1016/j.ejor.2007.04.051
[120]Geiger, M. J., & Wenger, W. (2007). On the interactive resolution of multi-objective vehicle routing problems. In Lecture notes in artificial intelligence (Vol. 4403, pp. 687–699). Berlin: Springer.
[121]Geiger, M. J., & Wenger, W. (2009). On the assignment of students to topics: a Variable Neighborhood Search approach. Socio-Economic Planning Sciences. doi: 10.1016/j.seps.2009.03.001 .
[122]Gill, P., Murray, W., & Wright, M. (1981). Practical optimization. London: Academic Press.
[123]Glover, F., & Kochenberger, G. (Eds.) (2003). Handbook of metaheuristics. Amsterdam: Kluwer.
[124]Goel, A., & Gruhn, V. (2008). A general vehicle routing problem. European Journal of Operational Research, 191(3), 650–660. · Zbl 1160.90343 · doi:10.1016/j.ejor.2006.12.065
[125]Griffith, R. E., & Stewart, R. A. (1961). A nonlinear programming technique for the optimization of continuous processing systems. Management Science, 7, 379–392. · Zbl 0995.90610 · doi:10.1287/mnsc.7.4.379
[126]Gupta, S. R., & Smith, J. S. (2006). Algorithms for single machine total tardiness scheduling with sequence dependent setups. European Journal of Operational Research, 175(2), 722–739. · Zbl 1142.90399 · doi:10.1016/j.ejor.2005.05.018
[127]Gutjahr, W. J., Katzensteiner, S., & Reiter, P. (2007). A VNS algorithm for noisy problems and its application to project portfolio analysis. In Lecture notes in computer science (Vol. 4665, pp. 93–104). Berlin: Springer.
[128]Gutman, I., Miljković, O., Caporossi, G., & Hansen, P. (1999). Alkanes with small and large Randić connectivity indices. Chemical Physics Letters, 306, 366–372. · doi:10.1016/S0009-2614(99)00472-8
[129]Gutman, I., Hansen, P., & Mélot, H. (2005). Variable neighborhood search for extremal graphs 10. Comparison of irregularity indices for chemical trees. Journal of Chemical Information and Modeling, 45, 222–230. · doi:10.1021/ci0342775
[130]Han, H., Ye, J., & Lv, Q. (2007). A VNS-ANT algorithm to QAP. In Third international conference on natural computation (Vol. 3, pp. 426–430).
[131]Hansen, P. (2002). Computers in graph theory. Graph Theory Notes of New York, XLIII, 20–39.
[132]Hansen, P. (2005). How far is, should and could be conjecture-making in graph theory an automated process? In Dimacs series in discrete mathematics and theoretical computer science : Vol. 69. Graph and discovery (pp. 189–229). Providence: AMS.
[133]Hansen, P., & Mélot, H. (2002). Computers and discovery in algebraic graph theory. Linear Algebra and Applications, 356(1–3), 211–230.
[134]Hansen, P., & Mélot, H. (2003). Variable neighborhood search for extremal graphs 6. Analysing bounds for the connectivity index. Journal of Chemical Information and Computer Sciences, 43, 1–14.
[135]Hansen, P., & Mélot, H. (2005). The irregularity of a graph. In Dimacs series in discrete mathematics and theoretical computer science : Vol. 69. Graph and discovery (pp. 253–264). Providence: AMS.
[136]Hansen, P., & Mladenović, N. (1997). Variable neighborhood search for the p-median. Location Science, 5, 207–226. · Zbl 0928.90043 · doi:10.1016/S0966-8349(98)00030-8
[137]Hansen, P., & Mladenović, N. (1999). An introduction to variable neighborhood search. In S. Voss et al. (Eds.), Metaheuristics, advances, trends in local search paradigms for optimization (pp. 433–458). Amsterdam: Kluwer.
[138]Hansen, P., & Mladenović, N. (2001a). Variable neighborhood search: principles and applications. European Journal of Operational Research, 130, 449–467. · Zbl 0981.90063 · doi:10.1016/S0377-2217(00)00100-4
[139]Hansen, P., & Mladenović, N. (2001b). J-Means: a new local search heuristic for minimum sum-of-squares clustering. Pattern Recognition, 34, 405–413. · Zbl 1012.68873 · doi:10.1016/S0031-3203(99)00216-2
[140]Hansen, P., & Mladenović, N. (2001c). Developments of variable neighborhood search. In C. Ribeiro & P. Hansen (Eds.), Essays, surveys in metaheuristics (pp. 415–440). Amsterdam: Kluwer.
[141]Hansen, P., & Mladenović, N. (2003). Variable neighborhood search. In F. Glover & G. Kochenberger (Eds.), Handbook of metaheuristics (pp. 145–184). Amsterdam: Kluwer.
[142]Hansen, P., & Mladenović, N. (2006). First improvement may be better than best improvement: An empirical study. Discrete Applied Mathematics, 154, 802–817. · Zbl 1120.90048 · doi:10.1016/j.dam.2005.05.020
[143]Hansen, P., & Mladenović, N. (2008). Complement to a comparative analysis of heuristics for the p-median problem. Statistics and Computing, 18(1), 41–46. · doi:10.1007/s11222-007-9036-9
[144]Hansen, P., & Perron, S. (2007). Algorithms for · 1 -embeddability and related problems. Journal of Classification, 24(2), 251–275. · Zbl 1180.68134 · doi:10.1007/s00357-007-0014-x
[145]Hansen, P., & Perron, S. (2008). Merging the local and global approaches to probabilistic satisfiability. International Journal of Approximate Reasoning, 47(2), 125–140. · Zbl 05683149 · doi:10.1016/j.ijar.2007.03.001
[146]Hansen, P., & Stevanović, D. (2005). Variable neighborhood search for extremal graphs 15. On bags and bugs. Discrete Applied Mathematics, 156(7), 986–997. · Zbl 1145.05028 · doi:10.1016/j.dam.2007.05.044
[147]Hansen, P., & Vukičević, D. (2006). Variable neighborhood search for extremal graphs 23. On the Randic index and the chromatic number. Les Cahiers du GERAD G-2006-58. To appear in Discrete Mathematics.
[148]Hansen, P., Jaumard, B., Mladenović, N., & Parreira, A. (2000). Variable neighborhood search for weighted maximum satisfiability problem. Les Cahiers du GERAD G–2000–62. HEC Montréal, Canada.
[149]Hansen, P., Mladenović, N., & Pérez-Brito, D. (2001). Variable neighborhood decomposition search. Journal of Heuristics, 7(4), 335–350. · Zbl 1041.68623 · doi:10.1023/A:1011336210885
[150]Hansen, P., Mladenović, N., & Urošević, D. (2004). Variable neighborhood search for the maximum clique. Discrete Applied Mathematics, 145(1), 117–125. · Zbl 1058.90053 · doi:10.1016/j.dam.2003.09.012
[151]Hansen, P., Aouchiche, M., Caporossi, G., Mélot, H., & Stevanović, D. (2005a). What forms do interesting conjectures have in graph theory? In Dimacs series in discrete mathematics and theoretical computer science : Vol. 69. Graph and discovery (pp. 231–251). Providence: AMS.
[152]Hansen, P., Mélot, H., & Gutman, I. (2005b). Variable neighborhood search for extremal graphs 12. A note on the variance of bounded degrees in graphs. MATCH Communications in Mathematical and in Computer Chemistry, 54, 221–232.
[153]Hansen, P., Mladenović, N., & Urošević, D. (2006). Variable neighborhood search and local branching. Computers and Operations Research, 33(10), 3034–3045. · Zbl 1086.90042 · doi:10.1016/j.cor.2005.02.033
[154]Hansen, P., Brimberg, J., Urošević, D., & Mladenović, N. (2007a). Primal-dual variable neighborhood search for the simple plant location problem. INFORMS Journal on Computing, 19(4), 552–564. · Zbl 1241.90072 · doi:10.1287/ijoc.1060.0196
[155]Hansen, P., Lazić, J., & Mladenović, N. (2007b). Variable neighbourhood search for colour image quantization. IMA Journal of Management Mathematics, 18(2), 207–221. · Zbl 1177.90418 · doi:10.1093/imaman/dpm008
[156]Hansen, P., Mladenović, N., & Moreno Pérez, J. A. (2008a). Variable neighborhood search. European Journal of Operational Research, 191(3), 593–595. · doi:10.1016/j.ejor.2007.02.002
[157]Hansen, P., Mladenović, N., & Moreno Pérez, J. A. (2008b). Variable neighborhood search: methods and applications. 4OR A Quarterly Journal of Operations Research, 6(4), 319–360. · Zbl 1179.90332 · doi:10.1007/s10288-008-0089-1
[158]Hansen, P., Oǧuz, C., & Mladenović, N. (2008c). Variable neighborhood search for minimum cost berth allocation. European Journal of Operational Research, 191(3), 636–649. · Zbl 1160.90497 · doi:10.1016/j.ejor.2006.12.057
[159]Hansen, P., Brimberg, J., Urošević, D., & Mladenović, N. (2009). Solving large p-median clustering problems by primal-dual variable neighborhood search. Data Mining and Knowledge Discovery. doi: 10.1007/s10618-009-0135-4 .
[160]Haugland, D. (2007). A bidirectional greedy heuristic for the subspace selection problem. In Lecture notes in computer science (Vol. 4638, pp. 162–176). Berlin: Springer.
[161]Hemmelmayr, V., Doerner, K. F., Hartl, R. F., & Savelsbergh, M. W. P. (2008). Delivery strategies for blood products supplies. OR Spectrum, 31(4), 707–725. · Zbl 1175.90273 · doi:10.1007/s00291-008-0134-7
[162]Hemmelmayr, V. C., Doerner, K. F., & Hartl, R. F. (2009). A variable neighborhood search heuristic for the periodic routing problems. European Journal of Operational Research, 195(3), 791–802. · Zbl 1156.90307 · doi:10.1016/j.ejor.2007.08.048
[163]Hertz, A., & Mittaz, M. (2001). A variable neighborhood descent algorithm for the undirected capacitated arc routing problem. Transportation Science, 35(4), 425–434. · Zbl 1069.90517 · doi:10.1287/trsc.35.4.425.10431
[164]Hertz, A., Plumettaz, M., & Zufferey, N. (2008). Variable space search for graph coloring. Discrete Applied Mathematics, 156(13), 2551–2560. · Zbl 1213.05085 · doi:10.1016/j.dam.2008.03.022
[165]Higgins, A., Beashel, G., & Harrison, A. (2006). Scheduling of brand production and shipping within a sugar supply chain. Journal of the Operational Research Society, 57, 490–498. · Zbl 1113.90323 · doi:10.1057/palgrave.jors.2602025
[166]Hindi, K. S., Fleszar, K., & Charalambous, C. (2003). An effective heuristic for the CLSP with setup times. Journal of the Operational Research Society, 54(5), 490–498. · Zbl 1070.90036 · doi:10.1057/palgrave.jors.2601525
[167]Höller, H., Melián, B., & Voss, S. (2008). Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks. European Journal of Operational Research, 191(3), 691–704. · Zbl 1160.90330 · doi:10.1016/j.ejor.2006.12.060
[168]Hu, B., & Raidl, G. R. (2008). Effective neighborhood structures for the generalized traveling salesman problem. In Lecture notes in computer science (Vol. 4972, pp. 36–47). Berlin: Springer.
[169]Hu, B., Leitner, M., & Raidl, G. R. (2008). Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. Journal of Heuristics, 14(5), 501–517. · Zbl 1211.90309 · doi:10.1007/s10732-007-9047-x
[170]Imran, A., Salhi, S., & Wassan, N. A. (2009). A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem. European Journal of Operational Research, 197(2), 509–518. · Zbl 1159.90525 · doi:10.1016/j.ejor.2008.07.022
[171]Irnich, S., Funke, B., & Grünert, T. (2006). Sequential search and its application to vehicle-routing problems. Computers and Operations Research, 33(8), 2405–2429. · Zbl 1086.90064 · doi:10.1016/j.cor.2005.02.020
[172]Jabalameli, M. S., & Ghaderi, A. (2008). Hybrid algorithms for the uncapacitated continuous location-allocation problem. The International Journal of Advanced Manufacturing Technology, 37(1–2), 202–209. · doi:10.1007/s00170-007-0944-9
[173]Jarboui, B., Eddaly, M., & Siarry, P. (2009). An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. Computers and Operations Research, 36(9), 2638–2646. · Zbl 1179.90138 · doi:10.1016/j.cor.2008.11.004
[174]Joly, A., & Frein, Y. (2008). Heuristics, for, an, industrial, car, sequencing, problem, considering, paint, and, assembly, shop, objectives. Computers and Industrial Engineering, 55(2), 295–310. · doi:10.1016/j.cie.2007.12.014
[175]Jornsten, K., & Lokketangen, A. (1997). Tabu, search, for, weighted, k-cardinality, trees. Asia-Pacific Journal of Operational Research, 14(2), 9–26.
[176]Jovanović, D., Mladenović, N., & Ognjanović, Z. (2007). Variable neighborhood search for the probabilistic satisfiability problem. In K. F. Doerner, M. Gendreau, P. Greistorfer, W. Gutjahr, R. F. Hartl, & M. Reimann (Eds.), Metaheuristics. Progress in complex systems optimization (pp. 173–188). Berlin: Springer.
[177]Karam, A., Caporossi, G., & Hansen, P. (2007). Arbitrary-norm hyperplane separation by Variable Neighbourhood Search. IMA Journal of Management Mathematics, 18(2), 173–190. · Zbl 1177.90376 · doi:10.1093/imaman/dpm014
[178]Kawashimo, S., Ono, H., Sadakane, K., & Yamashita, M. (2006). DNA sequence design by dynamic neighborhood searches. In Lecture notes in computer science (Vol. 4287, pp. 157–171). Berlin: Springer.
[179]Kolisch, R., & Hartmann, S. (2006). Experimental investigation of heuristics for resource-constrained project scheduling: an update. European Journal of Operational Research, 174(1), 23–37. · Zbl 1116.90047 · doi:10.1016/j.ejor.2005.01.065
[180]Kucherenko, S., Belotti, P., Liberti, L., & Maculan, N. (2007). New formulations for the Kissing number problem. Discrete Applied Mathematics, 155(14), 1837–1841. · Zbl 1144.90455 · doi:10.1016/j.dam.2006.05.012
[181]Kytöjoki, J., Nuortio, T., Bräysy, O., & Gendreau, M. (2007). An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Computers and Operations Research, 34(9), 2743–2757. · Zbl 1141.90429 · doi:10.1016/j.cor.2005.10.010
[182]Lapierre, S. D., Ruiz, A. B., & Soriano, P. (2004). Designing distribution networks: Formulations and solution heuristic. Transportation Science, 38(2), 174–187. · doi:10.1287/trsc.1030.0064
[183]Lejeune, M. A. (2006). A variable neighborhood decomposition search method for supply chain management planning problems. European Journal of Operational Research, 175(2), 959–976. · Zbl 1142.90424 · doi:10.1016/j.ejor.2005.05.021
[184]Liang, Y.-C., & Chen, Y. C. (2007). Redundancy allocation of series-parallel systems using a variable neighborhood search algorithm. Reliability Engineering and System Safety, 92(3), 323–331. · doi:10.1016/j.ress.2006.04.013
[185]Liang, Y.-C., Lo, M.-H., & Chen, Y. C. (2007). Variable neighbourhood search for redundancy allocation problems. IMA Journal of Management Mathematics, 18(2), 135–156. · Zbl 1153.91612 · doi:10.1093/imaman/dpm010
[186]Liao, C. J., & Cheng, C. C. (2007). A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date. Computers and Industrial Engineering, 52(4), 404–413. · doi:10.1016/j.cie.2007.01.004
[187]Liao, C.-J., & Liao, C.-C. (2008). An ant colony optimisation algorithm for scheduling in agile manufacturing. International Journal of Production Research, 46(7), 1813–1824. · Zbl 1153.90429 · doi:10.1080/00207540600969782
[188]Liao, C. J., Chao-Tang, T., & Luarn, P. (2007). A discrete version of particle swarm optimization for flowshop scheduling problems. Computers and Operations Research, 34(10), 3099–3111. · Zbl 1185.90083 · doi:10.1016/j.cor.2005.11.017
[189]Liberti, L., Lavor, C., Maculan, N., & Marinelli, F. (2009). Double variable neighbourhood search with smoothing for the molecular distance geometry problem. Journal of Global Optimization, 43(2–3), 207–218. · Zbl 1169.90470 · doi:10.1007/s10898-007-9218-1
[190]Lin, S.-W., & Ying, K.-C. (2008). A hybrid approach for single-machine tardiness problems with sequence-dependent setup times. Journal of the Operational Research Society, 59(8), 1109–1119. · doi:10.1057/palgrave.jors.2602434
[191]Ling, A., Xu, C., & Tang, L. (2008). A modified VNS metaheuristic for max-bisection problems. Journal of Computational and Applied Mathematics, 220(1–2), 413–421. · Zbl 1148.65040 · doi:10.1016/j.cam.2007.08.018
[192]Liu, H., & Abraham, A. (2007). An hybrid fuzzy variable neighborhood particle swarm optimization algorithm for solving quadratic assignment problems. Journal of Universal Computer Science, 13(9), 1309–1331.
[193]Liu, S.-C., & Chung, C.-H. (2009). A heuristic method for the vehicle routing problem with backhauls and inventory. Journal of Intelligent Manufacturing, 20(1), 29–42. · doi:10.1007/s10845-008-0101-9
[194]Liu, H. B., Abraham, A., Choi, O., & Moon, S. H. (2006). Variable neighborhood particle swarm optimization for multi-objective flexible job-shop scheduling problems. In Lecture notes in computer science (Vol. 4247, pp. 197–204). Berlin: Springer.
[195]Liu, S.-X., Liu, L., & Zhang, T. (2008). Variable neighborhood search for solving vehicle routing problems with backhauls and time windows. Journal of Northeastern University, 29(3), 316–319.
[196]Ljubic, I. (2007). A hybrid VNS for connected facility location. In Lecture notes in computer science (Vol. 4771, pp. 157–169). Berlin: Springer.
[197]Loudni, S., & Boizumault, P. (2008). Combining VNS with constraint programming for solving anytime optimization problems. European Journal of Operational Research, 191(3), 705–735. · Zbl 1160.90661 · doi:10.1016/j.ejor.2006.12.062
[198]Loudni, S., Boizumault, P., & David, P. (2006). On-line resources allocation for ATM networks with rerouting. Computers and Operations Research, 33(10), 2891–2917. · Zbl 1086.90502 · doi:10.1016/j.cor.2005.01.016
[199]Lusa, A., & Potts, C. N. (2008). A variable neighbourhood search algorithm for the constrained task allocation problem. Journal of the Operational Research Society, 59, 812–822. · Zbl 1153.90448 · doi:10.1057/palgrave.jors.2602413
[200]Mansini, R., & Tocchella, B. (2009). The traveling purchaser problem with budget constraint. Computers and Operations Research, 36(7), 2263–2274. · Zbl 1158.90416 · doi:10.1016/j.cor.2008.09.001
[201]Martins, P., & de Souza, M. C. (2009). VNS and second order heuristics for the min-degree constrained minimum spanning tree problem. Computers and Operations Research, 36(11), 2969–2982. · Zbl 1162.90577 · doi:10.1016/j.cor.2009.01.013
[202]Melechovsky, J., Prins, C., & Calvo, R. (2005). A metaheuristic to solve a location-routing problem with non-linear costs. Journal of Heuristics, 11(5–6), 375–391. · Zbl 1122.90382 · doi:10.1007/s10732-005-3601-1
[203]Melián, B. (2006). Using memory to improve the VNS metaheuristic for the design of SDH/WDM networks. In Lecture notes in computer science (Vol. 4030, pp. 82–93). Berlin: Springer.
[204]Melián, B., & Mladenović, N. (2007). Editorial. IMA Journal of Management Mathematics, 18(2), 99–100. · doi:10.1093/imaman/dpm017
[205]Melián, B., Höller, H., & Voss, S. (2008). Designing WDM networks by a variable neighborhood search. Journal of Telecommunications and Information Technology, 4/2006, 15–20.
[206]Meric, L., Pesant, G., & Pierre, S. (2004). Variable neighborhood search for optical routing in networks using latin routers. Annales des Télécommunications/Annals of Telecommunications, 59(3–4), 261–286.
[207]Mitrovic-Minic, S., & Punnen, A. P. (2009). Local search intensified: very large-scale Variable Neighborhood Search for the multi-resource generalized assignment problem. Discrete Optimization. doi: 10.1016/j.disopt.2009.04.004 .
[208]Mladenović, N. (1995). A variable neighborhood algorithm–a new metaheuristic for combinatorial optimization. Abstracts of papers presented at Optimization days (p. 112). Montréal.
[209]Mladenović, N. (2005). Formulation space search–a new approach to optimization (plenary talk). In J. Vuleta (Ed.), Proceedings of XXXII SYMOPIS’05 (pp. 3). Vrnjacka BanjA., Serbia.
[210]Mladenović, N., & Hansen, P. (1997). Variable neighborhood search. Computers and Operations Research, 24, 1097–1100. · Zbl 0889.90119 · doi:10.1016/S0305-0548(97)00031-2
[211]Mladenović, N., & Urošević, D. (2003). Variable neighborhood search for the k-cardinality tree. Applied Optimization, 86, 481–500.
[212]Mladenović, N., Labbé, M., & Hansen, P. (2003a). Solving the p-center problem by tabu search and Variable Neighborhood Search. Networks, 42, 48–64. · Zbl 1036.90046 · doi:10.1002/net.10081
[213]Mladenović, N., Petrović, J., Kovačević-Vujčić, V., & Čangalović, M. (2003b). Solving spread spectrum radar polyphase code design problem by tabu search and variable neighborhood search. European Journal of Operational Research, 151, 389–399. · Zbl 1053.90055 · doi:10.1016/S0377-2217(02)00833-0
[214]Mladenović, N., Plastria, F., & Urošević, D. (2005). Reformulation descent applied to circle packing problems. Computers and Operations Research, 32, 2419–2434. · Zbl 1066.90092 · doi:10.1016/j.cor.2004.03.010
[215]Mladenović, N., Brimberg, J., Hansen, P., & Moreno Pérez, J. A. (2007a). The p-median problem: a survey of metaheuristic approaches. European Journal of Operational Research, 179(3), 927–939. · Zbl 1163.90610 · doi:10.1016/j.ejor.2005.05.034
[216]Mladenović, N., Plastria, F., & Uroševic, D. (2007b). Formulation space search for circle packing problems. In Lecture notes on computer science (Vol. 4638, pp. 212–216). Berlin: Springer.
[217]Mladenović, N., Dražić, M., Kovačevic-Vujčić, V., & Čangalović, M. (2008). General variable neighborhood search for the continuous optimization. European Journal of Operational Research, 191(3), 753–770. · Zbl 1156.90005 · doi:10.1016/j.ejor.2006.12.064
[218]Mladenović, N., Urošević, D., Pérez-Brito, D., & García-González, C. G. (2009). Variable neighbourhood search for bandwidth reduction. European Journal of Operational Research. doi: 10.1016/j.ejor.2008.12.015 .
[219]Montemanni, R., & Smith, D. H. (2008). Construction of constant GC-content DNA codes via a Variable Neighbourhood Search algorithm. Journal of Mathematical Modelling and Algorithms, 7(3), 311–326. · Zbl 1191.68229 · doi:10.1007/s10852-008-9087-8
[220]Moreno-Pérez, J. A., Moreno-Vega, J. M., & Rodríguez-Martín, I. (2003). Variable neighborhood tabu search and its application to the median cycle problem. European Journal of Operational Research, 151(2), 365–378. · Zbl 1053.90056 · doi:10.1016/S0377-2217(02)00831-7
[221]Moreno-Pérez, J. A., Hansen, P., & Mladenović, N. (2005). Parallel variable neighborhood search. In E. Alba (Ed.), Parallel metaheuristics: a new class of algorithms. New York: Wiley.
[222]Moreno-Vega, J. M., & Melián, B. (2008). Introduction to the special issue on variable neighborhood search. Journal of Heuristics, 14(5), 403–404. · doi:10.1007/s10732-007-9044-0
[223]Mori, H., & Tsunokawa, S. (2005). Variable neighborhood tabu search for capacitor placement in distribution systems. IEEE International Symposium on Circuits and Systems, 5, 4747–4750. · doi:10.1109/ISCAS.2005.1465693
[224]Naderi, B., Zandieh, M., & Fatemi Ghomi, S. M. T. (2008). A study on integrating sequence dependent setup time flexible flow lines and preventive maintenance scheduling. Journal of Intelligent Manufacturing. doi: 10.1007/s10845-008-0157-6 .
[225]Negreiros, M., & Palhano, A. (2006). The capacitated centred clustering problem. Computers and Operations Research, 33(6), 1639–1663. · Zbl 1087.90088 · doi:10.1016/j.cor.2004.11.011
[226]Nuortio, T., Kytöjoki, J., Niska, H., & Bräysy, O. (2006). Improved route planning and scheduling of waste collection and transport. Expert Systems with Applications, 30(2), 223–232. · doi:10.1016/j.eswa.2005.07.009
[227]Ochi, L. S., Silva, M. B., & Drummond, L. (2001). Metaheuristics based on GRASP and VNS for solving traveling purchaser problem. In MIC’2001 (pp. 489–494). Porto.
[228]Ognjanović, Z., Midić, S., & Mladenović, N. (2005). A hybrid genetic and variable neighborhood descent for probabilistic SAT problem. In Lecture notes in computer science (Vol. 3636, pp. 42–53). Berlin: Springer.
[229]Osman, I. H., & Ahmadi, S. (2007). Guided construction search metaheuristics for the capacitated p-median problem with single source constraint. Journal of the Operational Research Society, 58(1), 100–114. · Zbl 1152.90509 · doi:10.1057/palgrave.jors.2602135
[230]Pacheco, J., Casado, S., & Nuñez, L. (2007). Use of VNS and TS in classification: variable selection and determination of the linear discrimination function coefficients. IMA Journal of Management Mathematics, 18(2), 191–206. · Zbl 1177.90421 · doi:10.1093/imaman/dpm012
[231]Pacheco, J. A., Casado, S., Alegre, J. F., & Álvarez, A. (2008). Heuristic solutions for locating health resources. IEEE Intelligent Systems, 23(1), 57–63. · Zbl 05334006 · doi:10.1109/MIS.2008.8
[232]Pan, Q.-K., Wang, W.-H., & Zhu, J.-Y. (2007a). Some meta-heuristics for no-wait flow shop problem. Computer Integrated Manufacturing Systems, CIMS, 13(5), 967–970.
[233]Pan, Q.-K., Wang, W.-H., Zhu, J.-Y., & Zhao, B.-H. (2007b). Hybrid heuristics based on particle swarm optimization and variable neighborhood search for job shop scheduling. Computer Integrated Manufacturing Systems, CIMS, 13(2), 323–328.
[234]Papadimitriou, C. (1994). Computational complexity. Reading: Addison-Wesley.
[235]Paraskevopoulos, D. C., Repoussis, P. P., Tarantilis, C. D., Ioannou, G., & Prastacos, G. P. (2008). A reactive variable neighborhood tabu search for the heterogeneous fleet routing problem with time windows. Journal of Heuristics, 14(5), 425–455. · Zbl 1211.90313 · doi:10.1007/s10732-007-9045-z
[236]Parreño, F., Alvarez-Valdes, R., Oliveira, J. F., & Tamarit, J. M. (2008). Neighborhood structures for the container loading problem: a VNS implementation. Journal of Heuristics. doi: 10.1007/s10732-008-9081-3 .
[237]Pelta, D., González, J. R., & Moreno-Vega, J. M. (2008). A simple and fast heuristic for protein structure comparison. BMC Bioinformatics, 9, 161. · doi:10.1186/1471-2105-9-161
[238]Pérez, M., Almeida Rodríguez, F., & Moreno-Vega, J. M. (2007). A hybrid VNS-path relinking for the p-hub median problem. IMA Journal of Management Mathematics, 18(2), 157–172. · Zbl 1177.90252 · doi:10.1093/imaman/dpm013
[239]Plastria, F., Mladenović, N., & Urošević, D. (2005). Variable neighborhood formulation space search for circle packing. In 18th mini Euro conference VNS. Tenerife, Spain.
[240]Plastria, F., De Bruyne, S., & Carrizosa, E. (2009). Alternating local search based VNS for linear classification. Annals of Operations Research. doi: 10.1007/s10479-009-0538-z .
[241]Polacek, M., Hartl, R. F., Doerner, K., & Reimann, M. (2004). A variable neighborhood search for the multi depot vehicle routing problem with time windows. Journal of Heuristics, 10(6), 613–627. · doi:10.1007/s10732-005-5432-5
[242]Polacek, M., Doerner, K. F., Hartl, R. F., Kiechle, G., & Reimann, M. (2007). Scheduling periodic customer visits for a traveling salesperson. European Journal of Operational Research, 179(3), 823–837. · Zbl 1163.90506 · doi:10.1016/j.ejor.2005.03.056
[243]Polacek, M., Doerner, K. F., Hartl, R. F., & Maniezzo, V. (2008). A variable neighborhood search for the capacitated arc routing problem with intermediate facilities. Journal of Heuristics, 14(5), 405–423. · Zbl 1211.90314 · doi:10.1007/s10732-007-9050-2
[244]Polo-Corpa, M. J., Salcedo-Sanz, S., Pérez-Bellido, A. M., López-Espí, P., Benavente, R., & Pérez, E. (2009). Curve fitting using heuristics and bio-inspired optimization algorithms for experimental data processing in chemistry. Chemometrics and Intelligent Laboratory Systems, 96(1), 34–42. · doi:10.1016/j.chemolab.2008.11.004
[245]Popper, K. (1959). The logic of scientific discovery. London: Hutchinson.
[246]Prandtstetter, M., & Raidl, G. R. (2008). An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem. European Journal of Operational Research, 191(3), 1004–1022. · Zbl 1156.90321 · doi:10.1016/j.ejor.2007.04.044
[247]Puchinger, J., & Raidl, G. R. (2008). Bringing order into the neighborhoods: relaxation guided variable neighborhood search. Journal of Heuristics, 14(5), 405–423. · Zbl 1211.90315 · doi:10.1007/s10732-007-9048-9
[248]Puchinger, J., Raidl, G. R., & Pferschy, U. (2006). The core concept for the multidimensional knapsack problem. In Lecture notes in computer science (Vol. 3906, pp. 195–208). Berlin: Springer.
[249]Qian, B., Wang, L., Huang, D. X., & Wang, X. (2006). Multi-objective flow shop scheduling using differential evolution. In Lecture notes in control and information sciences (Vol. 345, pp. 1125–1136). Berlin: Springer.
[250]Rahimi-Vahed, A., Dangchi, M., Rafiei, H., & Salimi, E. (2009). A novel hybrid multi-objective shuffled frog-leaping algorithm for a bi-criteria permutation flow shop scheduling problem. International Journal of Advanced Manufacturing Technology, 41(11–12), 1227–1239. · doi:10.1007/s00170-008-1558-6
[251]Reeves, C. R. (Ed.) (1993). Modern heuristic techniques for combinatorial problems. Oxford: Blackwell Scientific.
[252]Reinelt, G. (1991). TSLIB–A traveling salesman library. ORSA Journal on Computing, 3, 376–384.
[253]Remde, S., Cowling, P., Dahal, K., & Colledge, N. (2007). Exact/heuristic hybrids using rVNS and hyperheuristics for workforce scheduling. In Lecture notes in computer science (Vol. 4446, pp. 188–197). Berlin: Springer.
[254]Repoussis, P. P., Paraskevopoulos, D. C., Tarantilis, C. D., & Ioannou, G. (2006). A reactive greedy randomized variable neighborhood tabu search for the vehicle routing problem with time windows. In Lecture notes in computer science (Vol. 4030, pp. 134–138). Berlin: Springer.
[255]Repoussis, P. P., Tarantilis, C. D., & Ioannouo, G. (2007). A hybrid metaheuristic for a real life vehicle routing problem. In Lecture notes in computer science (Vol. 4310, pp. 247–254). Berlin: Springer.
[256]Ribeiro, C. C., & de Souza, M. C. (2002). Variable neighborhood search for the degree-constrained minimum spanning tree problem. Discrete Applied Mathematics, 118(1–2), 43–54. · Zbl 0994.90123 · doi:10.1016/S0166-218X(01)00255-4
[257]Ribeiro, C. C., & Vianna, D. S. (2005). A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure. International Transactions in Operational Research, 12(3), 325–338. · Zbl 1063.92039 · doi:10.1111/j.1475-3995.2005.498_1.x
[258]Ribeiro, C. C., Uchoa, E., & Werneck, R. (2002). A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS Journal on Computing, 14(3), 228–246. · Zbl 1238.90117 · doi:10.1287/ijoc.14.3.228.116
[259]Ribeiro, C. C., Martins, S. L., & Rosseti, I. (2007). Metaheuristics for optimization problems in computer communications. Computer Communications, 30(4), 656–669. · Zbl 05397866 · doi:10.1016/j.comcom.2006.08.027
[260]Ribeiro, C. C., Aloise, D., Noronha, T. F., Rocha, C., & Urrutia, S. (2008a). A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints. European Journal of Operational Research, 191(3), 981–992. · Zbl 1156.90322 · doi:10.1016/j.ejor.2007.04.034
[261]Ribeiro, C. C., Aloise, D., Noronha, T. F., Rocha, C., & Urrutia, S. (2008b). An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem. European Journal of Operational Research, 191(3), 596–611. · Zbl 1156.90377 · doi:10.1016/j.ejor.2007.02.003
[262]Roshanaei, V., Naderi, B., Jolai, F., & Khalili, M. (2009). A variable neighborhood search for job shop scheduling with set-up times to minimize makespan. Future Generation Computer Systems, 25(6), 654–661. · doi:10.1016/j.future.2009.01.004
[263]Rousseau, L. M., Gendreau, M., & Pesant, G. (2002). Using constraint-based operators to solve the vehicle routing problem with time windows. Journal of Heuristics, 8(1), 43–58. · Zbl 1073.90056 · doi:10.1023/A:1013661617536
[264]Santana, R., Larrañaga, P., & Lozano, J. A. (2008). Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem. Journal of Heuristics, 14(5), 519–547. · Zbl 1211.90316 · doi:10.1007/s10732-007-9049-8
[265]Schilde, M., Doerner, K. F., Hartl, R. F., & Kiechle, G. (2009). Metaheuristics for the bi-objective orienteering problem. Swarm Intelligence, 3(3), 179–201. · doi:10.1007/s11721-009-0029-5
[266]Schmid, V., Doerner, K. F., Hartl, R. F., & Salazar-González, J. J. (2008). Hybridization of very large neighborhood search for ready-mixed concrete delivery problems. Computers and Operations Research. doi: 10.1016/j.cor.2008.07.010 .
[267]Sedlar, J., Vukičević, D., Aouchiche, M., & Hansen, P. (2007a). Variable neighborhood search for extremal graphs 24. Conjectures and results about the clique number. Les Cahiers du GERAD G-2007-33.
[268]Sedlar, J., Vukičević, D., Aouchiche, M., & Hansen, P. (2007b). Variable neighborhood search for extremal graphs 25. Products of connectivity and distance measures. Les Cahiers du GERAD G-2007-47.
[269]Sevkli, M., & Aydin, M. E. (2006a). A variable neighbourhood search algorithm for job shop scheduling problems. In Lecture notes in computer science (Vol. 3906, pp. 261–271). Berlin: Springer.
[270]Sevkli, M., & Aydin, M. E. (2006b). Variable Neighbourhood Search for job shop scheduling problems. Journal of Software, 1(2), 34–39. · doi:10.4304/jsw.1.2.34-39
[271]Sevkli, M., & Aydin, M. E. (2007). Parallel variable neighbourhood search algorithms for job shop scheduling problems. IMA Journal of Management Mathematics, 18(2), 117–134. · Zbl 1177.90182 · doi:10.1093/imaman/dpm009
[272]Sevkli, Z., & Sevilgen, F. E. (2006). Variable neighborhood search for the orienteering problem. In Lecture notes in computer science (Vol. 4263, pp. 134–143). Berlin: Springer.
[273]Sevkli, Z., & Sevilgen, F. E. (2008). A hybrid particle swarm optimization algorithm for function optimization. In Lecture notes in computer science (Vol. 4974, pp. 585–595). Berlin: Springer.
[274]Stevanovic, D., Aouchiche, M., & Hansen, P. (2008). On the spectral radius of graphs with a given domination number. Linear Algebra and Its Applications, 428(8–9), 1854–1864. · Zbl 1143.05042 · doi:10.1016/j.laa.2007.10.024
[275]Subramanian, A., & Dos Anjos Formiga Cabral, L. (2008). An ILS based heuristic for the vehicle routing problem with simultaneous pickup and delivery and time limit. In Lecture notes in computer science (Vol. 4972, pp. 135–146). Berlin: Springer.
[276]Tagawa, K., Ohtani, T., Igaki, T., Seki, S., & Inoue, K. (2007). Robust optimum design of SAW filters by the penalty function method. Electrical Engineering in Japan, 158(3), 45–54. · doi:10.1002/eej.20469
[277]Tasgetiren, M. F., Sevkli, M., Liang, Y.-C., & Gencyilmaz, G. (2004). Particle swarm optimization algorithm for permutation flowshop sequencing problem. In Lecture notes in computer science (Vol. 3172, pp. 382–389). Berlin: Springer.
[278]Tasgetiren, M. F., Liang, Y.-C., Sevkli, M., & Gencyilmaz, G. (2007). A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research, 177(3), 1930–1947. · Zbl 1110.90044 · doi:10.1016/j.ejor.2005.12.024
[279]Tavakkoli-Moghaddam, R., Safaei, N., & Sassani, F. (2009). A memetic algorithm for the flexible flow line scheduling problem with processor blocking. Computers and Operations Research, 36(2), 402–414. · Zbl 1157.90428 · doi:10.1016/j.cor.2007.10.011
[280]Toksari, A. D., & Güner, E. (2007). Solving the unconstrained optimization problem by a variable neighborhood search. Journal of Mathematical Analysis and Applications, 328(2), 1178–1187. · Zbl 05124023 · doi:10.1016/j.jmaa.2006.06.025
[281]Tseng, C.-T., Liao, C.-J., & Huang, K.-L. (2009). Minimizing total tardiness on a single machine with controllable processing times. Computers and Operations Research, 36(6), 1852–1858. · Zbl 1179.90159 · doi:10.1016/j.cor.2008.05.009
[282]Urošević, D., Brimberg, J., & Mladenović, N. (2004). Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem. Computers and Operations Research, 31(8), 1205–1213. · Zbl 1068.68108 · doi:10.1016/S0305-0548(03)00073-X
[283]Vogt, L., Poojari, C. A., & Beasley, J. E. (2007). A tabu search algorithm for the single vehicle routing allocation problem. Journal of the Operational Research Society, 58, 467–480. · Zbl 1211.90319 · doi:10.1057/palgrave.jors.2602165
[284]Wang, X., & Tang, L. (2009). A population-based variable neighborhood search for the single machine total weighted tardiness problem. Computers and Operations Research, 36(6), 2105–2110. · Zbl 1179.90163 · doi:10.1016/j.cor.2008.07.009
[285]Whitaker, R. (1983). A fast algorithm for the greedy interchange of large-scale clustering and median location problems. INFOR, 21, 95–108.
[286]Wollenweber, J. (2008). A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application. OR Spectrum, 30(4), 655–673. · Zbl 1193.90146 · doi:10.1007/s00291-007-0114-3
[287]Xhafa, F. (2007). A hybrid evolutionary heuristic for job scheduling on computational grids. Studies in Computational Intelligence, 75, 269–311. · doi:10.1007/978-3-540-73297-6_11
[288]Yang, J., Zhang, J., Aydin, M. E., & Wu, J. Y. (2007). A novel programming model and optimisation algorithms for WCDMA networks. In IEEE vehicular technology conference (pp. 1182–1187).
[289]Yepes, V., & Medina, J. (2006). Economic heuristic optimization for heterogeneous fleet VRPHESTW. Journal of Transportation engineering, 132(4), 303–311. · doi:10.1061/(ASCE)0733-947X(2006)132:4(303)
[290]Zhang, C., Lin, Z., & Lin, Z. (2005). Variable neighborhood search with permutation distance for QAP. In Lecture notes in computer science (Vol. 3684, pp. 81–88). Berlin: Springer.
[291]Zhao, Q. H., Chen, S., & Zang, C. Y. (2008). Model and algorithm for inventory/routing decision in a three-echelon logistics system. European Journal of Operational Research, 191(3), 627–635. · Zbl 1160.90326 · doi:10.1016/j.ejor.2006.12.056
[292]Zobolas, G. I., Tarantilis, C. D., & Ioannou, G. (2009a). Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. Computers and Operations Research, 36(4), 1249–1267. · Zbl 1160.90490 · doi:10.1016/j.cor.2008.01.007
[293]Zobolas, G. I., Tarantilis, C. D., & Ioannou, G. (2009b). A hybrid evolutionary algorithm for the job shop scheduling problem. Journal of the Operational Research Society, 60(2), 221–235. · Zbl 1168.90480 · doi:10.1057/palgrave.jors.2602534