Handbook of metaheuristics

DOI10.1007/978-1-4419-1665-5zbMath1198.90002MaRDI QIDQ5901027

No author found.

Publication date: 4 August 2010

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

Full work available at URL: https://doi.org/10.1007/978-1-4419-1665-5

Mathematics Subject Classification ID

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

GOAL solver: a hybrid local search based solver for high school timetabling, Elective course student sectioning at Danish high schools, Human resources scheduling to improve the product quality according to exhaustion limit, An iterated local search algorithm for the single-vehicle cyclic inventory routing problem, Effective learning hyper-heuristics for the course timetabling problem, Unified encoding for hyper-heuristics with application to bioinformatics, Sequential and parallel large neighborhood search algorithms for the periodic location routing problem, Multi-objectivization, fitness landscape transformation and search performance: a case of study on the HP model for protein structure prediction, Decomposition based hybrid metaheuristics, A multi-layer line search method to improve the initialization of optimization algorithms, A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience, An iterated multi-stage selection hyper-heuristic, The vehicle-routing problem with time windows and driver-specific times, A two-stage solution method for the annual dairy transportation problem, A formulation space search heuristic for packing unequal circles in a fixed size circular container, The electric fleet size and mix vehicle routing problem with time windows and recharging stations, A two-phase algorithm for the cyclic inventory routing problem, A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints, A hybrid data mining GRASP with path-relinking, The dial-A-ride problem with transfers, A variable neighborhood search particle filter for bearings-only target tracking, Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach, Variable neighborhood search for the workload balancing problem in service enterprises, Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem, Heuristics and simulated annealing procedures for the accessibility windows assembly line problem level 1 (AWALBP-L1), Heuristics for the multi-item capacitated lot-sizing problem with lost sales, Hybrid column generation and large neighborhood search for the dial-a-ride problem, A rich vehicle routing problem dealing with perishable food: a case study, A greedy topology design to accelerate consensus in broadcast wireless sensor networks, Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs, A heuristic for the circle packing problem with a variety of containers, ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness, Continuous global optimization through the generation of parametric curves, Restart strategies for GRASP with path-relinking heuristics, Recent trends in metaheuristics for stochastic combinatorial optimization, A study on meme propagation in multimemetic algorithms, An improved hybrid ant-local search algorithm for the partition graph coloring problem, Mathematical model applied to single-track line scheduling problem in Brazilian railways, A matheuristic approach to the orienteering problem with service time dependent profits, Alternative evaluation functions for the cyclic bandwidth sum problem, The impact of solution representations on heuristic net present value optimization in discrete time/cost trade-off project scheduling with multiple cash flow and payment models, Making a state-of-the-art heuristic faster with data mining, Application of a memetic algorithm for the optimal control of bunches of trajectories of nonlinear deterministic systems with incomplete feedback, A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times, A path-relinking algorithm for the multi-mode resource-constrained project scheduling problem, A parallel local search framework for the fixed-charge multicommodity network flow problem, Bi-objective optimisation model for installation scheduling in offshore wind farms, A large neighborhood search heuristic for supply chain network design, An effective iterated tabu search for the maximum bisection problem, A cellular memetic algorithm for the examination timetabling problem, Tabu search and iterated local search for the cyclic bottleneck assignment problem, The static bike relocation problem with multiple vehicles and visits, A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem, On a smoothed penalty-based algorithm for global optimization, Graph multi-coloring for a job scheduling application, Empirical study of variable neighbourhood search applied to the optimization of the internal delivery vehicles at maritime container terminals, Evaluating balancing on social networks through the efficient solution of correlation clustering problems, Order matters -- a variable neighborhood search for the swap-body vehicle routing problem, Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions, Matheuristics for optimizing the network in German wagonload traffic, Adaptive large neighborhood search on the graphics processing unit, A set partitioning heuristic for the home health care routing and scheduling problem, On the use of learnheuristics in vehicle routing optimization problems with dynamic inputs, A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics, Numerical reduced variable optimization methods via implicit functional dependence with applications, Advancing Shannon entropy for measuring diversity in systems, Knowledge-guided local search for the vehicle routing problem, Heuristics for vehicle routing problems: sequence or set optimization?, Revisiting simulated annealing: a component-based analysis, Simulated annealing approach to nurse rostering benchmark and real-world instances, RBFOpt: an open-source library for black-box optimization with costly function evaluations, A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints, A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems, Capital- and resource-constrained project scheduling with net present value optimization, Quantile and mean value measures of search process complexity, Scheduling in-house transport vehicles to feed parts to automotive assembly lines, Markov chain methods for the bipartite Boolean quadratic programming problem, A methodology for determining an effective subset of heuristics in selection hyper-heuristics, A hybrid metaheuristic for resource-constrained project scheduling with flexible resource profiles, Large multiple neighborhood search for the clustered vehicle-routing problem, Gaussian variable neighborhood search for continuous optimization, Hybrid adaptive large neighborhood search for the optimal statistic median problem, An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem, Heuristic optimisation in financial modelling, Solving the wire-harness design problem at a European car manufacturer, A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations, Metaheuristics for a scheduling problem with rejection and tardiness penalties, Adaptive large neighborhood search for solving the circle bin packing problem, Multi-objective optimization of a two-echelon vehicle routing problem with vehicle synchronization and `grey zone' customers arising in urban logistics, A comparative analysis of two matheuristics by means of merged local optima networks, A matheuristic for parallel machine scheduling with tool replacements, Efficient incrementing heuristics for generalized \(p\)-location problems, On the one-to-one pickup-and-delivery problem with time windows and trailers, Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion, On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs, Combining workload balance and patient priority maximisation in operating room planning through hierarchical multi-objective optimisation, Consistent vehicle routing with pickup decisions -- insights from sport academy training transfers, Iterated local search for the placement of wildland fire suppression resources, Optimal budget allocation policy for tabu search in stochastic simulation optimization, Global sensing search for nonlinear global optimization, Unnamed Item, Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem, Comparison of Different ACO Start Strategies Based on InterCriteria Analysis, Graph Coloring Models and Metaheuristics for Packing Applications, The school bus routing and scheduling problem with transfers, A heuristic hybrid framework for vector job scheduling, On searching explanatory argumentation graphs, Unnamed Item, Zero-Inertia Limit: From Particle Swarm Optimization to Consensus-Based Optimization, On black-box optimization in divide-and-conquer SAT solving, A hybrid algorithm for the drilling rig routing problem, On Bilevel Optimization with Inexact Follower, Discrete self-organizing migration algorithm and p-location problems, From particle swarm optimization to consensus based optimization: Stochastic modeling and mean-field limit, Application of the “descent with mutations” metaheuristic to a clique partitioning problem, A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems, An algorithm for reducing the dimension and size of a sample for data exploration procedures, Optimization in liner shipping, Optimization in liner shipping, Lagrangian heuristics for the quadratic knapsack problem, Simulation optimization: a review of algorithms and applications, Design of a quality control network for an international food company, Fat-tailed distributions for continuous variable neighborhood search, An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems, The invisible‐hand heuristic for origin‐destination integer multicommodity network flows, Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems, An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls, A recombination‐based matheuristic for mixed integer programming problems with binary variables, Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems, A hybrid data mining heuristic to solve the point‐feature cartographic label placement problem, Iterated multilevel simulated annealing for large-scale graph conductance minimization, A multilevel evaluation method for heuristics with an application to the VRPTW, Complexity and heuristics for the weighted max cut‐clique problem, Lexicographic optimization‐based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem, Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem, Heuristic and metaheuristic procedures for the buffer sizing problem in parallel assembly lines balancing problem with multi-line workstations and different cycle times, Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses, Job scheduling under time-of-use energy tariffs for sustainable manufacturing: a survey, A biased random‐key genetic algorithm for the home health care problem, Cooperative coevolutionary genetic programming hyper-heuristic for budget constrained dynamic multi-workflow scheduling in cloud computing, Hybridizations of evolutionary algorithms with large neighborhood search, Global optimization using random embeddings, Buffer dimensioning and control stations positioning with a space partitioning-tabu search approach, Solution Methods for Fuel Supply of Trains, Learning-augmented heuristics for scheduling parallel serial-batch processing machines, A new fuzzy model for multi-criteria project portfolio selection based on modified Kerre's inequality, Binary interaction methods for high dimensional global optimization and machine learning, The hybrid electric vehicle-traveling salesman problem with time windows, Parallel computational optimization in operations research: a new integrative framework, literature review and research directions, A penalty-based multi-objectivization approach for single objective optimization, Properties of the sign gradient descent algorithms, An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables, Local search with a SAT oracle for combinatorial optimization, Integrated order batching and vehicle routing operations in grocery retail -- a general adaptive large neighborhood search algorithm, Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art, Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning, An iterative three-component heuristic for the team orienteering problem with time windows, Relations, models and a memetic approach for three degree-dependent spanning tree problems, \(K\)-means cloning: adaptive spherical \(K\)-means clustering, Managing premium wines using an \((s - 1,s)\) inventory policy: a heuristic solution approach, A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems, Method of parametric optimization of nonlinear continuous systems of joint estimation and control, A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm, Optimized operating rules for short-term hydropower planning in a stochastic environment, Scheduling a non-professional indoor football league: a tabu search based approach, A genetic algorithm for scheduling open shops with sequence-dependent setup times, The influence of problem specific neighborhood structures in metaheuristics performance, A review of urban transportation network design problems, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, Column-generation based bounds for the homogeneous areas problem, The consultation timetabling problem at Danish high schools, Local search heuristics for the zone planning problem, Learning variable neighborhood search for a scheduling problem with time windows and rejections, Approaching the rank aggregation problem by local search-based metaheuristics, A memetic algorithm for the multi trip vehicle routing problem, DILS: constrained clustering through dual iterative local search, A tabu search algorithm with controlled randomization for constructing feasible university course timetables, Iterated local search with tabu search for the weighted vertex coloring problem, Performance safety enforcement in stochastic event graphs against boost and slow attacks, Large multiple neighborhood search for the soft-clustered vehicle-routing problem, Just-in-time scheduling for a distributed concrete precast flow shop system, Adjusting the order crossover operator for capacitated vehicle routing problems, Optimising portfolio diversification and dimensionality, Walking Membranes: Grid-Exploring P Systems with Artificial Evolution for Multi-purpose Topological Optimisation of Cascaded Processes, Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When?, Consensus-based optimization on hypersurfaces: Well-posedness and mean-field limit