×

zbMATH — the first resource for mathematics

Variable neighbourhood search: Methods and applications. (English) Zbl 1179.90332
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 by the first two authors [Comput. Oper. Res. 24, No. 11, 1097–1100 (1997; Zbl 0889.90119)] 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:
90C59 Approximation methods and heuristics in mathematical programming
68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68W25 Approximation algorithms
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Abraham A, Liu H, Zhao M (2008) Particle swarm scheduling for work-flow applications in distributed computing environments. Stud Comput Intell 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. Stat Comput 16(3): 251–260 · doi:10.1007/s11222-006-8079-7
[3] Almada-Lobo B, Oliveira JF, Carravilla MA (2008) Production planning and scheduling in the glass container industry: A VNS approach. Int J Prod Econ 114(1): 363–375 · doi:10.1016/j.ijpe.2007.02.052
[4] Aloise DJ, Aloise D, Rocha CTM, Ribeiro CC, Ribeiro JC, Moura LSS (2006) Scheduling workover rigs for onshore oil production. Discrete Appl Math 154(5): 695–702 · Zbl 1120.90015 · doi:10.1016/j.dam.2004.09.021
[5] Andreatta A, Ribeiro C (2002) Heuristics for the phylogeny problem. J Heuristics 8(4): 429–447 · Zbl 1041.68546 · doi:10.1023/A:1015439913121
[6] Anghinolfi D, Paolucci M (2007) Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach. Comput Oper Res 34(11): 3471–3490 · Zbl 1127.90020 · doi:10.1016/j.cor.2006.02.009
[7] Aouchiche M, Hansen P (2005) Recherche à voisinage variable de graphes extrèmes 13. À propos de la maille (French). RAIRO Oper Res 39: 275–293 · Zbl 1132.05032 · doi:10.1051/ro:2006006
[8] Aouchiche M, Hansen P (2007a) Automated results and conjectures on average distance in graphs. Graph Theory Paris Trends Math VI: 21–36 · Zbl 1114.05050 · doi:10.1007/978-3-7643-7400-6_3
[9] Aouchiche M, Hansen P (2007b) On a conjecture about the Randic index. Discrete Math 307: 262–265 · Zbl 1110.05051 · doi:10.1016/j.disc.2006.06.025
[10] Aouchiche M, Hansen P (2008) Nordhaus-Gaddum relations for proximity and remoteness in graphs. Les Cahiers du GERAD G-2008-36 · Zbl 1193.05092
[11] Aouchiche M, Hansen P (2009) Bounding average distance using minimum degree. Graph Theory Notes New York (in press)
[12] Aouchiche M, Caporossi G, Cvetković D (2001) Variable neighborhood search for extremal graphs 8. Variations on Graffiti 105. Congressus Numerantium 148: 129–144 · Zbl 0994.05078
[13] Aouchiche M, Bonnefoy JM, Fidahoussen A, Caporossi G, Hansen P, Hiesse L, Lacheré J, Monhait A (2005) Variable neighborhood search for extremal graphs 14. The AutoGraphiX 2 system. In: Liberti L, Maculan N (eds) Global Optimization: from Theory to Implementation. Springer, Berlin, pp 281–309 · Zbl 1100.90052
[14] Aouchiche M, Caporossi G, Hansen P, Laffay M (2005b) AutoGraphiX: a survey. Electron Notes Discrete Math 22: 515–520 · Zbl 1200.05002 · doi:10.1016/j.endm.2005.06.090
[15] Aouchiche M, Hansen P, Zheng M (2006) Variable neighborhood search for extremal graphs 18. Conjectures and results about the Randic index MATCH. Commun Math Comput Chem 56(3): 541–550 · Zbl 1274.05236
[16] Aouchiche M, Caporossi G, Hansen P (2007a) Variable Neighborhood search for extremal graphs 20. Automated comparison of graph invariants. MATCH. Commun Math Comput Chem 58(2): 365–384 · Zbl 1274.05235
[17] 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 · Zbl 1274.05235
[18] 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
[19] Aouchiche M, Hansen P, Zheng M (2007d) Variable Neighborhood Search for Extremal Graphs 19. Further Conjectures and Results about the Randic Index. MATCH. Commun Math Comput Chem 58(1): 83–102 · Zbl 1142.05014
[20] Aouchiche M, Bell FK, Cvetković D, Hansen P, Rowlinson P, Simić SK, Stevanović D (2008a) Variable neighborhood search for extremal graphs 16. Some conjectures related to the largest eigenvalue of a graph. Eur J Oper Res 191(3): 661–676 · Zbl 1160.90494 · doi:10.1016/j.ejor.2006.12.059
[21] Aouchiche M, Brinkmann G, Hansen P (2008b) Variable neighborhood search for extremal graphs 21. Conjectures and results about the independence number. Discrete Appl Math 156(13): 2530–2542 · Zbl 1173.05022 · doi:10.1016/j.dam.2008.03.011
[22] Aouchiche M, Favaron O, Hansen P (2009a) Variable neighborhood search for extremal graphs 22. Extending bounds for independence to upper irredundance. Discrete Appl Math (in press) · Zbl 1227.05169
[23] Aouchiche M, Hansen P, Stevanović D (2009b) Variable neighborhood search for extremal graphs 17. Further conjectures and results about the index Discusiones Mathematicae: Graph Theory (in press) · Zbl 1229.05128
[24] Archetti C, Hertz A, Speranza MG (2007) Metaheuristics for the team orienteering problem. J Heuristics 13(1): 49–76 · Zbl 05193457 · doi:10.1007/s10732-006-9004-0
[25] Audet C, Brimberg J, Hansen P, Mladenović N (2004) Pooling problem: alternate formulation and solution methods. Manage Sci 50: 761–776 · Zbl 1232.90349 · doi:10.1287/mnsc.1030.0207
[26] Audet C, Báchard V, Le Digabel S (2008) Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search. J Global Optim 41(2): 299–318 · Zbl 1157.90535 · doi:10.1007/s10898-007-9234-1
[27] Avanthay C, Hertz A, Zufferey N (2003) A variable neighborhood search for graph coloring. Eur J Oper Res 151(2): 379–388 · Zbl 1053.90050 · doi:10.1016/S0377-2217(02)00832-9
[28] Aydin ME, Sevkli M (2008) Sequential and parallel variable neighborhood search algorithms for job shop scheduling. Stud Comput Intell 128: 125–144 · Zbl 1151.90391 · doi:10.1007/978-3-540-78985-7_6
[29] Baum EB (1986) Toward practical ’neural’ computation for combinatorial optimization problems. In: Denker J (ed) Neural networks for computing. American Institute of Physics, College Park (1986)
[30] Belacel N, Hansen P, Mladenović N (2002) Fuzzy J-means: a new heuristic for fuzzy clustering. Pattern Recognit 35(10): 2193–2200 · Zbl 1006.68882 · doi:10.1016/S0031-3203(01)00193-5
[31] 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
[32] Belacel N, Čuperlović-Culf M, Ouellette R, Boulassel MR (2004b) The variable neighborhood search metaheuristic for fuzzy clustering cDNA microarray gene expression data. In: Hamza MH (eds) Artificial Intelligence and Applications. Acta Press, Calgary
[33] Belacel N, Raval HB, Punnen AP (2007) Learning multicriteria fuzzy classification method PROAFTN from data. Comput Oper Res 34(7): 1885–1898 · Zbl 1186.68353 · doi:10.1016/j.cor.2005.07.019
[34] Belhaiza S, de Abreu N, Hansen P, Oliveira C (2007) Variable neighborhood search for extremal graphs 11. Bounds on algebraic connectivity. In: Avis D, Hertz A, Marcotte O (eds) Graph Theory and Combinatorial Optimization, pp 1–16 · Zbl 1096.05027
[35] Beltrán JD, Calderón JE, Jorge-Cabrera R, Moreno-Pérez JA, Moreno-Vega JM (2004) GRASP-VNS hybrid for the strip packing problem. In Hybrid Metaheuristics 2004, pp 79–90
[36] Benati S (2008) Categorical data fuzzy clustering: an analysis of local search heuristics. Comput Oper Res 35(3): 766–775 · Zbl 1278.90484 · doi:10.1016/j.cor.2006.05.001
[37] Benati S, Hansen P (2002) The maximum capture problem with random utilities: problem formulation and algorithms. Eur J Oper Res 143(3): 518–530 · Zbl 1082.90543 · doi:10.1016/S0377-2217(01)00340-X
[38] Bischoff M, Dächert K (2008) Allocation search methods for a generalized class of location-allocation problems. Eur J Oper Res 192(3): 793–807 · Zbl 1157.90486 · doi:10.1016/j.ejor.2007.10.022
[39] Blazewicz J, Pesch E, Sterna M, Werner F (2005) Metaheuristics for late work minimization in two-machine flow shop with common due date. Lect Notes Artif Intell 3698: 222–234 · Zbl 1137.90482
[40] 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. Comput Oper Res 35(2): 574–599 · Zbl 1141.90018 · doi:10.1016/j.cor.2006.03.021
[41] Bock S, Hoberg K (2007) Detailed layout planning for irregularly-shaped machines with transportation path design. Eur J Oper Res 177(2): 693–718 · Zbl 1110.90073 · doi:10.1016/j.ejor.2005.11.011
[42] Bouffard V, Ferland JA (2007) Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem. J Scheduling 10(6): 375–386 · Zbl 1153.90415 · doi:10.1007/s10951-007-0043-7
[43] Bräysy O (2003) A reactive variable neighborhood search for the vehicle routing problem with time windows. INFORMS J Comput 15(4): 347–368 · Zbl 1238.90136 · doi:10.1287/ijoc.15.4.347.24896
[44] Brimberg J, Mladenović N (1996) A variable neighborhood algorithm for solving the continuous location-allocation problem. Stud Locational Anal 10: 1–12 · Zbl 0885.90069
[45] Brimberg J, Hansen P, Mladenović N, Taillard É (2000) Improvements and comparison of heuristics for solving the multisource Weber problem. Oper Res 48(3): 444–460 · doi:10.1287/opre.48.3.444.12431
[46] Brimberg J, Hansen P, Lih K-W, Mladenović N, Breton M (2003) An oil pipeline design problem. Oper Res 51(2): 228–239 · Zbl 1163.90592 · doi:10.1287/opre.51.2.228.12786
[47] Brimberg J, Mladenović N, Salhi S (2004) The multi-source Weber problem with constant opening cost. J Oper Res Soc 55: 640–646 · Zbl 1060.90680 · doi:10.1057/palgrave.jors.2601754
[48] Brimberg J, Hansen P, Mladenović N (2006a) Decomposition strategies for large-scale continuous location–allocation problems. IMA J Manage Math 17: 307–316 · Zbl 1126.90043 · doi:10.1093/imaman/dpl002
[49] Brimberg J, Urošević D, Mladenović N (2006b) Variable neighborhood search for the vertex weighted k-cardinality tree problem. Eur J Oper Res 171(1): 74–84 · Zbl 1087.90061 · doi:10.1016/j.ejor.2004.07.061
[50] Brimberg J, Hansen P, Laporte G, Mladenović N, Urošević D (2008a) The maximum return-on-investment plant location problem with market share. J Oper Res Soc 59(3): 399–406 · Zbl 1145.90416 · doi:10.1057/palgrave.jors.2602349
[51] Brimberg J, Mladenović N, Urošević D (2008b) Local and variable neighborhood search for the k-cardinality subgraph problem. J Heuristics 14(5): 501–517 · Zbl 1211.90298 · doi:10.1007/s10732-007-9046-y
[52] Brusco M, Steinley D (2007a) A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices. J Math Psychol 51(5): 325–338 · Zbl 1151.91731 · doi:10.1016/j.jmp.2007.07.001
[53] Brusco MJ, Steinley D (2007b) A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning. Psychometrika 72(4): 583–600 · Zbl 1291.62196 · doi:10.1007/s11336-007-9013-4
[54] Brusco MJ, 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 · Zbl 1301.62118 · doi:10.1007/s11336-007-9049-5
[55] Burke EK, Kendall G (2005) Search methodologies. Introductory tutorials in optimization and decision support techniques. Springer, Berlin (2005) · Zbl 1140.90015
[56] Burke EK, Cowling P, Keuthen R (2001) Effective local and guided variable neighborhood search methods for the asymmetric travelling salesman problem. Lect Notes Comput Sci 2037: 203–212 · Zbl 0978.68574 · doi:10.1007/3-540-45365-2_21
[57] Burke EK, De Causmaecker P, Petrovic S, Vanden Berghe G et al (2004) Variable neighborhood search for nurse rostering problems. In: Resende M (eds) Metaheuristics: computer decision-making. Kluwer, Dordrecht, pp 153–172
[58] Burke EK, Curtois T, Post G, Qu R, Veltman B (2008) A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. Eur J Oper Res 188(2): 330–341 · Zbl 1149.90346 · doi:10.1016/j.ejor.2007.04.030
[59] 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 · Zbl 1014.90078
[60] Caporossi G, Hansen P (2000) Variable neighborhood search for extremal graphs 1. The AutoGraphiX system. Discrete Math 212: 29–44 · Zbl 0947.90130 · doi:10.1016/S0012-365X(99)00206-X
[61] Caporossi G, Hansen P (2004) Variable neighborhood search for extremal graphs 5. Three ways to automate finding conjectures. Discrete Math 276(1–3): 81–94 · Zbl 1031.05068 · doi:10.1016/S0012-365X(03)00311-X
[62] Caporossi G, Cvetković D, Gutman I, Hansen P (1999a) Variable neighborhood search for extremal graphs 2. Finding graphs with extremal energy. J Chem Inform Comput Sci 39: 984–996
[63] Caporossi G, Dobrynin AA, Gutman I, Hansen P (1999b) Trees with palindromic Hosoya polynomials. Graph Theory Notes New York 37: 10–16
[64] Caporossi G, Gutman I, Hansen P (1999c) Variable neighborhood search for extremal graphs 4. Chemical trees with extremal connectivity index. Comput Chem 23(5): 469–477 · Zbl 05467539 · doi:10.1016/S0097-8485(99)00031-5
[65] Caporossi G, Gutman I, Hansen P, Pavlović L (2003) Graphs with maximum connectivity index. Comput Biol Chem 27: 85–90 · doi:10.1016/S0097-8485(02)00016-5
[66] Caporossi G, Alamargot D, Chesnet D (2004) Using the computer to study the dynamics of the handwriting processes. Lect Notes Comput Sci 3245: 242–254 · doi:10.1007/978-3-540-30214-8_19
[67] Carrabs F, Cordeau J-F, Laporte G (2007) Variable neighbourhood search for the pickup and delivery traveling salesman problem with LIFO loading. INFORMS J Comput 19(4): 618–632 · Zbl 1241.90103 · doi:10.1287/ijoc.1060.0202
[68] 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 J Comput 19(3): 470–479 · Zbl 1241.90086 · doi:10.1287/ijoc.1060.0183
[69] Chen C-L, Chen C-L (2008) Hybrid metaheuristic for unrelated parallel machine scheduling with sequence-dependent setup times. Int J Adv Manufact Technol (in press). Published online: 26 August 2008. doi: 10.1007/s00170-008-1692-1
[70] Chyu C-C, Chen Z-J (2008) Scheduling jobs under constant period-by-period resource availability to maximize project profit at a due date. Int J Adv Manufact Technol (in press). Published online: 18 July 2008. doi: 10.1007/s00170-008-1614-2
[71] Claro J, de Sousa JP (2008) A multiobjective metaheuristic for a mean-risk multistage capacity investment problem. J Heuristics (in press). Published online: 24 July 2008. doi: 10.1007/s10732-008-9090-2 · Zbl 1251.91054
[72] Consoli S, Darby-Dowman K, Mladenović N, Moreno Pérez JA (2008) Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem. Eur J Oper Res. Available online 15 March 2008. doi: 10.1016/j.ejor.2008.03.014 · Zbl 1163.90766
[73] Costa MC, Monclar FR, Zrikem M (2002) Variable neighborhood decomposition search for the optimization of power plant cable layout. J Intell Manufact 13(5): 353–365 · doi:10.1023/A:1019980525722
[74] Cote P, Wong T, Sabourin R (2005) A hybrid multi-objective evolutionary algorithm for the uncapacitated exam proximity problem. Lect Notes Comput Sci 3616: 294–312 · doi:10.1007/11593577_17
[75] Cowling PI, Keuthen R (2005) Embedded local search approaches for routing optimization. Comput Oper Res 32(3): 465–490 · Zbl 1061.90092 · doi:10.1016/S0305-0548(03)00248-X
[76] Crainic T, Gendreau M, Hansen P, Mladenović N (2004) Cooperative parallel variable neighborhood search for the p-median. J Heuristics 10: 289–310
[77] 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
[78] 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 Multilinear Algebra 49: 143–160 · Zbl 1003.05058 · doi:10.1080/03081080108818690
[79] Czogalla J, Fink A (2008) On the effectiveness of particle swarm optimization and variable neighborhood descent for the continuous flow-shop scheduling problem. Stud Comput Intell 128: 61–89 · Zbl 1151.90402 · doi:10.1007/978-3-540-78985-7_3
[80] Dahal K, Remde S, Cowling P, Colledge N (2008) Improving metaheuristic performance by evolving a variable fitness function. Lect Notes Comput Sci 4972: 170–181 · Zbl 05261053 · doi:10.1007/978-3-540-78604-7_15
[81] Davidon WC (1959) Variable metric algorithm for minimization. Argonne National Laboratory Report ANL-5990
[82] Davidović T, Hansen P, Mladenović N (2005) Permutation-based genetic, tabu, and variable neighborhood search heuristics for multiprocessor scheduling with communication delays. Asia-Pacific J Oper Res 22(3): 297–326 · Zbl 1085.90020 · doi:10.1142/S021759590500056X
[83] De Paula MR, Ravetti MG, Mateus GR, Pardalos PM (2007) Solving parallel machines scheduling problems with sequence-dependent setup times using Variable Neighbourhood Search. IMA J Manage Math 18(2): 101–115 · Zbl 1177.90151 · doi:10.1093/imaman/dpm016
[84] De Souza MC, Martins P (2008) Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem. Eur J Oper Res 191(3): 677–690 · Zbl 1160.90499 · doi:10.1016/j.ejor.2006.12.061
[85] Degila JR, Sansò B (2004) Topological design optimization of a Yottabit-per-second lattice network. IEEE J Selected Areas Commun 22(9): 1613–1625 · doi:10.1109/JSAC.2004.829642
[86] Del Pia A, Filippi C (2006) A variable neighborhood descent algorithm for a real waste collection problem with mobile depots. Int Trans Oper Res 13(2): 125–141 · Zbl 1127.90391 · doi:10.1111/j.1475-3995.2006.00539.x
[87] Desrosiers J, Mladenović N, Villeneuve D (2005) Design of balanced MBA student teams. J Oper Res Soc 56(1): 60–66 · Zbl 1122.91368 · doi:10.1057/palgrave.jors.2601775
[88] Dias TCS, De Sousa GF, Macambira EM, Cabral LDAF, Fampa MHC (2006) An efficient heuristic for the ring star problem. Lect Notes Comput Sci 4007: 24–35 · Zbl 1196.90032 · doi:10.1007/11764298_3
[89] Domínguez-Marín P, Nickel S, Hansen P, Mladenović N (2005) Heuristic procedures for solving the discrete ordered median problem. Ann Oper Res 136(1): 145–173 · Zbl 1105.90332 · doi:10.1007/s10479-005-2043-3
[90] Dražić M, Kovacevic-Vujcić V, Cangalović M, Mladenović N (2006) GLOB–A new VNS-based software for global optimization. In: Liberti L, Maculan N (eds) Global Optimization: from Theory to Implementation. Springer, Berlin, pp 135–144 · Zbl 1100.90003
[91] 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. Eur J Oper Res 185(3): 1265–1273 · Zbl 1175.90444 · doi:10.1016/j.ejor.2006.06.052
[92] Drezner Z, Hahn PM, Taillard ED (2005) Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods. Ann Oper Res 139(1): 65–94 · Zbl 1091.90033 · doi:10.1007/s10479-005-3444-z
[93] Duarte A, Sanchez A, Fernandez F, Cabido R (2005) A low-level hybridization between memetic algorithm and VNS for the max-cut problem. GECCO 2005–Genetic and Evolutionary Computation Conference 999–1006
[94] Du Merle O, Villeneuve D, Desrosiers J, Hansen P (1999) Stabilized column generation. Discrete Math 194(1–3): 229–237 · Zbl 0949.90063 · doi:10.1016/S0012-365X(98)00213-1
[95] Du Merle O, Hansen P, Jaumard B, Mladenović N (2000) An interior point algorithm for minimum sum-of-squares clustering. SIAM J Sci Comput 21: 1485–1505 · Zbl 1049.90129 · doi:10.1137/S1064827597328327
[96] Fathali J, Kakhki HT (2006) Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases. Eur J Oper Res 170(2): 440–462 · Zbl 1085.90007 · doi:10.1016/j.ejor.2004.05.027
[97] Festa P, Pardalos PM, Resende MGC, Ribeiro CC (2002) Randomized heuristics for the MAX-CUT problem. Optim Methods Softw 17(6): 1033–1058 · Zbl 1032.90073 · doi:10.1080/1055678021000090033
[98] Fischetti M, Lodi A (2003) Local branching. Math Program 98(1–3): 23–47 · Zbl 1060.90056 · doi:10.1007/s10107-003-0395-5
[99] 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
[100] Fletcher R, Powell MJD (1963) Rapidly convergent descent method for minimization. Comput J 6: 163–168 · Zbl 0132.11603
[101] Fleszar K, Hindi KS (2002) New heuristics for one-dimensional bin-packing. Comput Oper Res 29: 821–839 · Zbl 0994.90134 · doi:10.1016/S0305-0548(00)00082-4
[102] Fleszar K, Hindi KS (2004) Solving the resource-constrained project scheduling problem by a variable neighborhood search. Eur J Oper Res 155(2): 402–413 · Zbl 1045.90028 · doi:10.1016/S0377-2217(02)00884-6
[103] Fleszar K, Hindi KS (2008) An effective VNS for the capacitated p-median problem. Eur J Oper Res 191(3): 612–622 · Zbl 1160.90496 · doi:10.1016/j.ejor.2006.12.055
[104] Fleszar K, Osman IH, Hindi KS (2008) A variable neighbourhood search algorithm for the open vehicle routing problem. Eur J Oper Res. Available online 22 November 2007. doi: 10.1016/j.ejor.2007.06.064
[105] Fowler PW, Hansen P, Caporossi G, Soncini A (2001) Variable neighborhood search for extremal graphs 7. Polyenes with maximum HOMO-LUMO gap. Chem Phys Lett 49: 143–146
[106] Gagné C, Gravel M, Price WL (2005) Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems. J Oper Res Soc 56: 687–698 · Zbl 1095.90120 · doi:10.1057/palgrave.jors.2601868
[107] Galinier P, Hertz A (2006) A survey of local search methods for graph coloring. Comput Oper Res 33(9): 2547–2562 · Zbl 1086.90060 · doi:10.1016/j.cor.2005.07.028
[108] Gao J, Sun L, Gen M (2008) A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput Oper Res 35(9): 2892–2907 · Zbl 1144.90379 · doi:10.1016/j.cor.2007.01.001
[109] García-López F, Melián-Batista B, Moreno-Pérez JA, Moreno-Vega JM (2002) The parallel variable neighborhood search for the p-median problem. J Heuristics 8(3): 375–388 · Zbl 1012.68796 · doi:10.1023/A:1015013919497
[110] García CG, Pérez-Brito D, Campos V, Martí R (2006) Variable neighborhood search for the linear ordering problem. Comput Oper Res 33(12): 3549–3565 · Zbl 1094.90039 · doi:10.1016/j.cor.2005.03.032
[111] Garey MR, Johnson DS (1978) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York
[112] Garroi J-J, Goos P, Sörensen K (2008) A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation. J Stat Plan Inference 139(1): 30–44 · Zbl 1284.62475 · doi:10.1016/j.jspi.2008.05.014
[113] Gavranović H (2008) Local search and suffix tree for car-sequencing problem with colors. Eur J Oper Res 191(3): 972–980 · Zbl 1156.90375 · doi:10.1016/j.ejor.2007.04.051
[114] Geiger MJ, Wenger W (2007) On the interactive resolution of multi-objective vehicle routing problems. Lect Notes Comput Sci 4403: 687–699 · Zbl 05546533 · doi:10.1007/978-3-540-70928-2_52
[115] Ghiani G, Hertz A, Laporte G (2002) Recent algorithmic advances for arc routing problems. In: Kozan E, Ohuchir A (eds) Operations Research/Management Science at Work. Kluwer, Boston, pp 1–20 · Zbl 1070.90506
[116] Gill P, Murray W, Wright M (1981) Practical optimization. Academic Press, London · Zbl 0503.90062
[117] Glover, F, Kochenberger, G (eds) (2003) Handbook of Metaheuristics. Kluwer, Dordrecht · Zbl 1058.90002
[118] Goel A, Gruhn V (2008) A general vehicle routing problem. Eur J Oper Res 191(3): 650–660 · Zbl 1160.90343 · doi:10.1016/j.ejor.2006.12.065
[119] Griffith RE, Stewart RA (1961) A nonlinear programming technique for the optimization of continuous processing systems. Manage Sci 7: 379–392 · Zbl 0995.90610 · doi:10.1287/mnsc.7.4.379
[120] Gupta SR, Smith JS (2006) Algorithms for single machine total tardiness scheduling with sequence dependent setups. Eur J Oper Res 175(2): 722–739 · Zbl 1142.90399 · doi:10.1016/j.ejor.2005.05.018
[121] Gutjahr WJ, Katzensteiner S, Reiter P (2007) A VNS algorithm for noisy problems and its application to project portfolio analysis. Lect Notes Comput Sci 4665: 93–104 · Zbl 1175.90330 · doi:10.1007/978-3-540-74871-7_9
[122] Gutman I, Miljković O, Caporossi G, Hansen P (1999) Alkanes with small and large Randić connectivity indices. Chem Phys Lett 306: 366–372 · doi:10.1016/S0009-2614(99)00472-8
[123] Gutman I, Hansen P, Mélot H (2005) Variable neighborhood search for extremal graphs 10. Comparison of irregularity indices for chemical trees. J Chem Inform Model 45: 222–230 · doi:10.1021/ci0342775
[124] 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
[125] Hansen P (2002) Computers in Graph Theory. Graph Theory Notes, New York XLIII: 20–39
[126] Hansen P (2005) How far is, should and could be conjecture-making in graph theory an automated process?. Graph Discov Dimacs Ser Discrete Math Theor Comput Sci 69: 189–229 · Zbl 1097.68588
[127] Hansen P, Mélot H (2002) Computers and discovery in algebraic graph theory. Linear Algebra Appl 356 (1–3): 211–230
[128] Hansen P, Mélot H (2003) Variable neighborhood search for extremal graphs 6. Analysing bounds for the connectivity index. J Chem Inform Comput Sci 43: 1–14
[129] Hansen P, Mélot H (2005) Variable neighborhood search for extremal graphs 9. Bounding the irregularity of a graph. Graphs Discov 69: 253–264 · Zbl 1095.05019
[130] Hansen P, Mladenović N (1997) Variable neighborhood search for the p-median. Location Sci 5: 207–226 · Zbl 0928.90043 · doi:10.1016/S0966-8349(98)00030-8
[131] Hansen P, Mladenović N et al (1999) An introduction to variable neighborhood search. In: Voss S (eds) Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization. Kluwer, Dordrecht, pp 433–458 · Zbl 0985.90095
[132] Hansen P, Mladenović N (2001a) Variable neighborhood search: principles and applications. Eur J Oper Res 130: 449–467 · Zbl 0981.90063 · doi:10.1016/S0377-2217(00)00100-4
[133] Hansen P, Mladenović N (2001b) J-Means: a new local search heuristic for minimum sum-of-squares clustering. Pattern Recognit 34: 405–413 · Zbl 1012.68873 · doi:10.1016/S0031-3203(99)00216-2
[134] Hansen P, Mladenović N (2001) Developments of variable neighborhood search. In: Ribeiro C, Hansen P (eds) Essays and surveys in metaheuristics. Kluwer, Dordrecht, pp 415–440
[135] Hansen P, Mladenović N (2003) Variable neighborhood search. In: Glover F, Kochenberger G (eds) Handbook of Metaheuristics. Kluwer, Dordrecht, pp 145–184 · Zbl 1102.90371
[136] Hansen P, Mladenović N (2005) Variable Neighbourhood Search. In: Burke EK, Kendall G (eds) Search methodologies. Introductory tutorials in optimization and decision support techniques. Springer, pp 211–238
[137] Hansen P, Mladenović N (2006) First improvement may be better than best improvement: An empirical study. Discrete Appl Math 154: 802–817 · Zbl 1120.90048 · doi:10.1016/j.dam.2005.05.020
[138] Hansen P, Mladenović N (2008) Complement to a comparative analysis of heuristics for the p-median problem. Stat Comput 18(1): 41–46 · doi:10.1007/s11222-007-9036-9
[139] Hansen P, Perron S (2007) Algorithms for \({\mathcal {L}_1}\) -embeddability and related problems. J Classification 24(2): 251–275 · Zbl 1180.68134 · doi:10.1007/s00357-007-0014-x
[140] Hansen P, Perron S (2008) Merging the local and global approaches to probabilistic satisfiability. Int J Approx Reason 47(2): 125–140 · Zbl 1343.68220 · doi:10.1016/j.ijar.2007.03.001
[141] Hansen P, Stevanović D (2005) Variable neighborhood search for extremal graphs 15. On bags and bugs. Discrete Appl Math 156(7): 986–997 · Zbl 1145.05028 · doi:10.1016/j.dam.2007.05.044
[142] Hansen P, Vukičević D (2009) Variable neighborhood search for extremal graphs 23. On the Randic index and the chromatic number. Discrete Math (in press) · Zbl 1229.05145
[143] 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
[144] Hansen P, Mladenović N, Pérez-Brito D (2001) Variable neighborhood decomposition search. J Heuristics 7(4): 335–350 · Zbl 1041.68623 · doi:10.1023/A:1011336210885
[145] Hansen P, Mladenović N, Urošević D (2004) Variable neighborhood search for the maximum clique. Discrete Appl Math 145(1): 117–125 · Zbl 1058.90053 · doi:10.1016/j.dam.2003.09.012
[146] Hansen P, Aouchiche M, Caporossi G, Mélot H, Stevanović D (2005a) What forms do interesting conjectures have in graph theory?. Graph Discov Dimacs Ser Discrete Math Theor Comput Sci 69: 231–251 · Zbl 1102.68093
[147] 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 Commun Math Comput Chem 54: 221–232 · Zbl 1274.05241
[148] Hansen P, Mladenović N, Urošević D (2006) Variable neighborhood search and local branching. Comput Oper Res 33(10): 3034–3045 · Zbl 1086.90042 · doi:10.1016/j.cor.2005.02.033
[149] Hansen P, Brimberg J, Urošević D, Mladenović N (2007a) Primal-dual variable neighborhood search for the simple plant location problem. INFORMS J Comput 19(4): 552–564 · Zbl 1241.90072 · doi:10.1287/ijoc.1060.0196
[150] Hansen P, Lazić J, Mladenović N (2007b) Variable neighbourhood search for colour image quantization. IMA J Manage Math 18(2): 207–221 · Zbl 1177.90418 · doi:10.1093/imaman/dpm008
[151] Hansen P, Mladenović N, Moreno Pérez JA (2008a) Variable neighborhood search. Eur J Oper Res 191(3): 593–595 · doi:10.1016/j.ejor.2007.02.002
[152] Hansen P, Oguz C, Mladenović N (2008b) Variable neighborhood search for minimum cost berth allocation. Eur J Oper Res 191(3): 636–649 · Zbl 1160.90497 · doi:10.1016/j.ejor.2006.12.057
[153] Haugland D (2007) A bidirectional greedy heuristic for the subspace selection problem. Lect Notes Comput Sci 4638: 162–176 · Zbl 1134.68496 · doi:10.1007/978-3-540-74446-7_12
[154] Hemmelmayr VC, Doerner KF, Hartl RF (2008a) A variable neighborhood search heuristic for the periodic routing problems. Eur J Oper Res. Available online 13 November 2007. doi: 10.1016/j.ejor.2007.08.048
[155] Hemmelmayr V, Doerner KF, Hartl RF, Savelsbergh MWP (2008b) Delivery strategies for blood products supplies OR Spectrum. Available online 19 March 2008. doi: 10.1007/s00291-008-0134-7
[156] Hertz A, Mittaz M (2001) A variable neighborhood descent algorithm for the undirected capacitated arc routing problem. Transp Sci 35(4): 425–434 · Zbl 1069.90517 · doi:10.1287/trsc.35.4.425.10431
[157] Hertz A, Plumettaz M, Zufferey N (2008) Variable space search for graph coloring. Discrete Appl Math 156(13): 2551–2560 · Zbl 1213.05085 · doi:10.1016/j.dam.2008.03.022
[158] Higgins A, Beashel G, Harrison A (2006) Scheduling of brand production and shipping within a sugar supply chain. J Oper Res Soc 57: 490–498 · Zbl 1113.90323 · doi:10.1057/palgrave.jors.2602025
[159] Hindi KS, Fleszar K, Charalambous C (2003) An effective heuristic for the CLSP with setup times. J Oper Res Soc 54(5): 490–498 · Zbl 1070.90036 · doi:10.1057/palgrave.jors.2601525
[160] 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. Eur J Oper Res 191(3): 691–704 · Zbl 1160.90330 · doi:10.1016/j.ejor.2006.12.060
[161] Hu B, Raidl GR (2008) Effective neighborhood structures for the generalized traveling salesman problem. Lect Notes Comput Sci 4972: 36–47 · Zbl 05261042 · doi:10.1007/978-3-540-78604-7_4
[162] Hu B, Leitner M, Raidl GR (2008) Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. J Heuristics 14(5): 501–517 · Zbl 1211.90309 · doi:10.1007/s10732-007-9047-x
[163] Imran A, Salhi S, Wassan NA (2008) A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem. Eur J Oper Res (in press). Published online: 29 July 2008. doi: 10.1016/j.ejor.2008.07.022 · Zbl 1159.90525
[164] Irnich S, Funke B, Grünert T (2006) Sequential search and its application to vehicle-routing problems. Comput Oper Res 33(8): 2405–2429 · Zbl 1086.90064 · doi:10.1016/j.cor.2005.02.020
[165] Jabalameli MS, Ghaderi A (2008) Hybrid algorithms for the uncapacitated continuous location-allocation problem. The Int J Adv Manufact Technol 37(1–2): 202–209 · doi:10.1007/s00170-007-0944-9
[166] Jovanović D, Mladenović N, Ognjanović Z (2007) Variable neighborhood search for the probabilistic satisfiability problem. In: Doerner KF, Gendreau M, Greistorfer P, Gutjahr W, Hartl RF, Reimann M (eds) Metaheuristics. Progress in Complex Systems Optimization. Springer, Berlin, pp 173–188 · Zbl 1171.90561
[167] Joly A, Frein Y (2008) Heuristics for an industrial car sequencing problem considering paint and assembly shop objectives. Comput Ind Eng 55(2): 295–310 · doi:10.1016/j.cie.2007.12.014
[168] Jornsten K, Lokketangen A (1997) Tabu search for weighted k-cardinality trees. Asia-Pac J Oper Res 14(2): 9–26
[169] Karam A, Caporossi G, Hansen P (2007) Arbitrary-norm hyperplane separation by Variable Neighbourhood Search. IMA J Manage Math 18(2): 173–190 · Zbl 1177.90376 · doi:10.1093/imaman/dpm014
[170] Kawashimo S, Ono H, Sadakane K, Yamashita M (2006) DNA sequence design by dynamic neighborhood searches. Lect Notes Comput Sci 4287: 157–171 · Zbl 1132.68402 · doi:10.1007/11925903_12
[171] Kolisch R, Hartmann S (2006) Experimental investigation of heuristics for resource-constrained project scheduling: An update European. J Oper Res 174(1): 23–37 · Zbl 1116.90047 · doi:10.1016/j.ejor.2005.01.065
[172] Kucherenko S, Belotti P, Liberti L, Maculan N (2007) New formulations for the Kissing number problem. Discrete Appl Math 155(14): 1837–1841 · Zbl 1144.90455 · doi:10.1016/j.dam.2006.05.012
[173] Kytöjoki J, Nuortio T, Bräysy O, Gendreau M (2007) An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Comput Oper Res 34(9): 2743–2757 · Zbl 1141.90429 · doi:10.1016/j.cor.2005.10.010
[174] Lapierre SD, Ruiz AB, Soriano P (2004) Designing distribution networks: Formulations and solution heuristic. Transp Sci 38(2): 174–187 · doi:10.1287/trsc.1030.0064
[175] Lejeune MA (2006) A variable neighborhood decomposition search method for supply chain management planning problems. Eur J Oper Res 175(2): 959–976 · Zbl 1142.90424 · doi:10.1016/j.ejor.2005.05.021
[176] Liang Y-C, Chen YC (2007) Redundancy allocation of series-parallel systems using a variable neighborhood search algorithm. Reliab Eng Syst Saf 92(3): 323–331 · doi:10.1016/j.ress.2006.04.013
[177] Liang Y-C, Lo M-H, Chen YC (2007) Variable neighbourhood search for redundancy allocation problems. IMA J Manage Math 18(2): 135–156 · Zbl 1153.91612 · doi:10.1093/imaman/dpm010
[178] Liao CJ, Cheng CC (2007) A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date. Comput Ind Eng 52(4): 404–413 · doi:10.1016/j.cie.2007.01.004
[179] Liao C-J, Liao C-C (2008) An ant colony optimisation algorithm for scheduling in agile manufacturing. Int J Prod Res 46(7): 1813–1824 · Zbl 1153.90429 · doi:10.1080/00207540600969782
[180] Liao CJ, Chao-Tang T, Luarn P (2007) A discrete version of particle swarm optimization for flowshop scheduling problems. Comput Oper Res 34(10): 3099–3111 · Zbl 1185.90083 · doi:10.1016/j.cor.2005.11.017
[181] Liberti L, Lavor C, Maculan N, Marinelli F (2008) Double variable neighbourhood search with smoothing for the molecular distance geometry problem. J Global Optim. Available online 8 August 2007. doi: 10.1007/s10898-007-9218-1 · Zbl 1169.90470
[182] Lin S-W, Ying K-C (2008) A hybrid approach for single-machine tardiness problems with sequence-dependent setup times. J Oper Res Soc 59(8): 1109–1119 · doi:10.1057/palgrave.jors.2602434
[183] Ling A, Xu C, Tang L (2008) A modified VNS metaheuristic for max-bisection problems. J Comput Appl Math 220(1–2): 413–421 · Zbl 1148.65040 · doi:10.1016/j.cam.2007.08.018
[184] Liu H, Abraham A (2007) An hybrid fuzzy variable neighborhood particle swarm optimization algorithm for solving quadratic assignment problems. J Universal Comput Sci 13(9): 1309–1331
[185] Liu S-C, Chung C-H (2008) A heuristic method for the vehicle routing problem with backhauls and inventory. J Intell Manufact (in press). Published online: 8 April 2008. doi: 10.1007/s10845-008-0101-9
[186] Liu HB, Abraham A, Choi O, Moon SH (2006) Variable neighborhood particle swarm optimization for multi-objective flexible job-shop scheduling problems. Lect Notes Comput Sci 4247: 197–204 · doi:10.1007/11903697_26
[187] Liu S-X, Liu L, Zhang T (2008) Variable neighborhood search for solving vehicle routing problems with backhauls and time windows. J Northeast Univ 29(3): 316–319
[188] Ljubic I (2007) A hybrid VNS for connected facility location. Lect Notes Comput Sci 4771: 157–169 · Zbl 05291831 · doi:10.1007/978-3-540-75514-2_12
[189] Loudni S, Boizumault P (2008) Combining VNS with constraint programming for solving anytime optimization problems. Eur J Oper Res 191(3): 705–735 · Zbl 1160.90661 · doi:10.1016/j.ejor.2006.12.062
[190] Loudni S, Boizumault P, David P (2006) On-line resources allocation for ATM networks with rerouting. Comput Oper Res 33(10): 2891–2917 · Zbl 1086.90502 · doi:10.1016/j.cor.2005.01.016
[191] Lusa A, Potts CN (2008) A variable neighbourhood search algorithm for the constrained task allocation problem. J Oper Res Soc 59: 812–822 · Zbl 1153.90448 · doi:10.1057/palgrave.jors.2602413
[192] Melechovsky J, Prins C, Calvo R (2005) A metaheuristic to solve a location-routing problem with non-linear costs. J Heuristics 11(5–6): 375–391 · Zbl 1122.90382 · doi:10.1007/s10732-005-3601-1
[193] Melián B (2006) Using memory to improve the VNS metaheuristic for the design of SDH/WDM networks. Lect Notes Comput Sci 4030: 82–93 · Zbl 05352099 · doi:10.1007/11890584_7
[194] Melián B, Mladenović N (2007) Editorial. IMA J Manage Math 18(2): 99–100 · doi:10.1093/imaman/dpm017
[195] Melián-Batista B, Höller H, Voss S (2008) Designing WDM networks by a variable neighborhood search. J Telecommun Inform Technol 4/2006:15–20
[196] Meric L, Pesant G, Pierre S (2004) Variable neighborhood search for optical routing in networks using latin routers. Ann Telecommun 59(3–4): 261–286
[197] Mladenović N (1995) A variable neighborhood algorithm – a new metaheuristic for combinatorial optimization. Abstracts of papers presented at Optimization Days, Montréal, p 112
[198] Mladenović N (2005) Formulation space search–a new approach to optimization (plenary talk). In: Vuleta J (eds) Proceedings of XXXII SYMOPIS’05. Vrnjacka Banja, Serbia, p 3
[199] Mladenović N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24: 1097–1100 · Zbl 0889.90119 · doi:10.1016/S0305-0548(97)00031-2
[200] Mladenović N, Urošević D (2003) Variable neighborhood search for the k-cardinality tree. Appl Optim 86: 481–500
[201] 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
[202] 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. Eur J Oper Res 151: 389–399 · Zbl 1053.90055 · doi:10.1016/S0377-2217(02)00833-0
[203] Mladenović N, Plastria F, Urošević D (2005) Reformulation descent applied to circle packing problems. Comput Oper Res 32: 2419–2434 · Zbl 1066.90092 · doi:10.1016/j.cor.2004.03.010
[204] Mladenović N, Brimberg J, Hansen P, Moreno Pérez JA (2007a) The p-median problem: a survey of metaheuristic approaches. Eur J Oper Res 179(3): 927–939 · Zbl 1163.90610 · doi:10.1016/j.ejor.2005.05.034
[205] Mladenović N, Plastria F, Uroševic D (2007b) Formulation space search for circle packing problems. Lect Notes Comput Sci 4638: 212–216 · Zbl 1134.90477 · doi:10.1007/978-3-540-74446-7_20
[206] Mladenović N, Dražić M, Kovačevic-Vujčić V, Čangalović M (2008) General variable neighborhood search for the continuous optimization. Eur J Oper Res 191(3): 753–770 · Zbl 1156.90005 · doi:10.1016/j.ejor.2006.12.064
[207] Montemanni R, Smith DH (2008) Construction of Constant GC-Content DNA Codes via a Variable Neighbourhood Search Algorithm. J Math Model Algorithms 7(3): 311–326 · Zbl 1191.68229 · doi:10.1007/s10852-008-9087-8
[208] Moreno-Pérez JA, Moreno-Vega JM, Rodríguez-Martín I (2003) Variable neighborhood tabu search and its application to the median cycle problem. Eur J Oper Res 151(2): 365–378 · Zbl 1053.90056 · doi:10.1016/S0377-2217(02)00831-7
[209] Moreno-Pérez JA, Hansen P, Mladenović N (2005) Parallel variable neighborhood search. In: Alba E (eds) Parallel metaheuristics: a new class of algorithms. Wiley, New York
[210] Moreno-Vega JM, Melián B (2008) Introduction to the special issue on variable neighborhood search. J Heuristics 14(5): 403–404 · doi:10.1007/s10732-007-9044-0
[211] Mori H, Tsunokawa S (2005) Variable neighborhood tabu search for capacitor placement in distribution systems. IEEE Int Symp Circuits Syst 5: 4747–4750 · doi:10.1109/ISCAS.2005.1465693
[212] Naderi B, Zandieh M, Fatemi Ghomi SMT (2008) A study on integrating sequence dependent setup time flexible flow lines and preventive maintenance scheduling. J Intell Manufact (in press). Published online: 31 August 2008. doi: 10.1007/s10845-008-0157-6
[213] Negreiros M, Palhano A (2006) The capacitated centred clustering problem. Comput Oper Res 33(6): 1639–1663 · Zbl 1087.90088 · doi:10.1016/j.cor.2004.11.011
[214] Nuortio T, Kytöjoki J, Niska H, Bräysy O (2006) Improved route planning and scheduling of waste collection and transport. Expert Syst Appl 30(2): 223–232 · doi:10.1016/j.eswa.2005.07.009
[215] Ochi LS, Silva MB, Drummond L (2001) Metaheuristics based on GRASP and VNS for solving traveling purchaser problem. MIC’2001, pp 489–494, Porto
[216] Ognjanović Z, Midić S, Mladenović N (2005) A hybrid genetic and variable neighborhood descent for probabilistic SAT problem. Lect Notes Comput Sci 3636: 42–53 · Zbl 05364329 · doi:10.1007/11546245_5
[217] Osman IH, Ahmadi S (2007) Guided construction search metaheuristics for the capacitated p-median problem with single source constraint. J Oper Res Soc 58(1): 100–114 · Zbl 1152.90509 · doi:10.1057/palgrave.jors.2602135
[218] 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 J Manage Math 18(2): 191–206 · Zbl 1177.90421 · doi:10.1093/imaman/dpm012
[219] Pacheco JA, Casado S, Alegre JF, Álvarez A (2008) Heuristic solutions for locating health resources. IEEE Intell Syst 23(1): 57–63 · Zbl 05334006 · doi:10.1109/MIS.2008.8
[220] Pan Q-K, Wang W-H, Zhu J-Y (2007a) Some meta-heuristics for no-wait flow shop problem. Comput Integr Manufact Syst, CIMS 13(5): 967–970
[221] 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. Comput Integr Manufact Syst, CIMS 13(2): 323–328
[222] Papadimitriou C (1994) Computational Complexity. Addison Wesley · Zbl 0833.68049
[223] Paraskevopoulos DC, Repoussis PP, Tarantilis CD, Ioannou G, Prastacos GP (2008) A reactive variable neighborhood tabu search for the heterogeneous fleet routing problem with time windows. J Heuristics 14(5): 425–455 · Zbl 1211.90313 · doi:10.1007/s10732-007-9045-z
[224] Parreño F, Alvarez-Valdes R, Oliveira JF, Tamarit JM (2008) Neighborhood structures for the container loading problem: a VNS implementation. J Heuristics (in press). Published online: 24 May 2008. doi: 10.1007/s10732-008-9081-3 · Zbl 1184.90174
[225] Pelta D, González JR, Moreno-Vega JM (2008) A simple and fast heuristic for protein structure comparison. BMC Bioinformatics 9: 161 · doi:10.1186/1471-2105-9-161
[226] Pérez MP, Rodríguez FA, Moreno-Vega JM (2007) A hybrid VNS-path relinking for the p-hub median problem. IMA J Manage Math 18(2): 157–172 · Zbl 1177.90252 · doi:10.1093/imaman/dpm013
[227] Plastria F, Mladenović N, Urošević D (2005) Variable neighborhood formulation space search for circle packing. 18th Mini Euro Conference VNS, Tenerife, Spain · Zbl 1240.90332
[228] Plastria F, De Bruyne S, Carrizosa E (2007) Alternating local search based VNS for linear classification. Available at Optimization-online as http://www.optimization-online.org/DB_HTML/2008/02/1910.html
[229] Polacek M, Hartl RF, Doerner K, Reimann M (2004) A variable neighborhood search for the multi depot vehicle routing problem with time windows. J Heuristics 10(6): 613–627 · doi:10.1007/s10732-005-5432-5
[230] Polacek M, Doerner KF, Hartl RF, Kiechle G, Reimann M (2007) Scheduling periodic customer visits for a traveling salesperson. Eur J Oper Res 179(3): 823–837 · Zbl 1163.90506 · doi:10.1016/j.ejor.2005.03.056
[231] Polacek M, Doerner KF, Hartl RF, Maniezzo V (2008) A variable neighborhood search for the capacitated arc routing problem with intermediate facilities. J Heuristics 14(5): 405–423 · Zbl 1211.90314 · doi:10.1007/s10732-007-9050-2
[232] Popper K (1959) The logic of scientific discovery. Hutchinson, London · Zbl 0083.24104
[233] Prandtstetter M, Raidl GR (2008) An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem. Eur J Oper Res 191(3): 1004–1022 · Zbl 1156.90321 · doi:10.1016/j.ejor.2007.04.044
[234] Puchinger J, Raidl G (2008) Bringing order into the neighborhoods: relaxation guided variable neighborhood search. J Heuristics 14(5): 405–423 · Zbl 1211.90315 · doi:10.1007/s10732-007-9048-9
[235] Puchinger J, Raidl GR, Pferschy U (2006) The core concept for the multidimensional knapsack problem. Lect Notes Comput Sci 3906: 195–208 · Zbl 1401.90198 · doi:10.1007/11730095_17
[236] Qian B, Wang L, Huang DX, Wang X (2006) Multi-objective flow shop scheduling using differential evolution. Lect Notes Control Inform Sci 345: 1125–1136 · Zbl 1202.90144 · doi:10.1007/978-3-540-37258-5_146
[237] Rahimi-Vahed A, Dangchi M, Rafiei H, Salimi E (2008) A novel hybrid multi-objective shuffled frog-leaping algorithm for a bi-criteria permutation flow shop scheduling problem. Int J Adv Manufact Technol (in press). Published online: 7 June 2008. doi: 10.1007/s00170-008-1558-6
[238] Reeves, CR (eds) (1993) Modern heuristic techniques for combinatorial problems. Blackwell, Oxford, UK · Zbl 0942.90500
[239] Reinelt G (1991) TSLIB–a traveling salesman library. ORSA J Comput 3: 376–384 · Zbl 0775.90293
[240] Remde S, Cowling P, Dahal K, Colledge N (2007) Exact/heuristic hybrids using rVNS and hyperheuristics for workforce scheduling. Lect Notes Comput Sci 4446: 188–197 · doi:10.1007/978-3-540-71615-0_17
[241] Repoussis PP, Paraskevopoulos DC, Tarantilis CD, Ioannou G (2006) A reactive greedy randomized variable neighborhood tabu search for the vehicle routing problem with time windows. Lect Notes Comput Sci 4030: 124–138 · Zbl 05352102 · doi:10.1007/11890584_10
[242] Repoussis PP, Tarantilis CD, Ioannouo G (2007) A hybrid metaheuristic for a real life vehicle routing problem. Lect Notes Comput Sci 4310: 247–254 · Zbl 1137.65363 · doi:10.1007/978-3-540-70942-8_29
[243] Ribeiro CC, de Souza MC (2002) Variable neighborhood search for the degree-constrained minimum spanning tree problem. Discrete Appl Math 118(1–2): 43–54 · Zbl 0994.90123 · doi:10.1016/S0166-218X(01)00255-4
[244] Ribeiro CC, Vianna DS (2005) A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure. Int Trans Oper Res 12(3): 325–338 · Zbl 1063.92039 · doi:10.1111/j.1475-3995.2005.498_1.x
[245] Ribeiro CC, Uchoa E, Werneck R (2002) A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS J Comput 14(3): 228–246 · Zbl 1238.90117 · doi:10.1287/ijoc.14.3.228.116
[246] Ribeiro CC, Martins SL, Rosseti I (2007) Metaheuristics for optimization problems in computer communications. Comput Commun 30(4): 656–669 · Zbl 05397866 · doi:10.1016/j.comcom.2006.08.027
[247] Ribeiro CC, Aloise D, Noronha TF, Rocha C, Urrutia S (2008a) A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints. Eur J Oper Res 191(3): 981–992 · Zbl 1156.90322 · doi:10.1016/j.ejor.2007.04.034
[248] Ribeiro CC, Aloise D, Noronha TF, Rocha C, Urrutia S (2008b) An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem. Eur J Oper Res 191(3): 596–611 · Zbl 1156.90377 · doi:10.1016/j.ejor.2007.02.003
[249] Rousseau LM, Gendreau M, Pesant G (2002) Using constraint-based operators to solve the vehicle routing problem with time windows. J Heuristics 8(1): 43–58 · Zbl 1073.90056 · doi:10.1023/A:1013661617536
[250] Santana R, Larrañaga P, Lozano JA (2008) Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem. J Heuristics 14(5): 519–547 · Zbl 1211.90316 · doi:10.1007/s10732-007-9049-8
[251] Schmid V, Doerner KF, Hartl RF, Salazar-González JJ (2008) Hybridization of very large neighborhood search for ready-mixed concrete delivery problems Comput Oper Res (in press). Published online: 3 August 2008. doi: 10.1016/j.cor.2008.07.010
[252] Sedlar J, Vukicevic 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
[253] Sedlar J, Vukicevic 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
[254] Sevkli M, Aydin ME (2006a) A variable neighbourhood search algorithm for job shop scheduling problems. Lect Notes Comput Sci 3906: 261–271 · Zbl 06858832 · doi:10.1007/11730095_22
[255] Sevkli M, Aydin ME (2006b) Variable Neighbourhood Search for job shop scheduling problems. J Softw 1(2): 34–39 · Zbl 06858832
[256] Sevkli M, Aydin ME (2007) Parallel variable neighbourhood search algorithms for job shop scheduling problems. IMA J Manage Math 18(2): 117–134 · Zbl 1177.90182 · doi:10.1093/imaman/dpm009
[257] Sevkli Z, Sevilgen FE (2006) Variable neighborhood search for the orienteering problem. Lect Notes Comput Sci 4263: 134–143 · doi:10.1007/11902140_16
[258] Sevkli Z, Sevilgen FE (2008) A hybrid particle swarm optimization algorithm for function optimization. Lect Notes Comput Sci 4974: 585–595 · Zbl 05261144 · doi:10.1007/978-3-540-78761-7_64
[259] Stevanovic D, Aouchiche M, Hansen P (2008) On the spectral radius of graphs with a given domination number. Linear Algebra Appl 428(8–9): 1854–1864 · Zbl 1143.05042 · doi:10.1016/j.laa.2007.10.024
[260] 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. Lect Notes Comput Sci 4972: 135–146 · Zbl 05261050 · doi:10.1007/978-3-540-78604-7_12
[261] Tagawa K, Ohtani T, Igaki T, Seki S, Inoue K (2007) Robust optimum design of SAW filters by the penalty function method. Electrical Eng Jpn 158(3): 45–54 · doi:10.1002/eej.20469
[262] Tasgetiren MF, Sevkli M, Liang Y-C, Gencyilmaz G (2004) Particle swarm optimization algorithm for permutation flowshop sequencing problem. Lect Notes Comput Sci 3172: 382–389 · doi:10.1007/978-3-540-28646-2_38
[263] Tasgetiren MF, 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. Eur J Oper Res 177(3): 1930–1947 · Zbl 1110.90044 · doi:10.1016/j.ejor.2005.12.024
[264] Toksari AD, Güner E (2007) Solving the unconstrained optimization problem by a variable neighborhood search. J Math Anal Appl 328(2): 1178–1187 · Zbl 1275.90095 · doi:10.1016/j.jmaa.2006.06.025
[265] Tseng C-T, Liao C-J, Huang K-L (2008) Minimizing total tardiness on a single machine with controllable processing times. Comput Oper Res (in press). Published online: 27 May 2008. doi: 10.1016/j.cor.2008.05.009
[266] Urošević D, Brimberg J, Mladenović N (2004) Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem. Comput Oper Res 31(8): 1205–1213 · Zbl 1068.68108 · doi:10.1016/S0305-0548(03)00073-X
[267] Villa G, Lozano S, Racero J, Canca D (2006) A hybrid VNS/Tabu search algorithm for apportioning the European Parliament. Lect Notes Comput Sci 3906: 284–292 · Zbl 06858834 · doi:10.1007/11730095_24
[268] Vogt L, Poojari CA, Beasley JE (2007) A tabu search algorithm for the single vehicle routing allocation problem. J Oper Res Soc 58: 467–480 · Zbl 1211.90319 · doi:10.1057/palgrave.jors.2602165
[269] Wang X, Tang L (2008) A population-based variable neighborhood search for the single machine total weighted tardiness problem. Comput Oper Res (in press). Published online: 31 July 2008. doi: 10.1016/j.cor.2008.07.009 · Zbl 1179.90163
[270] Whitaker R (1983) A fast algorithm for the greedy interchange of large-scale clustering and median location problems. INFOR 21: 95–108 · Zbl 0527.90017
[271] 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
[272] Xhafa F (2007) A hybrid evolutionary heuristic for job scheduling on computational grids. Stud Comput Intell 75: 269–311 · doi:10.1007/978-3-540-73297-6_11
[273] Yang J, Zhang J, Aydin ME, Wu JY (2007) A novel programming model and optimisation algorithms for WCDMA networks. IEEE Vehicular Technology Conference, pp 1182–1187
[274] Yepes V, Medina J (2006) Economic heuristic optimization for heterogeneous fleet VRPHESTW. J Transp Eng 132(4): 303–311 · doi:10.1061/(ASCE)0733-947X(2006)132:4(303)
[275] Zhang C, Lin Z, Lin Z (2005) Variable neighborhood search with permutation distance for QAP. Lect Notes Comput Sci 3684: 81–88 · doi:10.1007/11554028_12
[276] Zhao QH, Chen S, Zang CY (2008) Model and algorithm for inventory/routing decision in a three-echelon logistics system. Eur J Oper Res 191(3): 627–635 · Zbl 1160.90326 · doi:10.1016/j.ejor.2006.12.056
[277] Zobolas GI, Tarantilis CD, Ioannou G (2008) Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. Comput Oper Res. Available online 8 February 2008. doi: 10.1016/j.cor.2008.01.007 · Zbl 1160.90490
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.