Tabu Search—Part I
From MaRDI portal
Publication:4018159
DOI10.1287/ijoc.1.3.190zbMath0753.90054OpenAlexW4246598646WikidataQ56017138 ScholiaQ56017138MaRDI QIDQ4018159
Publication date: 16 January 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1.3.190
Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Local optima topology for the \(k\)-coloring problem, On tabu search for the location of interacting hub facilities, A parallel tabu search algorithm for large traveling salesman problems, A tabu search algorithm for computing an operational timetable, Heuristics for laying out information graphs, Simulated annealing and tabu search in the long run: A comparison on QAP tasks, Large-scale layout of facilities using a heuristic hybrid algorithm, Simulated annealing and tabu search approaches to unidirectional flowpath design for automated guided vehicle systems, Combinatorial optimization techniques for spacecraft scheduling automation, Unrelated parallel machine scheduling using local search, Simulated annealing and tabu search: Lessons from a line search, A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows, Extensions of a tabu search adaptation to the quadratic assignment problem, A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints, Evolution based learning in a job shop scheduling environment, Genetic algorithms and tabu search: Hybrids for optimization, Effective job shop scheduling through active chain manipulation, The depth and width of local minima in discrete solution spaces, Construction of exact D-optimal designs by tabu search, Boolean query optimization and the 0-1 hyperbolic sum problem, A molecular structure matching problem, Fast local search and guided local search and their application to British Telecom's workforce scheduling problem, BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem, A design of the minimum cost ring-chain network with dual-homing survivability: A tabu search approach, Heuristic algorithms for the two-stage hybrid flowshop problem, ARC crossing minimization in hierarchical digraphs with tabu search, Using tabu search to solve the common due date early/tardy machine scheduling problem, A methodology for simultaneously dealing with machine duplication and part subcontracting in cellular manufacturing systems, Variable neighborhood search, An analysis of parallel heuristics for task allocation in multicomputers, New upper bounds for binary covering codes, An experimental evaluation of local search heuristics for graph partitioning, A tabu search algorithm for the open shop problem, Modelling constant weight codes using tabu search, Some thoughts on combinatorial optimisation, Heuristics for biquadratic assignment problems and their computational comparison, Using tabu search for solving a dynamic multi-terminal truck dispatching problem, A new extension of local search applied to the Dial-A-Ride problem, Improvement heuristics for the vehicle routing problem based on simulated annealing, Aggregate planning and scheduling in the food industry: A case study, A model for designing callable bonds and its solution using tabu search, Algorithms for the item assortment problem: an application to vending machine products, Improved heuristic methods for multiple stage production planning., A composite heuristic for the single machine early/tardy job scheduling problem., A local search template., Determining fuzzy membership functions with tabu search -- an application to control, Hybrid flow-shop scheduling problems with multiprocessor task systems., Variable neighborhood tabu search and its application to the median cycle problem., A variable neighborhood search for graph coloring., A greedy-based neighborhood search approach to a nurse rostering problem., A repairing technique for the local search of the job-shop problem., An efficient tabu search approach for the two-machine preemptive open shop scheduling problem., Using penalty function and tabu search to solve cell formation problems with fixed cell cost., The multidimensional 0-1 knapsack problem: an overview., Upper bounds for covering arrays by tabu search., Tabu search for fuzzy optimization and applications., An ant colony system for permutation flow-shop sequencing, Tabu search applied to global optimization, A perspective on the foundation and evolution of the linkage learning genetic algorithms, A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem, Distribution requirements and compactness constraints in school timetabling, Heuristic concentration and tabu search: A head to head comparison, An empirical study of a new metaheuristic for the traveling salesman problem, A model for warehouse order picking, Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees, A large step random walk for minimizing total weighted tardiness in a job shop, Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs, Sequencing of jobs in some production system, Local search metaheuristics for discrete-continuous scheduling problems, Location of hubs in a competitive environment, A tabu search approach for the flow shop scheduling problem, Constructing a course schedule by solving a series of assignment type problems, Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem, On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties, A Lagrangian reconstruction of GENET, Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions, Heuristic and exact methods for the cutting sequencing problem, Modeling and solving a real-life assignment problem at universities, Using tabu search to schedule activities of stochastic resource-constrained projects, Digital data networks design using genetic algorithms, Local search algorithms for the multiprocessor flow shop scheduling problem, Algorithms for a multi-level network optimization problem, Constructive heuristic algorithms for the open shop problem, A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size, Tabu list management methods for a discrete-continuous scheduling problem, A tabu search algorithm for scheduling a single robot in a job-shop environment, Genetic local search in combinatorial optimization, A new global approach for \(0\)-\(1\) polynomial programs, Tabu search for the job-shop scheduling problem with multi-purpose machines, A note on global optimization in adaptive control, econometrics and macroeconomics., The flow shop with parallel machines: A tabu search approach, Tabu search for resource-constrained scheduling, A tabu search approach to machine scheduling, Determining buffer location and size in production lines using tabu search, The hot strip mill production scheduling problem: A tabu search approach, Multiproduct production planning in the presence of work-force learning, A tabu search algorithm for the optimisation of telecommunication networks, Tabu search in audit scheduling, A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints, A two-dimensional mapping for the traveling salesman problem, When it is worthwhile to work with the stochastic RCPSP?, Evolution of the population of a genetic algorithm using particle swarm optimization: application to clustering analysis, A survey for the quadratic assignment problem, Landscape-level optimization using tabu search and stand density-related forest management prescriptions, A tabu search algorithm for maximum parsimony phylogeny inference, An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems, Optimized evolutionary strategies in conformational sampling, Applying the attribute based hill climber heuristic to the vehicle routing problem, A tabu search approach for scheduling hazmat shipments, Multi-objectives tabu search based algorithm for progressive resource allocation, Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, The \(p\)-median problem: a survey of metaheuristic approaches, A particle swarm optimization approach to the nonlinear resource allocation problem, Optimizing heuristic search in forest planning, Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search, Short-term work scheduling with job assignment flexibility for a multi-fleet transport system, General solutions to the single vehicle routing problem with pickups and deliveries, A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal, Multi-objective task allocation in distributed computing systems by hybrid particle swarm optimization, Multilevel minimum cross entropy threshold selection based on particle swarm optimization, Tabu search algorithms for cyclic machine scheduling problems, Minimizing total weighted tardiness in a generalized job shop, Two-machine flow shop problems with a single server, Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge, Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem, A new fuzzy operator and its application to topology design of distributed local area networks, A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem, Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem, Fault-aware communication mapping for noCs with guaranteed latency, A constraint-based local search backend for MiniZinc, Prioritized interdiction of nuclear smuggling via tabu search, Some efficient heuristic methods for the flow shop sequencing problem, Comparing different metaheuristic approaches for the median path problem with bounded length, Scatter search for the 0-1 multidimensional knapsack problem, An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP), Facility location for market capture when users rank facilities by shorter travel and waiting times, Tabu search for attribute reduction in rough set theory, Least-cost network topology design for a new service: An application of tabu search, Bifurcation analysis on a discrete-time tabu learning model, Cyclic job shop scheduling problems with blocking, A comparison of several nearest neighbor classifier metrics using tabu search algorithm for the feature selection problem, Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem, Ant colony optimization combined with taboo search for the job shop scheduling problem, Scheduling in a continuous galvanizing line, A hybrid stochastic genetic-GRASP algorithm for clustering analysis, Design of hybrids for the minimum sum-of-squares clustering problem, Location and sizing of offshore platforms for oil exploration, The traveling salesman problem: An overview of exact and approximate algorithms, EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem, Constructing 1-rotational NRDFs through an optimization approach: new (46,9,8), (51,10,9) and (55,9,8)-NRBDs, The capacity and distance constrained plant location problem, Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation, Experimental analysis of simulated annealing based algorithms for the layout problem, Tabu search-based metaheuristic algorithm for software system reliability problems, A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers, A tabu search approach to an urban transport problem in northern Spain, The impact of operations redesign on the safety stock investment in supply chains, Experiments with, and on, algorithms for maximum likelihood clustering, Discrete support vector decision trees via tabu search, Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times, A connectionist approach to the quadratic assignment problem, Optimization of nearest neighbor classifiers via metaheuristic algorithms for credit risk assessment, Continuous ant colony system and tabu search algorithms hybridized for global minimization of continuous multi-minima functions, Bounds for short covering codes and reactive tabu search, NeuroGenetic approach for combinatorial optimization: an exploratory analysis, A fast memoryless interval-based algorithm for global optimization, Near-optimal solutions for the generalized max-controlled set problem, Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion, A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem, Planning for agricultural forage harvesters and trucks: model, heuristics, and case study, A population-based variable neighborhood search for the single machine total weighted tardiness problem, Analysis of new variable selection methods for discriminant analysis, Computing lower and upper bounds for a large-scale industrial job shop scheduling problem, Optimizing tabu list size for the traveling salesman problem, Tactical design of rail freight networks. I: Exact and heuristic methods, Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs, An SA/TS mixture algorithm for the scheduling tardiness problem, A simple tabu search method to solve the mixed-integer linear bilevel programming problem, Massively parallel analog tabu search using neural networks applied to simple plant location problems, The job shop scheduling problem: Conventional and new solution techniques, Optimizing simulated annealing schedules with genetic programming, General local search methods, The single-finger keyboard layout problem, The life span method -- a new variant of local search, A tabu search algorithm for the multi-trip vehicle routing and scheduling problem, Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process, A fast tabu search algorithm for the permutation flow-shop problem, An efficient tabu search procedure for the \(p\)-median problem, The combinatorics of timetabling, Planning models for freight transportation, What is my objective function?, A tabu search Hooke and Jeeves algorithm for unconstrained optimization, Driving tabu search with case-based reasoning, Fuzzy sets and operations research: Perspectives, A two-machine permutation flow shop scheduling problem with buffers, A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem, Simultaneously scheduling multiple turns for steel color-coating production, A variable selection method based on Tabu search for logistic regression models, Heuristics for container loading of furniture, Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem, Optimal attack strategy of complex networks based on tabu search, Tabu search enhances network robustness under targeted attacks, A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion, A neuro-tabu search heuristic for the flow shop scheduling problem, A new hybrid heuristic approach for solving large traveling salesman problem, A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs, Bayesian community detection, Cost optimization of a repairable M/G/1 queue with a randomized policy and single vacation, Lot sizing in capacitated production planning and control systems, Solving transportation problems with nonlinear side constraints with tabu search, Improving the performance of enumerative search methods. I: Exploiting structure and intelligence, Polynomially solvable cases for the maximum stable set problem, Detecting robust cliques in graphs subject to uncertain edge failures, Study of a controllable queueing system with unreliable heterogeneous servers, The capacitated vehicle routing problem with evidential demands, A quality and distance guided hybrid algorithm for the vertex separator problem, A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem, An efficient implementation of a static move descriptor-based local search heuristic, Balancing stochastic parallel assembly lines, Soft computing hybrids for FOREX rate prediction: a comprehensive review, Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches, Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue, Local search with memory: Benchmarking RTS, A local search approach for two-dimensional irregular cutting, Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements, Scatter search and star-paths: Beyond the genetic metaphor, Solving the damper placement problem via local search heuristics, Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling, Heuristic solution approaches to operational forest planning problems, Multiobjective simulation-based optimization based on artificial immune systems for a distribution center, A multiple pheromone table based ant colony optimization for clustering, An efficient algorithm for unconstrained optimization, Common due-date determination and sequencing using tabu search, The simulated trading heuristic for solving vehicle routing problems, Deadline scheduling of multiprocessor tasks, Improving local search heuristics for some scheduling problems. I, An improved tabu search approach for solving the job shop scheduling problem with tooling constraints, HORES: A timetabling system for Spanish secondary schools, Solving the resource constrained project scheduling problem with optimization subroutine library, Simulated annealing metaheuristics for the vehicle routing problem with time windows, Dynamic tabu search strategies for the traveling purchaser problem, Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements, Boosting quantum annealer performance via sample persistence, Designing humanitarian supply chains by incorporating actual post-disaster decisions, Energy efficient scheduling of open-pit coal mine trucks, A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem, A two-agent single-machine scheduling problem with late work criteria, An efficient particle swarm optimizer with application to man-day project scheduling problems, A hybrid simulated annealing/linear programming approach for the cover printing problem, A study on the enhanced best performance algorithm for the just-in-time scheduling problem, A location-inventory-routing problem in forward and reverse logistics network design, Optimization of competitive facility location for chain stores, An efficient local search for the feedback vertex set problem, A direct search algorithm for global optimization, A comparison of algorithms for finding an efficient theme park tour, A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems, Bacterial foraging-tabu search metaheuristics for identification of nonlinear friction model, LTL logistics networks with differentiated services, Improving convergence of evolutionary multi-objective optimization with local search: a concurrent-hybrid algorithm, Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction, Rounding-based heuristics for nonconvex MINLPS, A TABU search heuristic for the team orienteering problem, Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models, Robust metaheuristic algorithm for redundancy optimization in large-scale complex systems, A cooperative parallel meta-heuristic for the vehicle routing problem with time windows, Maximum satisfiability: how good are tabu search and plateau moves in the worst-case?, A tabu search algorithm for the routing and capacity assignment problem in computer networks, Applying tabu search to backup path planning for multicast networks, Vehicle routing and appointment scheduling with team assignment for home services, Genetic algorithm to the machine repair problem with two removable servers operating under the triadic \((0, {Q}, {N}, {M})\) policy, Research on medicine distribution route optimization for community health service institutions, Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles, Greedy randomized adaptive search procedures, Insertion techniques for the heuristic solution of the job shop problem, On a 2-dimensional equipartition problem, Job shop scheduling with beam search, A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs, Probabilistic local search algorithms for concave cost transportation network problems, Deterministic job-shop scheduling: Past, present and future, Guided local search and its application to the traveling salesman problem, Solving the medium newspaper production/distribution problem, Constraint ordinal optimization, Local search algorithms for the \(k\)-cardinality tree problem., Heuristics for permutation flow shop scheduling with batch setup times, A hybrid tabu-ascent algorithm for the linear bilevel programming problem, Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties, Optimization of pitch sequencing for pneumatic tire by tabu search method, A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan, A tabu search heuristic procedure for the fixed charge transportation problem, Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation, A hybrid heuristic for the uncapacitated hub location problem, Separating capacity constraints in the CVRP using tabu search, A tabu search algorithm for the bipartite drawing problem, Proposals for chunking and tabu search, A tabu search approach to the constraint satisfaction problem as a general problem solver, Solving zero-one mixed integer programming problems using tabu search, An efficient tabu search approach for the 0-1 multidimensional knapsack problem, Global optimization approaches to an aircraft routing problem, The permutation flow shop with buffers: A tabu search approach, Tabu search heuristics for the vehicle routing problem with time windows., Modeling reverse logistic tasks within closed-loop supply chains: an example from the automotive industry, A graph coloring approach to the deployment scheduling and unit assignment problem, Solving a bi-objective mixed-model assembly-line sequencing using metaheuristic algorithms considering ergonomic factors, customer behavior, and periodic maintenance, New simple and efficient heuristics for the uncapacitated single allocation hub location problem, Applying simulated annealing using different methods for the neighborhood search in forest planning problems, Frequency optimization in public transportation systems: formulation and metaheuristic approach, Circular coloring of graphs via linear programming and tabu search, Multi-start iterated tabu search for the minimum weight vertex cover problem, Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem, Solving the maximum vertex weight clique problem via binary quadratic programming, The multiple vehicle pickup and delivery problem with LIFO constraints, Practical solutions for a dock assignment problem with trailer transportation, Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2), Pro-active real-time routing in applications with multiple request patterns, Eidetic wolf search algorithm with a global memory structure, Generalized Ramsey numbers through adiabatic quantum optimization, A memetic algorithm for the travelling salesperson problem with hotel selection, A tabu method for a two-agent single-machine scheduling with deterioration jobs, Effect of solution representations on tabu search in scheduling applications, Probabilistic GRASP-tabu search algorithms for the UBQP problem, Genetic tabu search for the fuzzy flexible job shop problem, The production routing problem: a review of formulations and solution algorithms, Scatter search with path relinking for the job shop with time lags and setup times, Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling, On double cycling for container port productivity improvement, Variable neighborhood search for location routing, Vehicle routing problem with stochastic travel times including soft time windows and service costs, A nonmonotone GRASP, A new heuristic algorithm for the circular packing problem with equilibrium constraints, Modeling staff scheduling problems. A tutorial, Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems, A random sampling approach to worst-case design of structures, A model and two heuristic approaches for a forage Harvester planning problem: a case study, A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem, A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective, Continuous optimization via simulation using golden region search, A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization, The linehaul-feeder vehicle routing problem with virtual depots and time windows, Multipath adaptive tabu search for a vehicle control problem, Hopf bifurcation analysis in a tabu learning neuron model with two delays, A branch-and-bound algorithm for the single-row equidistant facility layout problem, Global optimality conditions and optimization methods for quadratic assignment problems, The minimum spanning tree problem with conflict constraints and its variations, Constructing \(E(s^2)\)-optimal and minimax-optimal \(k\)-circulant supersaturated designs via multi-objective tabu search, Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness, A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem, Similarities between meta-heuristics algorithms and the science of life, An implementation of the iterated tabu search algorithm for the quadratic assignment problem, Local search with edge weighting and configuration checking heuristics for minimum vertex cover, A hybrid ACO-GRASP algorithm for clustering analysis, A filter-and-fan approach to the 2D HP model of the protein folding problem, Adaptive conformational sampling based on replicas, Hybrid algorithms for hardware/software partitioning and scheduling on reconfigurable devices, Vehicle routing with compartments: applications, modelling and heuristics, Local search heuristics for the probabilistic dial-a-ride problem, A testing based extraction algorithm for identifying significant communities in networks, Essential particle swarm optimization queen with tabu search for MKP resolution, Local search for Boolean satisfiability with configuration checking and subscore, Using local similarity measures to efficiently address approximate graph matching, Optimal topological design for distributed estimation over sensor networks, A single-machine scheduling with a truncated linear deterioration and ready times, GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem, A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs, Comparative analysis of three metaheuristics for short-term open pit block sequencing, Comparison of the performance of modern heuristics for combinatorial optimization on real data, On the heuristic solution of the permutation flow shop problem by path algorithms, Hub location-allocation in intermodal logistic networks, Local search for the undirected capacitated arc routing problem with profits, Consistent neighborhood search for combinatorial optimization, Parallel preconditioned WENO scheme for three-dimensional flow simulation of NREL phase VI rotor, Economic application in a finite capacity multi-channel queue with second optional channel, Project scheduling heuristics-based standard PSO for task-resource assignment in heterogeneous grid, Pseudo-Boolean optimization, Adaptive memory programming: local search parallel algorithms for phylogenetic tree construc\-tion, Global optimizations and tabu search based on memory, Variable neighborhood search for the maximum clique, Evolutionary computation approaches to the curriculum sequencing problem, A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions, Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search, Reactive scheduling in the multi-mode RCPSP, A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem, Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem, Hybrid evolutionary fuzzy learning scheme in the applications of traveling salesman problems, Comparative analysis of the machine repair problem with imperfect coverage and service pressure condition, Global versus local search: the impact of population sizes on evolutionary algorithm performance, A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem, SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications, Using a vision cognitive algorithm to schedule virtual machines, TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph, An efficient memetic algorithm for the graph partitioning problem, Efficiently solving the traveling thief problem using hill climbing and simulated annealing, New heuristic approaches for maximum balanced biclique problem, Tabu search for large scale timetabling problems, A convoy scheduling problem, Optimisation of gravity-fed water distribution network design: a critical review, Metaheuristic applications on discrete facility location problems: a survey, The multidimensional 0-1 knapsack problem -- bounds and computational aspects, Metaheuristics in combinatorial optimization, Scheduling flow shops using differential evolution algorithm, A two-stage urban bus stop location model, Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times, An optimization algorithm for a capacitated vehicle routing problem with time windows, Benchmarks for basic scheduling problems, Heuristic methods for minimum-cost pipeline network design -- a node valency transfer metaheuristic, Multi-way graph partition by stochastic probe, A hybrid ant colony algorithm for the winner determination problem, A dynamic clustering based differential evolution algorithm for global optimization, Problems of discrete optimization: challenges and main approaches to solve them, Remarks on the application of genetic algorithm and tabu search method to nonlinear spanning tree problems, A new algorithm for removing node overlapping in graph visualization, Three new stochastic local search metaheuristics for the Annual Crop Planning problem based on a new Irrigation Scheme, Cyclic flow-shop scheduling with no-wait constraints and missing operations, TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem, Adaptive memory programming for constrained global optimization, Iterated tabu search for the maximum diversity problem, A theoretical minimal solution for heuristics: the case of the spatial harvest timber problem, A very fast TS/SA algorithm for the job shop scheduling problem, Local search-based hybrid algorithms for finding Golomb rulers, An effective hybrid algorithm for the problem of packing circles into a larger containing circle, Parallel machine selection and job scheduling to minimize machine cost and job tardiness, Some local search algorithms for no-wait flow-shop problem with makespan criterion, Solving the hub location problem with modular link capacities, Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop, Algorithm selection for the team orienteering problem, Assembly line balancing problems with multi-manned stations: a new mathematical formulation and Gantt based heuristic method, A tabu search algorithm for frequency assignment, Metaheuristics: A bibliography, Designing and reporting on computational experiments with heuristic methods, Parallel local search, On minimum congestion routing in rearrangeable multihop lightwave networks, Parallel tabu search message-passing synchronous strategies for task scheduling under precendence constraints, A new two-error-correcting binary code of length 16, An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem, Mid-term and short-term planning support for home health care services, Bayesian variable selection in generalized linear models using a combination of stochastic optimization methods, Design of intermodal logistics networks with hub delays, Tabu search for the BWC problem, A branch-and-bound algorithm for the minimum cut linear arrangement problem, Learning variable neighborhood search for a scheduling problem with time windows and rejections, An opposition-based memetic algorithm for the maximum quasi-clique problem, A cutoff time strategy based on the coupon collector's problem, Grouping products for the optimization of production processes: a case in the steel manufacturing industry, Quasi-cyclic codes over \(\mathbb F_{13}\) and enumeration of defining polynomials, Tabu search algorithm based PID controller tuning for desired system specifications, Multiple \(k\)-opt evaluation multiple \(k\)-opt moves with GPU high performance local search to large-scale traveling salesman problems, Efficient multi-objective tabu search for emergency equipment maintenance scheduling in disaster rescue, Design of PI controller for voltage controller of four-phase interleaved boost converter using particle swarm optimization, Adaptive feasible and infeasible tabu search for weighted vertex coloring, Towards faster local search for minimum weight vertex cover on massive graphs, Recent nature-inspired algorithms for medical image segmentation based on Tsallis statistics, Solving the quadratic assignment problem, Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\), Best second order bounds for two-terminal network reliability with dependent edge failures, A tabu search method guided by shifting bottleneck for the job shop scheduling problem, Possibilistic linear programming: A brief review of fuzzy mathematical programming and a comparison with stochastic programming in portfolio selection problem, Solving the feedback vertex set problem on undirected graphs, Effective neighbourhood functions for the flexible job shop problem, Tabu search tutorial. A graph drawing application, Comments on: ``Tabu search tutorial. A graph drawing application, RAMP algorithms for the capacitated facility location problem, A dual RAMP algorithm for single source capacitated facility location problems, Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem, A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays, Skill-based framework for optimal software project selection and resource allocation, Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques, Multiperiod multi traveling salesmen problem considering time window constraints with an application to a real world case, Theoretical insights into the augmented-neural-network approach for combinatorial optimization, Multistart search for the cyclic cutwidth minimization problem, Adaptive large neighborhood search for solving the circle bin packing problem, \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees, Tree optimization based heuristics and metaheuristics in network construction problems, A robust location-arc routing problem under uncertainty: mathematical model with lower and upper bounds, Tabu search for the time-dependent vehicle routing problem with time windows on a road network, Routing automated lane-guided transport vehicles in a warehouse handling returns, Improving connectivity of compromised digital networks via algebraic connectivity maximisation, An efficient local search framework for the minimum weighted vertex cover problem, A robust optimization approach for humanitarian needs assessment planning under travel time uncertainty, A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows, A low complexity reactive tabu search based constellation constraints in signal detection, Alternative-fuel station network design under impact of station failures, Fair task allocation problem, A cellular automata ant memory model of foraging in a swarm of robots, Single-machine scheduling with learning effect and resource-dependent processing times in the serial-batching production, SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem, Optimized operating rules for short-term hydropower planning in a stochastic environment, A tabu search algorithm for the construction of \(\chi^2(D)\)-optimal mixed-level \(k\)-circulant supersaturated designs, Trees social relations optimization algorithm: a new swarm-based metaheuristic technique to solve continuous and discrete optimization problems, A parallel archimedes optimization algorithm based on Taguchi method for application in the control of variable pitch wind turbine, The design of early-stage plant breeding trials using genetic relatedness, Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem, The method of deformed stars as a population algorithm for global optimization, Hybrid algorithms for placement of virtual machines across geo-separated data centers, Tabu search for min-max edge crossing in graphs, Improving a firefly meta-heuristic for multilevel image segmentation using Tsallis entropy, A set covering approach for multi-depot train driver scheduling, Bayesian \(A\)-optimal two-phase designs with a single blocking factor in each phase, Quantum annealing learning search for solving QUBO problems, On the design of field experiments with correlated treatment effects, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages, Solving the Hub location problem in telecommunication network design: A local search approach, Three tabu search methods for the MI-FAP applied to 802.11 networks, SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration, Minimum Risk Estimation of Scalar Means under Convex Combination of Loss Functions, Dynamic programming applied to rough sets attribute reduction, Comparison of Tabu/2-opt heuristic and optimal tree search method for assignment problems, Three new stochastic local search algorithms for continuous optimization problems, Tabu search algorithm for flexible flow path design of unidirectional automated-guided vehicle systems, A novel metaheuristic optimizer inspired by behavior of jellyfish in ocean, A systematic study on meta-heuristic approaches for solving the graph coloring problem, Multi-objective temporal bin packing problem: an application in cloud computing, A metaheuristic based on tabu search for solving a technician routing and scheduling problem, A tabu-search-based algorithm for continuous multiminima problems, A modified genetic algorithm with fuzzy roulette wheel selection for job-shop scheduling problems, Integrated real-time control of mixed-model assembly lines and their part feeding processes, Large-scale periodic scheduling in time-sensitive networks, The stochastic test collection problem: models, exact and heuristic solution approaches, A fully explicit and unconditionally energy-stable scheme for Peng-Robinson VT flash calculation based on dynamic modeling, APPLICATION OF ANT COLONY OPTIMIZATION TO CREDIT RISK ASSESSMENT, ADCLUS and INDCLUS: analysis, experimentation, and meta-heuristic algorithm extensions, Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem, Convergence of taboo search in continuous global optimization, A reactive self-tuning scheme for multilevel graph partitioning, A novel cultural algorithm for real-parameter optimization, Feature Selection for Heterogeneous Ensembles of Nearest-neighbour Classifiers Using Hybrid Tabu Search, Hidden Markov Models Training Using Population-based Metaheuristics, Vehicle routing with dynamic travel times: a queueing approach, A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem, The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows, RAMP for the capacitated minimum spanning tree problem, A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times, IHAOAVOA: an improved hybrid aquila optimizer and African vultures optimization algorithm for global optimization problems, Discrete bandwidth allocation considering fairness and transmission load in multicast networks, Intelligent water drops algorithm, A tabu search algorithm for the cell formation problem with part machine sequencing, Multiobjective blockmodeling for social network analysis, Optimal unit commitment decision with risk assessment using tabu search, Symbiotic Evolution to Avoid Linkage Problem, A tabu search approach for proportionate multiprocessor open shop scheduling, Adaptive memory programming for the robust capacitated international sourcing problem, A graph coloring heuristic using partial solutions and a reactive tabu scheme, Obtaining functional form for chaotic time series evolution using genetic algorithm, Artificial life techniques for load balancing in computational grids, A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search, Priority-based assignment and routing of a fleet of unmanned combat aerial vehicles, Lower and upper bounds for a two-level hierarchical location problem in computer networks, Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times, Efficient algorithms for finding critical subgraphs, Solving the multi-objective nurse scheduling problem with a weighted cost function, Metaheuristics approach to the aircrew rostering problem, Genetic and Tabu search algorithms for peptide assembly problem, Optimal buffer allocation in finite closed networks with multiple servers, A bicriteria solid transportation problem with fixed charge under stochastic environment, Applying an Intensification Strategy on Vehicle Routing Problem, A personal perspective on problem solving by general purpose solvers, No-wait job shop scheduling: tabu search and complexity of subproblems, Viral systems: A new bio-inspired optimisation approach, The single vehicle routing problem with deliveries and selective pickups, A tabu search algorithm for structural software testing, Proactive heuristic procedures for robust project scheduling: An experimental analysis, Local search algorithms for political districting, Optimal multiple-objective resource allocation using hybrid particle swarm optimization and adaptive resource bounds technique, A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem, A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem, A survey of local search methods for graph coloring, Solving the uncapacitated facility location problem using tabu search, Ant colony optimization for the nonlinear resource allocation problem, A 3-flip neighborhood local search for the set covering problem, Resource allocation in a mobile telephone network: A constructive repair algorithm, Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List, A combined global and local search method to deal with constrained optimization for continuous tabu search, Comparative analysis between modern heuristics and hybrid algorithms, Constructing nurse schedules at large hospitals, Some simple optimization techniques for self-organized public key management in mobile ad hoc networks, Hopf bifurcation analysis of a tabu learning two-neuron model, Redesign of production flow lines to postpone product differentiation, Optimization of a line-cutting procedure for ship hull construction by an effective tabu search, Hybrid metaheuristics for the vehicle routing problem with stochastic demands, An integrated approach for modeling and solving the scheduling problem of container handling systems, New lower bounds for 28 classical Ramsey numbers, A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning, ON AN APPROXIMATE OPTIMALITY CRITERION FOR THE DESIGN OF FIELD EXPERIMENTS UNDER SPATIAL DEPENDENCE, Theoretical and computational advances for network diversion, Pharmacy duty scheduling problem, Design and resonant frequency calculation of rectangular microstrip antennas, A Hybrid Metaheuristic Based on Variable Neighborhood Search and Tabu Search for the Web Service Selection Problem, Variable Neighborhood Search and Tabu Search for the Web Service Selection Problem, FINDING THE BEST DESIGN WITHIN LIMITED TIME: A COMPARATIVE CASE STUDY ON METHODS FOR OPTIMIZATION IN STRUCTURAL ACOUSTICS, A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties, Path relinking and GRG for artificial neural networks, A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows, Tabu search directed by direct search methods for nonlinear global optimization, Multi-objective tabu search using a multinomial probability mass function, An empirical study of learning speed in back-propagation networks, MOAQ and ant-Q algorithm for multiple objective optimization problems, Ant colony optimization theory: a survey, An Exact Algorithm for Blockmodeling of Two-Mode Network Data, Towards a theory of practice in metaheuristics design: A machine learning perspective, Memory and Learning in Metaheuristics, Decision Incorporation in Meta-heuristics to Cope with Decision Scheduling Problems, Evolutionary Algorithms for Aerofoil Design, Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem, Recent advances in dynamic facility layout research, An improved tabu search algorithm for the petrol-station replenishment problem with adjustable demands, Tabu Search metaheuristic for designing digital filters, Multi-hour design of survivable classical IP networks, Unnamed Item, The electrical distribution network planning problem, A new metaheuristic optimization method: the algorithm of the innovative gunner (AIG), Tabu Search for Vehicle Routing Problems (VRPs), Ant colony based hybrid optimization for data clustering, A tabu search heuristic for scheduling the production processes at an oil refinery, Constructing cyclic PBIBD(2)s through an optimization approach: Thirty‐two new cyclic designs, Unforeseen Consequences of “Tabu” Choices—A Retrospective, Special forces algorithm: a novel meta-heuristic method for global optimization, A real-world mine excavators timetabling methodology in open-pit mining, Design of agricultural field experiments accounting for both complex blocking structures and network effects, A novel multi-level image segmentation algorithm via random opposition learning-based Aquila optimizer, A mathematical formulation and an <scp>LP‐based</scp> neighborhood search matheuristic solution method for the integrated train blocking and shipment path problem, A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem, Stochastic local search and parameters recommendation: a case study on flowshop problems, Two heuristics for the label printing problem, Optimization via rejection-free partial neighbor search, A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands, MLQCC: an improved local search algorithm for the set k‐covering problem, Research trends in combinatorial optimization, Effects of update frequencies in a dynamic capacitated arc routing problem, How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring, Metaheuristics: A Canadian Perspective, A multi-objective linear programming model for scheduling part families and designing a group layout in cellular manufacturing systems, Approximation schemes for covering and packing problems in image processing and VLSI, A new taxonomy of global optimization algorithms, A new modified bat algorithm for global optimization, A simulated annealing approach to the cyclic staff-scheduling problem, Optimization of truss topology using tabu search, A New Approximative Algorithm for the Expansion Problem of 3G Networks, A parallel adaptive memory algorithm for the capacitated modular hub location problem, Tabu search exploiting local optimality in binary optimization, A tabu search with geometry‐based sparsification methods for angular traveling salesman problems, Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem, Unnamed Item, A New Composite Algorithm for Clustering Problems, The Vehicle Routing Problem with Release and Due Dates, Local Search Algorithms for the Maximal Planar Layout Problem, Heuristics from Nature for Hard Combinatorial Optimization Problems, Accelerating benders decomposition with heuristicmaster problem solutions, Inventory control of raw materials under stochastic and seasonal lead times, Estimation for the Multiple Regression Setup Using Balanced Loss Function, METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM, APPLYING METAHEURISTICS TO FEEDER BUS NETWORK DESIGN PROBLEM, Optimizing the system of virtual paths by tabu search., Constructing difference families through an optimization approach: Six new BIBDs, Tabu search-based heuristics for cellular manufacturing systems in the presence of alternative process plans, A common Tabu search algorithm for the global optimization of engineering problems, Local optimality subsets and global optimization: A prospective approach, Optimization of cube-per-order index warehouse layouts with zoning constraints, Variable neighborhood search: Principles and applications, A tabu search heuristic for the generalized assignment problem, Multiple machine JIT scheduling: a tabu search approach, Convexity and global optimization: A theoretical link, Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study, Layout optimization considering production uncertainty and routing flexibility, Heuristic solution approaches for the cumulative capacitated vehicle routing problem, A review of planning and scheduling systems and methods for integrated steel production, A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints, Tabu search for a class of single-machine scheduling problems, Scheduling projects with labor constraints, A genetic algorithm methodology for complex scheduling problems, Determining newspaper marketing zones using contiguous clustering, New coverings oft-sets with (t + 1)-sets, Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs, Adaptive memory programming: a unified view of metaheuristics, Defining tabu list size and aspiration criterion within tabu search methods, Local search heuristics for two-stage flow shop problems with secondary criterion, Developing exact and Tabu search algorithms for simultaneously determining AGV loop and P/D stations in single loop systems, A local genetic approach to multi-objective, facility layout problems with fixed aisles, Solving thep-Center problem with Tabu Search and Variable Neighborhood Search, Least-commitment graph matching with genetic algorithms, A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion, D-optimal designs for sensor and actuator locations, Feature selection using tabu search method, Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs, Resource allocation algorithm for light communication grid-based workflows within an SLA context, Parallel Global Optimization in Multidimensional Scaling, Implementation and Comparison of Three Neural Network Learning Algorithms, Similarities between meta-heuristics algorithms and the science of life, A tabu search heuristic for the Steiner Tree Problem, An Interactive Fuzzy Satisficing Method for Random Fuzzy Multiobjective Integer Programming Problems through Probability Maximization with Possibility, HOPF BIFURCATION AND CHAOS IN TABU LEARNING NEURON MODELS, An integer linear programming model and a modified branch and bound algorithm for the project material requirements planning problem, An adaptive species conservation genetic algorithm for multimodal optimization, An tentative taboo search algorithm for job shop scheduling, A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location, Toward unification of exact and heuristic optimization methods, Technical note: Tabu search heuristic for a loading problem in flexible manufacturing systems, Process plan selection based on product mix and production volume, A THREE-LEVEL PARALLELISATION SCHEME AND APPLICATION TO THE NELDER-MEAD ALGORITHM, Adaptive Tunning of All Parameters in a Multi-Swarm Particle Swarm Optimization Algorithm: An Application to the Probabilistic Traveling Salesman Problem
