Handbook of metaheuristics

From MaRDI portal
Revision as of 12:42, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5917497


DOI10.1007/b101874zbMath1058.90002MaRDI QIDQ5917497

No author found.

Publication date: 29 April 2003

Published in: International Series in Operations Research \& Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b101874


68T05: Learning and adaptive systems in artificial intelligence

90C59: Approximation methods and heuristics in mathematical programming

00B15: Collections of articles of miscellaneous specific interest

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68-00: General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science

90-00: General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming


Related Items

Analysing the Robustness of Multiobjectivisation Approaches Applied to Large Scale Optimisation Problems, Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints, Clique Partitioning for Clustering: A Comparison withK-Means and Latent Class Analysis, Multi-operator based biogeography based optimization with mutation for global numerical optimization, Using multi-objective evolutionary algorithms for single-objective optimization, Algorithms for the maximum \(k\)-club problem in graphs, Dominance rules in combinatorial optimization problems, A simulated annealing hyper-heuristic methodology for flexible decision support, On solving the forward kinematics of 3RPR planar parallel manipulator using hybrid metaheuristics, A framework for analyzing sub-optimal performance of local search algorithms, Autonomous operator management for evolutionary algorithms, A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration, A unified framework for population-based metaheuristics, Restart strategies for GRASP with path-relinking heuristics, A perturb biogeography based optimization with mutation for global numerical optimization, An evolutionary method for complex-process optimization, Metaheuristics in combinatorial optimization, A survey of search methodologies and automated system development for examination timetabling, Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, A simulation-based multi-objective genetic algorithm (SMOGA) procedure for BOT network design problem, A multi-objective production scheduling case study solved by simulated annealing, The \(p\)-median problem: a survey of metaheuristic approaches, On initial populations of a genetic algorithm for continuous optimization problems, Genetic algorithms to solve the cover printing problem, Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach, An updated survey on the linear ordering problem for weighted or unweighted tournaments, Variable neighbourhood search: methods and applications, Hybrid variable neighbourhood approaches to university exam timetabling, A hybrid heuristic algorithm for the open-pit-mining operational planning problem, Solving weighted MAX-SAT via global equilibrium search, A route set construction algorithm for the transit network design problem, Allocation search methods for a generalized class of location-allocation problems, Extended ant colony optimization for non-convex mixed integer nonlinear programming, A novel hybrid differential evolution and particle swarm optimization algorithm for unconstrained optimization, Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems, Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem, Variable neighbourhood search: Methods and applications, Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report, Hybridization of very large neighborhood search for ready-mixed concrete delivery problems, Using a greedy random adaptative search procedure to solve the cover printing problem, Genetic algorithm based approach for the integrated airline crew-pairing and rostering problem, On single-walk parallelization of the job shop problem solving algorithms, Parallel hybrid heuristics for the permutation flow shop problem, Linear combinations of heuristics for examination timetabling, Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling, Reformulation descent applied to circle packing problems, Robust metaheuristic algorithm for redundancy optimization in large-scale complex systems, Exact and heuristic procedures for solving the fuzzy portfolio selection problem, Biased random-key genetic algorithms with applications in telecommunications, A new model and a hyper-heuristic approach for two-dimensional shelf space allocation, Finding local optima of high-dimensional functions using direct search methods, A graph-based hyper-heuristic for educational timetabling problems, Lot sizing and furnace scheduling in small foundries, Operations research and data mining, A bi-objective coordination setup problem in a two-stage production system, Variable neighborhood search and local branching, A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem, Noising methods for a clique partitioning problem, Image registration with iterated local search, Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems, Continuous scatter search: an analysis of the integration of some combination methods and improvement strategies, A scatter search heuristic for the capacitated clustering problem, A tabu search heuristic for the truck and trailer routing problem, A survey on the linear ordering problem for weighted or unweighted tournaments, Metaheuristics and cooperative approaches for the bi-objective ring star problem, The multiobjective multidimensional knapsack problem: a survey and a new approach, Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines, Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility, Unnamed Item, Learning cooperative linguistic fuzzy rules using the best-worst ant system algorithm, Convergence speed in multi-objective metaheuristics: Efficiency criteria and empirical study, GREEDY ALGORITHMS FOR PACKING UNEQUAL SPHERES INTO A CUBOIDAL STRIP OR A CUBOID, An efficient metaheuristic for integrated scheduling and staffing IT projects based on a generalized minimum cost flow network, EFFICIENT GRID SCHEDULING THROUGH THE INCREMENTAL SCHEDULE-BASED APPROACH, A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces, Spacecraft thermal design with the Generalized Extremal Optimization Algorithm, A study on diversity and cooperation in a multiagent strategy for dynamic optimization problems, An ant colony optimisation algorithm for scheduling in agile manufacturing, A Decade of Capacitated Arc Routing, A personal perspective on problem solving by general purpose solvers, Self-tuning of the noising methods