Skip header Section
Skip Bibliometrics Section
Local Search in Combinatorial OptimizationApril 1997
- Editors:
- Emile Aarts,
- Jan K. Lenstra
Skip Abstract Section
Abstract
From the Publisher:
In the past three decades local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in a reasonable time. This area of discrete mathematics is of great practical use and is attracting ever increasing attention. The contributions to this book cover local search and its variants from both a theoretical and practical point of view, each with a chapter written by leading authorities on that particular aspect. This book is an important reference volume and an invaluable source of inspiration for advanced students and researchers in discrete mathematics, computer science, operations research, industrial engineering and management science.
Cited By
- Mazumder R, Radchenko P and Dedieu A (2023). Subset Selection with Shrinkage, Operations Research, 71:1, (129-147), Online publication date: 1-Jan-2023.
- Kaji T (2021). A probabilistic analysis of neighborhoods for combinatorial optimization problems and its application, Journal of Heuristics, 27:6, (1057-1079), Online publication date: 1-Dec-2021.
- Fang Q, Nguyen H, Bui X, Nguyen-Thoi T and Zhou J (2021). Modeling of rock fragmentation by firefly optimization algorithm and boosted generalized additive model, Neural Computing and Applications, 33:8, (3503-3519), Online publication date: 1-Apr-2021.
Junior Mele U, Maria Gambardella L and Montemanni R Machine Learning Approaches for the Traveling Salesman Problem: A Survey Proceedings of the 2021 8th International Conference on Industrial Engineering and Applications (Europe), (182-186)- Kumar R, Talukdar F, Rajan A, Devi A and Raja R (2018). Parameter optimization of 5.5 GHz low noise amplifier using multi-objective Firefly Algorithm, Microsystem Technologies, 26:10, (3289-3297), Online publication date: 1-Oct-2020.
- Chatterjee T, DasGupta B, Palmieri L, Al-Qurashi Z and Sidiropoulos A (2020). On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering, Journal of Combinatorial Optimization, 40:2, (512-546), Online publication date: 1-Aug-2020.
- Subramanyam A, Repoussis P and Gounaris C (2020). Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty, INFORMS Journal on Computing, 32:3, (661-681), Online publication date: 1-Jul-2020.
- Sert E, Hedayatifar L, Rigg R, Akhavan A, Buchel O, Saadi D, Kar A, Morales A, Bar-Yam Y and Veloz T (2020). Freight Time and Cost Optimization in Complex Logistics Networks, Complexity, 2020, Online publication date: 1-Jan-2020.
- Icarte R, Waldie E, Klassen T, Valenzano R, Castro M and McIlraith S Learning reward machines for partially observable reinforcement learning Proceedings of the 33rd International Conference on Neural Information Processing Systems, (15523-15534)
- Hussain K, Mohd Salleh M, Cheng S and Shi Y (2019). Metaheuristic research: a comprehensive survey, Artificial Intelligence Review, 52:4, (2191-2233), Online publication date: 1-Dec-2019.
- Gairing M and Savani R (2019). Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games, Mathematics of Operations Research, 44:3, (1101-1121), Online publication date: 1-Aug-2019.
- Peake J, Amos M, Yiapanis P and Lloyd H Scaling techniques for parallel ant colony optimization on large problem instances Proceedings of the Genetic and Evolutionary Computation Conference, (47-54)
- Kolchinsky I and Schuster A Real-Time Multi-Pattern Detection over Event Streams Proceedings of the 2019 International Conference on Management of Data, (589-606)
- Leonhart P, Narloch P and Dorn M A Self-adaptive Local Search Coordination in Multimeme Memetic Algorithm for Molecular Docking Computational Science – ICCS 2019, (145-159)
- Cotta C and Gallardo J (2019). New perspectives on the optimal placement of detectors for suicide bombers using metaheuristics, Natural Computing: an international journal, 18:2, (249-263), Online publication date: 1-Jun-2019.
- Chugh T, Sindhya K, Hakanen J and Miettinen K (2019). A survey on handling computationally expensive multiobjective optimization problems with evolutionary algorithms, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 23:9, (3137-3166), Online publication date: 1-May-2019.
- Zhang J, Ding G, Zou Y, Qin S and Fu J (2019). Review of job shop scheduling research and its new perspectives under Industry 4.0, Journal of Intelligent Manufacturing, 30:4, (1809-1830), Online publication date: 1-Apr-2019.
- Ntaflos L, Trimponias G and Papadias D (2019). A unified agent-based framework for constrained graph partitioning, The VLDB Journal — The International Journal on Very Large Data Bases, 28:2, (221-241), Online publication date: 1-Apr-2019.
- Chen B, Qu R, Bai R and Laesanklang W (2018). A hyper-heuristic with two guidance indicators for bi-objective mixed-shift vehicle routing problem with time windows, Applied Intelligence, 48:12, (4937-4959), Online publication date: 1-Dec-2018.
- Torres-Jimenez J and Izquierdo-Marquez I (2018). Covering arrays of strength three from extended permutation vectors, Designs, Codes and Cryptography, 86:11, (2629-2643), Online publication date: 1-Nov-2018.
- Alipour M, Razavi S, Feizi Derakhshi M and Balafar M (2018). A hybrid algorithm using a genetic algorithm and multiagent reinforcement learning heuristic to solve the traveling salesman problem, Neural Computing and Applications, 30:9, (2935-2951), Online publication date: 1-Nov-2018.
- Mulzer W and Stein Y (2018). Computational Aspects of the Colorful Carathéodory Theorem, Discrete & Computational Geometry, 60:3, (720-755), Online publication date: 1-Oct-2018.
- Yang H, Morris R and Păsăreanu C Analysing the effect of uncertainty in airport surface operations Companion Proceedings for the ISSTA/ECOOP 2018 Workshops, (132-137)
- Kolchinsky I and Schuster A (2018). Efficient adaptive detection of complex event patterns, Proceedings of the VLDB Endowment, 11:11, (1346-1359), Online publication date: 1-Jul-2018.
- Römer M, Cire A and Rousseau L A Local Search Framework for Compiling Relaxed Decision Diagrams Integration of Constraint Programming, Artificial Intelligence, and Operations Research, (512-520)
- Cohen-Addad V A fast approximation scheme for low-dimensional k-means Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, (430-440)
- Rios E, Ochi L, Boeres C, Coelho V, Coelho I and Farias R (2018). Exploring parallel multi-GPU local search strategies in a metaheuristic framework, Journal of Parallel and Distributed Computing, 111:C, (39-55), Online publication date: 1-Jan-2018.
- Wang C, Lin C, Hwang G, Kung S and Chen S (2017). A Test Sheet Optimization Approach to Supporting Web-based Learning Diagnosis Using Group Testing Methods, International Journal of Online Pedagogy and Course Design, 7:4, (1-23), Online publication date: 1-Oct-2017.
- Michalak K (2017). ED-LS A heuristic local search for the multiobjective Firefighter Problem, Applied Soft Computing, 59:C, (389-404), Online publication date: 1-Oct-2017.
- Kalmár-Nagy T, Giardini G and Bak B (2017). The Multiagent Planning Problem, Complexity, 2017, (3), Online publication date: 1-Feb-2017.
- Ivanov S, Kibzun A and Osokin A (2016). Stochastic optimization model of locomotive assignment to freight trains, Automation and Remote Control, 77:11, (1944-1956), Online publication date: 1-Nov-2016.
- Farhad S, Nayeem M, Rahman M and Rahman M (2016). Mapping stream programs onto multicore platforms by local search and genetic algorithm, Computer Languages, Systems and Structures, 46:C, (182-205), Online publication date: 1-Nov-2016.
- Rubini L, Cancelliere R, Gallinari P and Grosso A (2016). Local search and pseudoinversion, Knowledge and Information Systems, 48:2, (493-503), Online publication date: 1-Aug-2016.
- Castillo F, Riff M and Montero E New Bounds for Office Space Allocation using Tabu Search Proceedings of the Genetic and Evolutionary Computation Conference 2016, (869-876)
- Saxena V, George T, Sabharwal Y and Real L Architecture aware resource allocation for structured grid applications Proceedings of the 15th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing, (555-564)
- Porter L, Laurenzano M, Tiwari A, Jundt A, Ward, Jr. W, Campbell R and Carrington L (2015). Making the Most of SMT in HPC, ACM Transactions on Architecture and Code Optimization, 11:4, (1-26), Online publication date: 9-Jan-2015.
- Levin A and Yovel U (2014). Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees, Journal of Combinatorial Optimization, 28:4, (726-747), Online publication date: 1-Nov-2014.
- Yeguas E, Marín-Jiménez M, Muñoz-Salinas R and Medina-Carnicer R (2014). Conflict-based pruning of a solution space within a constructive geometric constraint solver, Applied Intelligence, 41:3, (897-922), Online publication date: 1-Oct-2014.
- Pralet C, Verfaillie G, Maillard A, Hébrard E, Jozefowiez N, Huguet M, Desmousceaux T, Blanc-Paques P and Jaubert J Satellite data download management with uncertainty about the generated volumes Proceedings of the Twenty-Fourth International Conferenc on International Conference on Automated Planning and Scheduling, (430-438)
- Arce T, Román P, Velásquez J and Parada V (2014). Identifying web sessions with simulated annealing, Expert Systems with Applications: An International Journal, 41:4, (1593-1600), Online publication date: 1-Mar-2014.
- Ngo P, Sugimoto A, Kenmochi Y, Passat N and Talbot H Discrete Rigid Transformation Graph Search for 2D Image Registration Revised Selected Papers of the GCCV 2013, GPID 2013, PAESNPR 2013, and QACIVA 2013 on Image and Video Technology --- PSIVT 2013 Workshops - Volume 8334, (228-239)
- Li G, Günnemann S and Zaki M Stochastic subspace search for top-k multi-view clustering Proceedings of the 4th MultiClust Workshop on Multiple Clusterings, Multi-view Data, and Multi-source Knowledge-driven Clustering, (1-6)
- Dewilde T, Cattrysse D, Coene S, Spieksma F and Vansteenwegen P (2013). Heuristics for the traveling repairman problem with profits, Computers and Operations Research, 40:7, (1700-1707), Online publication date: 1-Jul-2013.
- Cui W, Xiao Y, Wang H, Lu Y and Wang W Online search of overlapping communities Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, (277-288)
- Yang K, Liu Y and Yang G (2013). Solving fuzzy p-hub center problem by genetic algorithm incorporating local search, Applied Soft Computing, 13:5, (2624-2632), Online publication date: 1-May-2013.
- Benlic U and Hao J A study of adaptive perturbation strategy for iterated local search Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization, (61-72)
- Bertsimas D, Iancu D and Katz D (2013). A New Local Search Algorithm for Binary Optimization, INFORMS Journal on Computing, 25:2, (208-221), Online publication date: 1-Apr-2013.
- Hemmati H, Arcuri A and Briand L (2013). Achieving scalable model-based testing through test case diversity, ACM Transactions on Software Engineering and Methodology, 22:1, (1-42), Online publication date: 1-Feb-2013.
- Dumrauf D and Monien B (2013). On the PLS-complexity of maximum constraint assignment, Theoretical Computer Science, 469, (24-52), Online publication date: 1-Jan-2013.
- Schulz C (2013). Efficient local search on the GPU-Investigations on the vehicle routing problem, Journal of Parallel and Distributed Computing, 73:1, (14-31), Online publication date: 1-Jan-2013.
- Hernandez A, Lucas T and Carlyle M (2012). Constructing nearly orthogonal latin hypercubes for any nonsaturated run-variable combination, ACM Transactions on Modeling and Computer Simulation, 22:4, (1-17), Online publication date: 1-Nov-2012.
- Fomin F, Golovach P, Nederlof J and Pilipczuk M Minimizing rosenthal potential in multicast games Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II, (525-536)
- Zhang K, Collins E and Shi D (2012). Centralized and distributed task allocation in multi-robot teams via a stochastic clustering auction, ACM Transactions on Autonomous and Adaptive Systems, 7:2, (1-22), Online publication date: 1-Jul-2012.
- Ceschia S, Di Gaspero L and Schaerf A (2012). Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem, Computers and Operations Research, 39:7, (1615-1624), Online publication date: 1-Jul-2012.
- Fister I, Fister I and Brest J A hybrid artificial bee colony algorithm for graph 3-coloring Proceedings of the 2012 international conference on Swarm and Evolutionary Computation, (66-74)
- Krokhin A and Marx D (2012). On the hardness of losing weight, ACM Transactions on Algorithms, 8:2, (1-18), Online publication date: 1-Apr-2012.
- Musharavati F and Hamouda A (2012). Enhanced simulated-annealing-based algorithms and their applications to process planning in reconfigurable manufacturing systems, Advances in Engineering Software, 45:1, (80-90), Online publication date: 1-Mar-2012.
- Chen Y, Wang Y, Xie Y and Takach A (2012). Parametric yield-driven resource binding in high-level synthesis with multi-Vth/Vdd library and device sizing, Journal of Electrical and Computer Engineering, 2012, (3-3), Online publication date: 1-Jan-2012.
- Benoist T, Gardi F, Jeanjean A and Estellon B (2011). Randomized Local Search for Real-Life Inventory Routing, Transportation Science, 45:3, (381-398), Online publication date: 1-Aug-2011.
- Bosman P and Thierens D The roles of local search, model building and optimal mixing in evolutionary algorithms from a bbo perspective Proceedings of the 13th annual conference companion on Genetic and evolutionary computation, (663-670)
- Gairing M and Savani R Computing stable outcomes in hedonic games with voting-based deviations The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2, (559-566)
- Rotta R and Noack A (2011). Multilevel local search algorithms for modularity clustering, ACM Journal of Experimental Algorithmics, 16, (2.1-2.27), Online publication date: 1-May-2011.
- Höhn W, König F, Möhring R and Lübbecke M (2011). Integrated Sequencing and Scheduling in Coil Coating, Management Science, 57:4, (647-666), Online publication date: 1-Apr-2011.
- Fellows M, Guo J, Moser H and Niedermeier R (2011). A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems, ACM Transactions on Computation Theory, 2:2, (1-23), Online publication date: 1-Mar-2011.
- Jansen T and Zarges C (2011). Analyzing different variants of immune inspired somatic contiguous hypermutations, Theoretical Computer Science, 412:6, (517-533), Online publication date: 1-Feb-2011.
- Marx D and Schlotter I (2011). Stable assignment with couples, Discrete Optimization, 8:1, (25-40), Online publication date: 1-Feb-2011.
- Weissgerber K, Lamont G, Borghetti B and Peterson G (2011). Determining solution space characteristics for real-time strategy games and characterizing winning strategies, International Journal of Computer Games Technology, 2011, (3-3), Online publication date: 1-Jan-2011.
- Gairing M and Savani R Computing stable outcomes in hedonic games Proceedings of the Third international conference on Algorithmic game theory, (174-185)
- Monien B, Dumrauf D and Tscheuschner T Local search Proceedings of the 37th international colloquium conference on Automata, languages and programming, (1-17)
- Dumrauf D and Süß T On the complexity of local search for weighted standard set problems Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe, (132-140)
- Abrão T, Oliveira L, Ciriaco F, Angélico B, Jeszensky P and Casadevall Palacio F (2010). S/MIMO MC-CDMA Heuristic Multiuser Detectors Based on Single-Objective Optimization, Wireless Personal Communications: An International Journal, 53:4, (529-553), Online publication date: 1-Jun-2010.
- Fister I, Mernik M and Filipič B (2010). A hybrid self-adaptive evolutionary algorithm for marker optimization in the clothing industry, Applied Soft Computing, 10:2, (409-422), Online publication date: 1-Mar-2010.
- Chen Y, Xie Y, Wang Y and Takach A Parametric yield driven resource binding in behavioral synthesis with multi-V/V library Proceedings of the 2010 Asia and South Pacific Design Automation Conference, (781-786)
- Gómez-Iglesias A, Vega-Rodríguez M, Castejón-Magaña F, Cárdenas-Montes M and Morales-Ramos E (2009). Evolutionary computation and grid computing to optimise nuclear fusion devices, Cluster Computing, 12:4, (439-448), Online publication date: 1-Dec-2009.
- Ruan S, Zhou Y, Yu F, Pattipati K, Willett P and Patterson-Hine A (2009). Dynamic multiple-fault diagnosis with imperfect tests, IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans, 39:6, (1224-1236), Online publication date: 1-Nov-2009.
- Dell'Amico M, Díaz J, Iori M and Montanari R (2009). The single-finger keyboard layout problem, Computers and Operations Research, 36:11, (3002-3012), Online publication date: 1-Nov-2009.
- Fellows M, Rosamond F, Fomin F, Lokshtanov D, Saurabh S and Villanger Y Local search Proceedings of the 21st International Joint Conference on Artificial Intelligence, (486-491)
- Mareček J (2009). Review of theoretical aspects of local search by Wil P. A. J. Michiels, Emile H. L. Aarts, and Jan H. M. Korst (Springer in the EATCS Series Monographs in Theoretical Computer Science, 007), ACM SIGACT News, 40:2, (27-30), Online publication date: 20-Jun-2009.
- Comellas F and Martinez-Navarro J Bumblebees Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, (811-814)
- Morris R, Gasch J and Khatib L (2009). Local Search for Optimal Global Map Generation Using Middecadal Landsat Images, AI Magazine, 30:2, (84-95), Online publication date: 1-Jun-2009.
- Masutti T and de Castro L (2009). Neuro-immune approach to solve routing problems, Neurocomputing, 72:10-12, (2189-2197), Online publication date: 1-Jun-2009.
- Şeref O, Ahuja R and Orlin J (2009). Incremental Network Optimization, Operations Research, 57:3, (586-594), Online publication date: 1-May-2009.
- Gómez-Iglesias A, Vega-Rodríguez M, Cárdenas-Montes M, Morales-Ramos E and Castejón-Magaña F Grid-oriented scatter search algorithm Proceedings of the 9th international conference on Adaptive and natural computing algorithms, (193-202)
- Ågren M, Flener P and Pearson J (2009). Revisiting constraint-directed search, Information and Computation, 207:3, (438-457), Online publication date: 1-Mar-2009.
- Sitarz S (2009). Ant algorithms and simulated annealing for multicriteria dynamic programming, Computers and Operations Research, 36:2, (433-441), Online publication date: 1-Feb-2009.
- Morris R, Gasch J, Khatib L and Covington S Local search for optimal global map generation using mid-decadal landsat images Proceedings of the 20th national conference on Innovative applications of artificial intelligence - Volume 3, (1706-1711)
- Bless P, Klabjan D and Chang S (2008). Heuristics for automated knowledge source integration and service composition, Computers and Operations Research, 35:4, (1292-1314), Online publication date: 1-Apr-2008.
- Comellas F and Paz-Sánchez J Reconstruction of networks from their betweenness centrality Proceedings of the 2008 conference on Applications of evolutionary computing, (31-37)
- Pauws S, Verhaegh W and Vossen M (2008). Music playlist generation by adapted simulated annealing, Information Sciences: an International Journal, 178:3, (647-662), Online publication date: 1-Feb-2008.
- Alon N, Fomin F, Gutin G, Krivelevich M and Saurabh S Better algorithms and bounds for directed maximum leaf problems Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science, (316-327)
- Alon N, Fomin F, Gutin G, Krivelevich M and Saurabh S Better Algorithms and Bounds for Directed Maximum Leaf Problems FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, (316-327)
- Brueggemann T, Hurink J, Vredeveld T and Woeginger G Very large-scale neighborhoods with performance guarantees for minimizing makespan on parallel machines Proceedings of the 5th international conference on Approximation and online algorithms, (41-54)
- Brueggemann T, Hurink J, Vredeveld T and Woeginger G Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines Approximation and Online Algorithms, (41-54)
- Grout V, Mcginn J and Davies J (2007). Real-time optimisation of access control lists for efficient Internet packet filtering, Journal of Heuristics, 13:5, (435-454), Online publication date: 1-Oct-2007.
- Costa A, Jones O and Kroese D (2007). Convergence properties of the cross-entropy method for discrete optimization, Operations Research Letters, 35:5, (573-580), Online publication date: 1-Sep-2007.
- Ågren M, Flener P and Pearson J (2007). Generic Incremental Algorithms for Local Search, Constraints, 12:3, (293-324), Online publication date: 1-Sep-2007.
- Schöning U Principles of stochastic local search Proceedings of the 6th international conference on Unconventional Computation, (178-187)
- Schaeffer S (2007). Survey, Computer Science Review, 1:1, (27-64), Online publication date: 1-Aug-2007.
- Borovska P Efficiency of parallel metaheuristics for solving combinatorial problems Proceedings of the 2007 international conference on Computer systems and technologies, (1-6)
- Barahona F, Chowdhary P, Ettl M, Huang P, Kimbrel T, Ladanyi L, Lee Y, Schieber B, Sourirajan K, Sviridenko M and Swirszcz G (2007). Inventory allocation and transportation scheduling for logistics of network-centric military operations, IBM Journal of Research and Development, 51:3, (391-407), Online publication date: 1-May-2007.
- van Hee K, Serebrenik A, Sidorova N, Voorhoeve M and van der Wal J (2007). Scheduling-free resource management, Data & Knowledge Engineering, 61:1, (59-75), Online publication date: 1-Apr-2007.
- Gao F and Woodward M (2007). A hybrid topological-stochastic partitioning method for scaling QoS routing algorithms, Computer Networks: The International Journal of Computer and Telecommunications Networking, 51:6, (1705-1724), Online publication date: 1-Apr-2007.
- Permann M Genetic algorithms for agent-based infrastructure interdependency modeling and analysis Proceedings of the 2007 spring simulation multiconference - Volume 2, (169-177)
- Steinhöfel K, Skaliotis A and Albrecht A Stochastic protein folding simulation in the d-dimensional HP-model Proceedings of the 1st international conference on Bioinformatics research and development, (381-394)
- Ribeiro C, Martins S and Rosseti I (2007). Metaheuristics for optimization problems in computer communications, Computer Communications, 30:4, (656-669), Online publication date: 15-Feb-2007.
- Cadoli M and Mancini T (2007). Combining relational algebra, SQL, constraint modelling, and local search, Theory and Practice of Logic Programming, 7:1-2, (37-65), Online publication date: 1-Jan-2007.
- Tagawa K and Kim H Multi-stage design of DMS filters with free & freeze method Proceedings of the 6th WSEAS international conference on Applied computer science, (508-513)
- Bompadre A, Dror M and Orlin J (2006). Improved bounds for vehicle routing solutions, Discrete Optimization, 3:4, (299-316), Online publication date: 1-Dec-2006.
- Ahr D and Reinelt G (2006). A tabu search algorithm for the min-max k-Chinese postman problem, Computers and Operations Research, 33:12, (3403-3422), Online publication date: 1-Dec-2006.
- Zahrani M, Loomes M, Malcolm J and Albrecht A (2006). Landscape analysis for multicast routing, Computer Communications, 30:1, (101-116), Online publication date: 1-Dec-2006.
- Abbiw-Jackson R, Golden B, Raghavan S and Wasil E (2006). A divide-and-conquer local search heuristic for data visualization, Computers and Operations Research, 33:11, (3070-3087), Online publication date: 1-Nov-2006.
- Khurana S, Kim G, Elaoud M, Samtani S and Staikos A Performance evaluation of a unicast routing control agent for proactive diverse link selection Proceedings of the 2006 IEEE conference on Military communications, (2923-2929)
- Cipriano R, Di Gaspero L and Dovier A Hybrid approaches for rostering Proceedings of the Third international conference on Hybrid Metaheuristics, (110-123)
- Charon I and Hudry O (2006). A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments, Discrete Applied Mathematics, 154:15, (2097-2116), Online publication date: 1-Oct-2006.
- Tagawa K and Matsuoka M Optimum Design of Surface Acoustic Wave Filters Based on the Taguchi’s Quality Engineering with a Memetic Algorithm Parallel Problem Solving from Nature - PPSN IX, (292-301)
- Tan W A simulation-based process model learning approach for dynamic enterprise process optimization Proceedings of the 2006 international conference on Intelligent computing: Part II, (438-449)
- Irnich S, Funke B and Grünert T (2006). Sequential search and its application to vehicle-routing problems, Computers and Operations Research, 33:8, (2405-2429), Online publication date: 1-Aug-2006.
- Zmazek B Multiple trips within working day in capacitated VRP with time windows Proceedings of the 10th WSEAS international conference on Computers, (93-99)
- Zahrani M, Loomes M, Malcolm J and Albrecht A Genetic local search for multicast routing Proceedings of the 8th annual conference on Genetic and evolutionary computation, (615-616)
- Osogami T and Itoko T Finding probably better system configurations quickly Proceedings of the joint international conference on Measurement and modeling of computer systems, (264-275)
- Osogami T and Itoko T (2006). Finding probably better system configurations quickly, ACM SIGMETRICS Performance Evaluation Review, 34:1, (264-275), Online publication date: 26-Jun-2006.
- Lambert T, Castro C, Monfroy E and Saubion F Solving the balanced academic curriculum problem with an hybridization of genetic algorithm and constraint propagation Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing, (410-419)
- Abidi S and Zeng Y Intelligent information personalization leveraging constraint satisfaction and association rule methods Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence, (134-145)
- Lambert T, Monfroy E and Saubion F A generic framework for local search Proceedings of the 6th international conference on Computational Science - Volume Part I, (641-648)
- Goldbarg E, de Souza G and Goldbarg M Particle swarm for the traveling salesman problem Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization, (99-110)
- Muhmmad R Parallelization of local search for Euclidean Steiner tree problem Proceedings of the 44th annual Southeast regional conference, (233-238)
- Ergun Ö and Orlin J (2006). A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem, Discrete Optimization, 3:1, (78-85), Online publication date: 1-Mar-2006.
- Alber J, Dorn B and Niedermeier R A general data reduction scheme for domination in graphs Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science, (137-147)
- Björklund H and Vorobyov S (2005). Combinatorial structure and randomized subexponential algorithms for infinite games, Theoretical Computer Science, 349:3, (347-360), Online publication date: 16-Dec-2005.
- Poranen T (2005). A Genetic Hillclimbing Algorithm for the Optimal Linear Arrangement Problem, Fundamenta Informaticae, 68:4, (333-356), Online publication date: 1-Dec-2005.
- Bontridder K (2005). Minimizing Total Weighted Tardiness in a Generalized Job Shop, Journal of Scheduling, 8:6, (479-496), Online publication date: 1-Dec-2005.
- Binucci C, Didimo W, Liotta G and Nonato M (2005). Orthogonal drawings of graphs with vertex and edge labels, Computational Geometry: Theory and Applications, 32:2, (71-114), Online publication date: 1-Oct-2005.
- Monfroy E, Saubion F and Lambert T Invited contribution Proceedings of the 5th international conference on Frontiers of Combining Systems, (138-167)
- Sontrop H, van der Horn P and Uetz M Fast ejection chain algorithms for vehicle routing with time windows Proceedings of the Second international conference on Hybrid Metaheuristics, (78-89)
- Golden B, Raghavan S and Stanojević D (2005). Heuristic Search for the Generalized Minimum Spanning Tree Problem, INFORMS Journal on Computing, 17:3, (290-304), Online publication date: 1-Jul-2005.
- Wijnalda G, Pauws S, Vignoli F and Stuckenschmidt H (2005). A Personalized Music System for Motivation in Sport Performance, IEEE Pervasive Computing, 4:3, (26-32), Online publication date: 1-Jul-2005.
- Sureka A and Wurman P Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions Proceedings of the 7th annual conference on Genetic and evolutionary computation, (2097-2103)
- Takeda T, Ono H, Sadakane K and Yamashita M A local search based barrier height estimation algorithm for DNA molecular transitions Proceedings of the 11th international conference on DNA Computing, (359-370)
- Poranen T (2005). A Genetic Hillclimbing Algorithm for the Optimal Linear Arrangement Problem, Fundamenta Informaticae, 68:4, (333-356), Online publication date: 1-Jun-2005.
- Blum C (2005). Beam-ACO, Computers and Operations Research, 32:6, (1565-1591), Online publication date: 1-Jun-2005.
- Ågren M, Flener P and Pearson J Set variables and local search Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, (19-33)
- Östergård P, Quistorff J and Wassermann A (2005). New Results on Codes with Covering Radius 1 and Minimum Distance 2, Designs, Codes and Cryptography, 35:2, (241-250), Online publication date: 1-May-2005.
- Gomes N, Vale Z and Ramos C Combining metaheuristics and constraint programming to solve a scheduling problem Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science, (1-6)
- Li V and Curry G (2005). Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search, Computers and Operations Research, 32:4, (825-848), Online publication date: 1-Apr-2005.
- Hoai N, McKay R, Essam D and Hao H Genetic transposition in tree-adjoining grammar guided genetic programming Proceedings of the 8th European conference on Genetic Programming, (108-119)
- Lambert T, Monfroy E and Saubion F Solving strategies using a hybridization model for local search and constraint propagation Proceedings of the 2005 ACM symposium on Applied computing, (398-403)
- Angel E A survey of approximation results for local search algorithms Efficient Approximation and Online Algorithms, (30-73)
- Poranen T (2005). Heuristics for the Maximum Outerplanar Subgraph Problem, Journal of Heuristics, 11:1, (59-88), Online publication date: 1-Jan-2005.
- Barbieri M, Dimitrova N and Agnihotri L Movie-in-a-Minute Proceedings of the 5th Pacific Rim Conference on Advances in Multimedia Information Processing - Volume Part II, (9-18)
- Burke E, De Causmaecker P, Berghe G and Van Landeghem H (2004). The State of the Art of Nurse Rostering, Journal of Scheduling, 7:6, (441-499), Online publication date: 1-Nov-2004.
- Fortz B and Thorup M (2004). Increasing Internet Capacity Using Local Search, Computational Optimization and Applications, 29:1, (13-48), Online publication date: 1-Oct-2004.
- Vaughan D and Jacobson S (2004). Tabu Guided Generalized Hill Climbing Algorithms, Methodology and Computing in Applied Probability, 6:3, (343-354), Online publication date: 1-Sep-2004.
- Hashempour H and Lombardi F Evaluation of heuristic techniques for test vector ordering Proceedings of the 14th ACM Great Lakes symposium on VLSI, (96-99)
- Albrecht A and Wong C (2004). Approximation of Boolean Functions by Local Search, Computational Optimization and Applications, 27:1, (53-82), Online publication date: 1-Jan-2004.
- Charcranoon S, Robertazzi T and Luryi S (2004). Load sequencing for a parallel processing utility, Journal of Parallel and Distributed Computing, 64:1, (29-35), Online publication date: 1-Jan-2004.
- Angel E, Bampis E and Gourvès L (2004). Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem, Theoretical Computer Science, 310:1-3, (135-146), Online publication date: 1-Jan-2004.
- Lee C, Lee Z and Su S Immunity based genetic algorithm for solving quadratic assignment problem (QAP) Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing, (1-9)
- Altiparmak F, Dengiz B and Smith A (2003). Optimal Design of Reliable Computer Networks, Journal of Heuristics, 9:6, (471-487), Online publication date: 1-Dec-2003.
- Roughan M, Thorup M and Zhang Y Traffic engineering with estimated traffic matrices Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement, (248-258)
- Gerevini A and Serina I (2003). Planning as Propositional CSP, Constraints, 8:4, (389-413), Online publication date: 1-Oct-2003.
- Blum C and Roli A (2003). Metaheuristics in combinatorial optimization, ACM Computing Surveys, 35:3, (268-308), Online publication date: 1-Sep-2003.
- Choe H, Choi S and Moon B A hybrid genetic algorithm for the hexagonal tortoise problem Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI, (850-861)
- Blum C and Ehrgott M (2003). Local search algorithms for the k-cardinality tree problem, Discrete Applied Mathematics, 128:2-3, (511-540), Online publication date: 1-Jun-2003.
- Dumitrescu I and Stützle T Combinations of local search and exact algorithms Proceedings of the 2003 international conference on Applications of evolutionary computing, (211-223)
- Varela L and Ribeiro R (2003). Evaluation of Simulated Annealing to solve fuzzy optimization problems, Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology, 14:2, (59-71), Online publication date: 1-Apr-2003.
- Krysta P (2003). Approximating minimum size {1,2}-connected networks, Discrete Applied Mathematics, 125:2-3, (267-288), Online publication date: 1-Feb-2003.
- Dorndorf U, Pesch E and Huy T Machine learning by schedule decomposition Advances in evolutionary computing, (773-798)
- Lodi A, Martello S and Vigo D (2002). Recent advances on two-dimensional bin packing problems, Discrete Applied Mathematics, 123:1-3, (379-396), Online publication date: 15-Nov-2002.
- Ahuja R, Ergun Ö, Orlin J and Punnen A (2002). A survey of very large-scale neighborhood search techniques, Discrete Applied Mathematics, 123:1-3, (75-102), Online publication date: 15-Nov-2002.
- Joest M and Stille W A user-aware tour proposal framework using a hybrid optimization approach Proceedings of the 10th ACM international symposium on Advances in geographic information systems, (81-87)
- Ghosh D and Sierksma G (2002). Complete Local Search with Memory, Journal of Heuristics, 8:6, (571-584), Online publication date: 1-Nov-2002.
- Ardagna D and Francalanci C A cost-oriented methodology for the design of web based IT architectures Proceedings of the 2002 ACM symposium on Applied computing, (1127-1133)
- Mathias E, da Costa C, Dotti F and Müller F DEVOpT Proceedings of the 2002 ACM symposium on Applied computing, (870-875)
- Steinhöfel K, Albrecht A and Wong C (2002). Fast parallel heuristics for the job shop scheduling problem, Computers and Operations Research, 29:2, (151-169), Online publication date: 1-Feb-2002.
- Zhang W Search techniques Handbook of data mining and knowledge discovery, (169-184)
- Gärtner J, Musliu N and Slany W (2001). Rota: a research project on algorithms for workforce scheduling and shift design optimization, AI Communications, 14:2, (83-92), Online publication date: 1-Apr-2001.
- de Kock E, Aarts E and Essink G Real-time scheduling in video systems Engineering of distributed control systems, (113-132)
- Emden-Weinert T and Proksch M (1999). Best Practice Simulated Annealing for the Airline Crew Scheduling Problem, Journal of Heuristics, 5:4, (419-436), Online publication date: 1-Dec-1999.
- Pesant G and Gendreau M (1999). A Constraint Programming Framework for Local Search Methods, Journal of Heuristics, 5:3, (255-279), Online publication date: 1-Oct-1999.
- Rubinstein R (1999). The Cross-Entropy Method for Combinatorial and Continuous Optimization, Methodology and Computing in Applied Probability, 1:2, (127-190), Online publication date: 1-Sep-1999.
- Dell‘amico M, Lodi A and Maffioli F (1999). Solution of the Cumulative Assignment Problem With a Well-Structured TabuSearch Method, Journal of Heuristics, 5:2, (123-143), Online publication date: 1-Jul-1999.
- Privault C and Herault L (1998). Solving a Real World Assignment Problem with a Metaheuristic, Journal of Heuristics, 4:4, (383-398), Online publication date: 1-Dec-1998.
- Rao S and Smith W Approximating geometrical graphs via “spanners” and “banyans” Proceedings of the thirtieth annual ACM symposium on Theory of computing, (540-550)
- Buntine W, Su L, Newton A and Mayer A Adaptive methods for netlist partitioning Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design, (356-363)
- Aarts E, Essink G and de Kock E Recursive Bipartitioning of Signal Flow Graphs for Programmable Video Signal Processors Proceedings of the 1996 European conference on Design and Test
- Wu Q, Sun P and Boukerche A A Novel Data Collector Path Optimization Method for Lifetime Prolonging in Wireless Sensor Networks 2019 IEEE Global Communications Conference (GLOBECOM), (1-6)
- Takahashi R Verification of thermo-dynamical genetic algorithm to solve the function optimization problem through diversity measurement — Diversity measurement and its application to selection strategies in genetic algorithms 2016 IEEE Congress on Evolutionary Computation (CEC), (168-177)
Recommendations
A discrete gravitational search algorithm for solving combinatorial optimization problems
Metaheuristics are general search strategies that, at the exploitation stage, intensively exploit areas of the solution space with high quality solutions and, at the exploration stage, move to unexplored areas of the solution space when necessary. The ...
Hybrid metaheuristics in combinatorial optimization: A survey
Research in metaheuristics for combinatorial optimization problems has lately experienced a noteworthy shift towards the hybridization of metaheuristics with other techniques for optimization. At the same time, the focus of research has changed from ...