scientific article; zbMATH DE number 1062113

Publication date: 17 September 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

simulated annealing genetic algorithms parallel computing tabu search heuristic

Integer programming (90C10) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Parallel numerical computation (65Y05)

Related Items

Hybrid evolutionary search for the minimum sum coloring problem of graphs, Heuristic search to the capacitated clustering problem, Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables, Cost optimization of a repairable M/G/1 queue with a randomized policy and single vacation, Heuristics for the constrained incremental graph drawing problem, The Weber obnoxious facility location model: a big arc small arc approach, The Boolean quadratic programming problem with generalized upper bound constraints, An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes, An iterated ``hyperplane exploration approach for the quadratic knapsack problem, GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem, Combining VNS with genetic algorithm to solve the one-to-one routing issue in road networks, Variable neighborhood search strategies for the order batching problem, Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign, A population-based algorithm for solving linear assignment problems with two objectives, An iterated tabu search for the multi-compartment vehicle routing problem, Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties, Clustered maximum weight clique problem: algorithms and empirical analysis, Frequency-driven tabu search for the maximum \(s\)-plex problem, Heuristics for the capacitated modular hub location problem, Optimisation of transportation service network using \(\kappa\)-node large neighbourhood search, Tabu search for the dynamic bipartite drawing problem, Relaxation heuristics for the set multicover problem with generalized upper bound constraints, Design of sensor networks for chemical plants based on meta-heuristics, A multiperiod vehicle lease planning for urban freight consolidation network, New relationships for multi-neighborhood search for the minimum linear arrangement problem, Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times, Variable neighborhood scatter search for the incremental graph drawing problem, Kernel technology to solve discrete optimization problems, Integrated inventory routing problem with quality time windows and loading cost for deteriorating items under discrete time, Advancing Shannon entropy for measuring diversity in systems, Minimizing the maximal ergonomic burden in intra-hospital patient transportation, A GRASP algorithm for solving large-scale single row facility layout problems, Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times, Effective metaheuristic algorithms for the minimum differential dispersion problem, Scheduling in-house transport vehicles to feed parts to automotive assembly lines, A model enhancement approach for optimizing the integrated shift scheduling and vehicle routing problem in waste collection, The job shop scheduling problem with convex costs, Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem, Scatter search for the cutwidth minimization problem, Multi-neighborhood tabu search for the maximum weight clique problem, An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem, Managing the tabu list length using a fuzzy inference system: an application to examination timetabling, An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines, A niche hybrid genetic algorithm for global optimization of continuous multimodal functions, New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem, Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling, A tabu search algorithm for parallel machine total tardiness problem, Capacity expansion of fiber optic networks with WDM systems: problem formulation and comparative analysis, Solving the theater distribution vehicle routing and scheduling problem using group theoretic tabu search, Solving the aerial fleet refueling problem using group theoretic tabu search, Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models, Solving the vehicle routing problem with adaptive memory programming methodology, Robust metaheuristic algorithm for redundancy optimization in large-scale complex systems, Hybrid heuristics for examination timetabling problem, A cooperative parallel meta-heuristic for the vehicle routing problem with time windows, A tabu search algorithm for the routing and capacity assignment problem in computer networks, Exact and hybrid methods for the multiperiod field service routing problem, Genetic algorithm to the machine repair problem with two removable servers operating under the triadic \((0, {Q}, {N}, {M})\) policy, A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem, Clustering model and algorithm for production inventory and distribution problem, Local search methods for the solution of implicit inverse problems, EPCOT: An efficient procedure for coloring optimally with Tabu Search, Parameter estimation in stochastic scenario generation systems, Deterministic job-shop scheduling: Past, present and future, Heuristics and meta-heuristics for 2-layer straight line crossing minimization, A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem., Service network design in freight transportation, Heuristics for cardinality constrained portfolio optimization, A heuristic to minimax absolute regret for linear programs with interval objective function coefficients, An improved algorithm for the packing of unequal circles within a larger containing circle, Two-dimensional packing problems: a survey, Diversification strategies in local search for a nonbifurcated network loading problem, Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties, The transportation problem with exclusionary side constraints and two branch-and-bound algorithms, Linearity in the traveling salesman problem, Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints, Minimizing weighted tardiness of jobs with stochastic interruptions in parallel machines, Digital data networks design using genetic algorithms, Recent developments and trends in global optimization, Evolution and state-of-the-art in integer programming, Combinatorial optimization: current successes and directions for the future, Clustering categorical data sets using tabu search techniques, Real-time multiserver and multichannel systems with shortage of maintenance crews., Design and implementation of a course scheduling system using Tabu Search, Optimal reference subset selection for nearest neighbor classification by tabu search, Tabu search and finite convergence, Perturbation heuristics for the pickup and delivery traveling salesman problem, Heuristic solutions to multi-depot location-routing problems, Real-time system with homogeneous servers and nonidentical channels in steady-state, A note on global optimization in adaptive control, econometrics and macroeconomics., Probabilistic satisfiability with imprecise probabilities, Determining buffer location and size in production lines using tabu search, Search strategies for the feeder bus network design problem, 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, Solution of large weighted equicut problems, A tabu search algorithm for the bipartite drawing problem, Global optimization for artificial neural networks: A tabu search application, Solving zero-one mixed integer programming problems using tabu search, An efficient tabu search approach for the 0-1 multidimensional knapsack problem, A flow-based tabu search algorithm for the RCPSP with transfer times, A review of hyper-heuristics for educational timetabling, Unified encoding for hyper-heuristics with application to bioinformatics, A three-phased local search approach for the clique partitioning problem, Solving the maximum vertex weight clique problem via binary quadratic programming, The evaluation of pedestrians' behavior using \(M/G/C/C\) analytical, weighted distance and real distance simulation models, The bipartite quadratic assignment problem and extensions, A hybrid metaheuristic approach for the capacitated arc routing problem, Local search heuristics for sectoring routing in a household waste collection context, A hybrid evolutionary algorithm to solve the job shop scheduling problem, Revising history for cost-informed process improvement, Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms, A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots, Two approaches for solving the buffer allocation problem in unreliable production lines, A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems, GRASP and path relinking for the equitable dispersion problem, Probabilistic GRASP-tabu search algorithms for the UBQP problem, A GRASP metaheuristic for microarray data analysis, A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem, Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services, A memetic algorithm for the minimum sum coloring problem, Stochastic resource allocation using a predictor-based heuristic for optimization via simulation, Two metaheuristic approaches for solving multidimensional two-way number partitioning problem, Tabu search algorithm for DNA sequencing by hybridization with multiplicity information available, A tabu search algorithm for application placement in computer clustering, Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem, Simulation-based optimization for housekeeping in a container transshipment terminal, Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem, Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics, A two level metaheuristic for the operating room scheduling and assignment problem, Optimal shift partitioning of pharmacies, A branch-and-price approach for a multi-period vehicle routing problem, Tabu search for the cyclic bandwidth problem, A biased random-key genetic algorithm for the capacitated minimum spanning tree problem, Emergency facility location under random network damage: insights from the Istanbul case, Branch and bound for the cutwidth minimization problem, Memetic search for the max-bisection problem, Breakout local search for maximum clique problems, Solution method for the location planning problem of logistics park with variable capacity, A new heuristic for solving the \(p\)-median problem in the plane, Multi-directional local search, Algorithmic aspects for multiple-choice hardware/software partitioning, A nonmonotone GRASP, A leader-follower model for discrete competitive facility location, A parallel tabu search for solving the primal buffer allocation problem in serial production systems, Multi-neighborhood local search optimization for machine reassignment problem, A tabu search based memetic algorithm for the Max-Mean dispersion problem, Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling, The dynamic vehicle allocation problem with application in trucking companies in Brazil, An adaptive multistart tabu search approach to solve the maximum clique problem, A hyper-heuristic approach to sequencing by hybridization of DNA sequences, Solving the quadratic minimum spanning tree problem, Scheduling satellite launch missions: an MILP approach, Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery, Lower and upper bounds for the bin packing problem with fragile objects, Genetic tabu search for robust fixed channel assignment under dynamic traffic data, The linehaul-feeder vehicle routing problem with virtual depots and time windows, Multipath adaptive tabu search for a vehicle control problem, Revised GRASP with path-relinking for the linear ordering problem, A tabu search algorithm for the covering design problem, A general approach for optimizing regular criteria in the job-shop scheduling problem, A discrete model for optimal operation of fossil-fuel generators of electricity, Heuristics for a project management problem with incompatibility and assignment costs, A benchmark library and a comparison of heuristic methods for the linear ordering problem, Using Markov chains to analyze the effectiveness of local search algorithms, Static resource allocation for heterogeneous computing environments with tasks having dependencies, priorities, deadlines, and multiple versions, The freight allocation problem with lane cost balancing constraint, Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW, Product line pricing for services with capacity constraints and dynamic substitution, Fast metaheuristics for the discrete \((r|p)\)-centroid problem, Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information, Timetable construction: the algorithms and complexity perspective, The maximin gradual cover location problem, A randomized granular tabu search heuristic for the split delivery vehicle routing problem, A column generation approach for multicast routing and wavelength assignment with delay constraints in heterogeneous WDM networks, OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises, A survey on optimization metaheuristics, A discrete gravitational search algorithm for solving combinatorial optimization problems, Genetic algorithm and tabu search algorithm for solving the static manycast RWA problem in optical networks, Heuristic solution approaches for the maximum minsum dispersion problem, A multiple search operator heuristic for the max-k-cut problem, A mathematical model and a metaheuristic approach for a memory allocation problem, Scatter search for the bandpass problem, Local search for the undirected capacitated arc routing problem with profits, Adaptive memory in multistart heuristics for multicommodity network design, Economic application in a finite capacity multi-channel queue with second optional channel, Simulation and optimization of sludge hygienization research irradiator, Tabu search -- uncharted domains, Adaptive memory programming for matrix bandwidth minimization, Tabu search approaches for solving the two-group classification problem, Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection, Hybrid scatter tabu search for unconstrained global optimization, Improved convergent heuristics for the 0-1 multidimensional knapsack problem, The case for strategic oscillation, A special combinatorial problem: pitch arrangement for pneumatic tires, Using local search to speed up filtering algorithms for some NP-hard constraints, A framework for analyzing sub-optimal performance of local search algorithms, A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times, Tabu search, Integrated distribution and loading planning via a compact metaheuristic algorithm, Routing and wavelength assignment by partition colouring, ARMS: an automated resource management system for British telecommunications plc, Constraint-based learning for non-parametric continuous Bayesian networks, The linear ordering problem with clusters: a new partial ranking, A tabu search heuristic for the quay crane scheduling problem, A heuristic method for the vehicle routing problem with mixed deliveries and pickups, Graph colouring approaches for a satellite range scheduling problem, On-line decision support for take-off runway scheduling with uncertain taxi times at London heathrow airport, A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine, A comparison of five heuristics for the multiple depot vehicle scheduling problem, New neighborhood structures for the double traveling salesman problem with multiple stacks, Computing the metric dimension of graphs by genetic algorithms, A tabu search algorithm for the single machine total weighted tardiness problem, An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems, An evolution-based tabu search approach to codebook design, Developing effective meta-heuristics for a probabilistic location model via experimental design, Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia, Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, Tabu search and GRASP for the maximum diversity problem, Improved formulation, branch-and-cut and tabu search heuristic for single loop material flow system design, Optimizing base station location and configuration in UMTS networks, Solving a concrete sleepers production scheduling by genetic algorithms, A tabu search approach for solving a difficult forest harvesting machine location problem, A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector, The \(p\)-median problem: a survey of metaheuristic approaches, The gravity \(p\)-median model, A genetic algorithm approach to find the best regression/econometric model among the candidates, The crew timetabling problem: an extension of the crew scheduling problem, Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search, A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding, Reliable overlay multicast trees for private internet broadcasting with multiple sessions, A scatter search-based heuristic to locate capacitated transshipment points, A GRASP algorithm to solve the unicost set covering problem, \(K\)-harmonic means data clustering with simulated annealing heuristic, Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem, Diversification-driven tabu search for unconstrained binary quadratic problems, 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, Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach, The gravity multiple server location problem, A hybrid metaheuristic approach to solving the UBQP problem, Tabu search and GRASP for the capacitated clustering problem, Metaheuristic methods based on tabu search for assigning judges to competitions, Evaluation performance of genetic algorithm and tabu search algorithm for solving the MAX-RWA problem in all-optical networks, Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution, A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization, An effective multilevel tabu search approach for balanced graph partitioning, Prioritized interdiction of nuclear smuggling via tabu search, A heuristic method for non-homogeneous redundancy optimization of series-parallel multi-state systems, Composing medical crews with equity and efficiency, On benefits and drawbacks of aging strategies for randomized search heuristics, Exact and heuristic algorithms for the interval data robust assignment problem, Tabu search with path relinking for an integrated production-distribution problem, A GRASP with evolutionary path relinking for the truck and trailer routing problem, An evolutionary approach for the nurse rerostering problem, Hybridizing evolutionary algorithms with variable-depth search to overcome local optima, Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness, A simple and effective algorithm for the MaxMin diversity problem, A filter-and-fan approach to the 2D HP model of the protein folding problem, Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem, Risk approaches for delivering disaster relief supplies, A metamodel-assisted evolutionary algorithm for expensive optimization, Seeking global edges for traveling salesman problem in multi-start search, Mono- and multiobjective formulations for the indoor wireless LAN planning problem, A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries, Efficient batch job scheduling in grids using cellular memetic algorithms, Local search heuristics for the probabilistic dial-a-ride problem, A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations, A multilevel tabu search algorithm for the feature selection problem in biomedical data, Political districting: From classical models to recent approaches, Optimal configuration selection for reconfigurable manufacturing systems, Infeasible/feasible search trajectories and directional rounding in integer programming, Tabu search for attribute reduction in rough set theory, Combining VNS with constraint programming for solving anytime optimization problems, Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles, Continuation methods for approximate large scale object sequencing, Parameter tuning for local-search-based matheuristic methods, Modeling and control of switching max-plus-linear systems with random and deterministic switching, Consistent neighborhood search for combinatorial optimization, A survey of very large-scale neighborhood search techniques, Recent advances on two-dimensional bin packing problems, Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors., Tabu search algorithms for water network optimization, A metaheuristic for stochastic service network design, Solving the musical orchestration problem using multiobjective constrained optimization with a genetic local search approach, A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem, A computational study of parametric tabu search for 0-1 mixed integer programs, The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model, The flexible blocking job shop with transfer and set-up times, Construction and improvement algorithms for dispersion problems, Comparative analysis of the machine repair problem with imperfect coverage and service pressure condition, An efficient heuristic for reliability design optimization problems, SCIP: solving constraint integer programs, A black-box scatter search for optimization problems with integer variables, Integrated production and distribution scheduling with lifespan constraints, Transshipment service through crossdocks with both soft and hard time windows, Problem difficulty for tabu search in job-shop scheduling, Evolutionary approaches to DNA sequencing with errors, An unconstrained quadratic binary programming approach to the vertex coloring problem, Metaheuristics in combinatorial optimization, Simulated annealing and tabu search approaches to unidirectional flowpath design for automated guided vehicle systems, Optimization by ghost image processes in neural networks, Tabu search performance on the symmetric travelling salesman problem, Applying tabu search with influential diversification to multiprocessor scheduling, Genetic algorithms and tabu search: Hybrids for optimization, Graph domination, tabu search and the football pool problem, General purpose heuristics for integer programming. I, New approaches for heuristic search: A bilateral linkage with artificial intelligence, Using tabu search for solving a dynamic multi-terminal truck dispatching problem, Resource-constrained project scheduling: A critical activity reordering heuristic, Neighborhood search heuristics for the uncapacitated facility location problem, Nurse rostering problems -- a bibliographic survey., A tabu search algorithm for self-healing ring network design., Upper and lower bounds for the single source capacitated location problem., Variable neighborhood tabu search and its application to the median cycle problem., Solving the continuous flow-shop scheduling problem by metaheuristics., Local search for shift design., Using tabu search with longer-term memory and relaxation to create examination timetables., GRASP and path relinking for the matrix bandwidth minimization., GRASP for set packing problems., Global optimization and multi knapsack: a percolation algorithm., Locating service facilities whose reliability is distance dependent., 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., D-Ants: Savings Based Ants divide and conquer the vehicle routing problem., A hybrid algorithm for identifying global and local minima when optimizing functions with many minima., The theory of elementary landscapes, A tabu search heuristic for the generalized minimum spanning tree problem, Global optimization using a synchronization of multiple search points autonomously driven by a chaotic dynamic model, Multi-start and path relinking methods to deal with multiobjective Knapsack problems, Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times, An iterated local search algorithm for the vehicle routing problem with convex time penalty functions, Pruned Pareto-optimal sets for the system redundancy allocation problem based on multiple prioritized objectives, Object detection by global contour shape, \(K\)-harmonic means data clustering with tabu-search method, Design of hybrids for the minimum sum-of-squares clustering problem, The traveling salesman problem: An overview of exact and approximate algorithms, Tabu search for covering arrays using permutation vectors, Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation, Variable space search for graph coloring, Tabu search-based metaheuristic algorithm for software system reliability problems, A tabu search approach to an urban transport problem in northern Spain, Applications of optimization heuristics to estimation and modelling problems, Experiments with, and on, algorithms for maximum likelihood clustering, Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times, A mixed integer linear program and tabu search approach for the complementary edge covering problem, Group-scheduling problems in electronics manufacturing, About equivalent interval colorings of weighted graphs, A new neighborhood and tabu search for the blocking job shop, Alternating control tree search for knapsack/covering problems, Human-guided search, A tabu search with an oscillation strategy for the discriminant analysis problem, An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring, Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion, The evolution of cell formation problem methodologies based on recent studies (1997-2008): Review and directions for future research, Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs, Efficient heuristic algorithms for path-based hardware/software partitioning, Industrial aspects and literature survey: fleet composition and routing, A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem, A GIS-based optimization framework for competitive multi-facility location-routing problem, Design of prestressed concrete precast pedestrian bridges by heuristic optimization, A ring-mesh topology design problem for optical transport networks, A route set construction algorithm for the transit network design problem, Analysis of new variable selection methods for discriminant analysis, Lasso solution strategies for the vehicle routing problem with pickups and deliveries, Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem, A novel hybrid differential evolution and particle swarm optimization algorithm for unconstrained optimization, Stochastic vehicle routing, Massively parallel analog tabu search using neural networks applied to simple plant location problems, A survey on metaheuristics for stochastic combinatorial optimization, Global optimization of signomial mixed-integer nonlinear programming problems with free variables, Adaptive granular local search heuristic for a dynamic vehicle routing problem, The single-finger keyboard layout problem, Lower and upper bounds for a capacitated plant location problem with multicommodity flow, A robust and efficient algorithm for planar competitive location problems, Combined location-routing problems -- a neural network approach, Optimal location with equitable loads, The multiple server center location problem, Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems, A tabu search heuristic for the vehicle routing problem with private fleet and common carrier, MILP approach to pattern generation in logical analysis of data, An efficient tabu search procedure for the \(p\)-median problem, A tabu search approach for the minimum sum-of-squares clustering problem, Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems, Cyber swarm algorithms - improving particle swarm optimization using adaptive memory strategies, A hybrid meta-heuristic for global optimisation using low-discrepancy sequences of points, GRASP and path relinking for the max-min diversity problem, A solution method for a car fleet management problem with maintenance constraints, AEGIS---attribute experimentation guiding improvement searches, A cross entropy based algorithm for reliability problems, A tabu search algorithm for scheduling pharmaceutical packaging operations, Solving a comprehensive model for multiobjective project portfolio selection, A search space ``cartography for guiding graph coloring heuristics, Solving a manpower scheduling problem for airline catering using metaheuristics, A hybrid genetic algorithm for the open shop scheduling problem, A variable selection method based on Tabu search for logistic regression models, Heuristic algorithms for the multi-depot ring-star problem, Feasibility pump 2.0, Solving a minimum-power covering problem with overlap constraint for cellular network design, Tabu search for DNA sequencing with false negatives and false positives, Multiobjective GRASP with path relinking, A hybrid variable neighborhood search algorithm for targeted offers in direct marketing, A robust parameter design for multi-response problems, A discrete-time single-server queueing system with ann-policy, an early setup and a generalization of the Bernoulli feedback, Political districting: from classical models to recent approaches, Feature-based tuning of single-stage simulated annealing for examination timetabling, A neighborhood for complex job shop scheduling problems with regular objectives, Asymmetric hidden Markov models, A directional approach to gradual cover, A dial-a-ride problem for client transportation in a health-care organization, Heuristics for urban road network design: lane layout and signal settings, Improvements to MCS algorithm for the maximum clique problem, Bike sharing systems: solving the static rebalancing problem, Employee workload balancing by graph partitioning, Feasibility Pump-like heuristics for mixed integer problems, Multi-coloring and job-scheduling with assignment and incompatibility costs, Strategic oscillation for the quadratic multiple knapsack problem, Explorative anytime local search for distributed constraint optimization, Two phase algorithms for the bi-objective assignment problem, Adaptive memory programming for the robust capacitated international sourcing problem, A multiperiod set covering location model for dynamic redeployment of ambulances, Lot sizing and furnace scheduling in small foundries, A graph coloring heuristic using partial solutions and a reactive tabu scheme, A formal analysis of why heuristic functions work, A combined procedure for discrete simulation-optimization problems based on the simulated annealing framework, CHECKCOL: improved local search for graph coloring, Repairing MIP infeasibility through local branching, A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem, Resolution approach for multi-objective problems with uncertain demands, The development of a multi-objective tabu search algorithm for continuous optimisation problems, Steiner diagrams and \(k\)-star hubs, Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times, Operations research and data mining, Discrete-continuous project scheduling with discounted cash flows - a tabu search approach, The minimum shift design problem, Distributed personnel scheduling -- negotiation among scheduling agents, A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem, A feasibility pump heuristic for general mixed-integer problems, Improving the feasibility pump, AFSCN scheduling: how the problem and solution have evolved, Optimal search strategies using simultaneous generalized hill climbing algorithms, Some assignment problems arising from multiple target tracking, A tabu search scheme for abstract problems, with applications to the computation of fixed points, An experimental analysis of a population based approach for global optimization, The \(p\)-median problem under uncertainty, Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm, Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation, A tabu search algorithm for structural software testing, A tabu search approach for the livestock collection problem, An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops, Algorithms for the \(q\)-model clustering problem with application in switching cabinet manufacturing, Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches, On-line resources allocation for ATM networks with rerouting, Bounds for the single source modular capacitated plant location problem, Sequential search and its application to vehicle-routing problems, Parametric tabu-search for mixed integer programs, Implementing and testing the tabu cycle and conditional probability methods, Adaptive memory search for multidemand multidimensional knapsack problems, A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem, Solving the uncapacitated facility location problem using tabu search, A simple filter-and-fan approach to the facility location problem, Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem, Tabu search algorithm for DNA sequencing by hybridization with isothermic libraries, A metaheuristic to solve a location-routing problem with nonlinear costs, Creating very large scale neighborhoods out of smaller ones by compounding moves, A soft approach for hard continuous optimization, A probabilistic cooperative-competitive hierarchical model for global optimization, A new tabu search algorithm for the vehicle routing problem with backhauls, A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints, Finding a cluster of points and the grey pattern quadratic assignment problem, Airport gate scheduling with time windows, Lower and upper bounds for a two-stage capacitated facility location problem with handling costs, Approximating multivariate Markov chains for bootstrapping through contiguous partitions, Multiple crossdocks with inventory and time windows, An investigation of mating and population maintenance strategies in hybrid genetic heuristics for product line designs, Modelling and heuristics of FMS scheduling with multiple objectives, Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem, State-of-the-art exact and heuristic solution procedures for simple assembly line balancing, Balancing assembly lines with tabu search, Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach, Principles of scatter search, Scatter search in software testing, comparison and collaboration with estimation of distribution algorithms, Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem, Continuous scatter search: an analysis of the integration of some combination methods and improvement strategies, Some aspects of scatter search in the flow-shop problem, A tabu search heuristic for the truck and trailer routing problem, A tabu search algorithm for difference triangle sets and Golomb rulers, Arc routing in a node routing environment, Tabu search directed by direct search methods for nonlinear global optimization, The single-node dynamic service scheduling and dispatching problem, A review of TSP based approaches for flowshop scheduling, Multi-objective tabu search using a multinomial probability mass function, A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems, Comparing metaheuristic algorithms for SONET network design problems, A GRASP and path relinking heuristic for rural road network development, MOAQ and ant-Q algorithm for multiple objective optimization problems, Fast local search algorithms for the handicapped persons transportation problem, COLE: a new heuristic approach for fixed charge problem computational results, Ant colony optimization theory: a survey, The capacitated centred clustering problem, Cutting-plane-based algorithms for two branch vertices related spanning tree problems, Competitive location and pricing on networks with random utilities, An uncertainty management framework for industrial applications, Ambulance location and relocation models., A modified differential evolution based solution technique for economic dispatch problems, On characterization of maximal independent sets via quadratic optimization, ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms, Local search heuristics for the zone planning problem, Omega-CVaR portfolio optimization and its worst case analysis, Adaptive memory search for Boolean optimization problems, A tabu search heuristic for the vehicle routing problem with time windows and split deliveries, Multilayer neural networks: an experimental evaluation of on-line training methods, Comparison of metaheuristic algorithms for examination timetabling problem, Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach, An efficient heuristic for the expansion problem of cellular wireless networks, A neuro-tabu search heuristic for the flow shop scheduling problem, A compact model and tight bounds for a combined location-routing problem, A linear-time algorithm to solve the sports league scheduling problem (prob026 of CSPLib), Remarks on the application of genetic algorithm and tabu search method to nonlinear spanning tree problems, Minimizing earliness and tardiness penalties in a single-machine problem with a common due date, Solving transportation problems with nonlinear side constraints with tabu search, A decomposed metaheuristic approach for a real-world university timetabling problem, A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem, A cooperative parallel tabu search algorithm for the quadratic assignment problem, Variable neighbourhood search for bandwidth reduction, Adaptive tabu search for course timetabling, Adaptive memory programming for constrained global optimization, Hybrid search with neighborhood reduction for the multiple traveling salesman problem, Reinforcement learning based tabu search for the minimum load coloring problem, A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times, Particle swarm optimization and hill climbing for the bandwidth minimization problem, A very fast TS/SA algorithm for the job shop scheduling problem, Supporting offshoring and nearshoring decisions for mass customization manufacturing processes, The minimum weighted covering location problem with distance constraints, Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date, On edge orienting methods for graph coloring, Parallel machine selection and job scheduling to minimize machine cost and job tardiness, Solving two location models with few facilities by using a hybrid heuristic: a real health resources case, Point of presence design in internet protocol networks with performance guarantees, An approach to efficient planning with numerical fluents and multi-criteria plan quality, Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange, Parallel tabu search message-passing synchronous strategies for task scheduling under precendence constraints, General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem, A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem, Tabu search heuristics for the order batching problem in manual order picking systems, Min-energy broadcast in mobile ad hoc networks with restricted motion, Directional approach to gradual cover: a maximin objective, Heuristic optimisation in financial modelling, Tabu search algorithm based PID controller tuning for desired system specifications, Consistency of community detection in networks under degree-corrected stochastic block models, A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem, Adaptive feasible and infeasible tabu search for weighted vertex coloring, ConsNet -- a tabu search approach to the spatially coherent conservation area network design problem, On the classification of NP-complete problems in terms of their correlation coefficient, Managing geological uncertainty in expensive reservoir simulation optimization, A tabu search method guided by shifting bottleneck for the job shop scheduling problem, Optimization methods for the planning of rapid transit systems, Tabu search tutorial. A graph drawing application, Comments on: ``Tabu search tutorial. A graph drawing application, Rejoinder on: ``Tabu search tutorial. A graph drawing application, RAMP algorithms for the capacitated facility location problem, Metaheuristics ``In the large, Speeding up branch and bound algorithms for solving the maximum clique problem, Path relinking for unconstrained binary quadratic programming, A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays, Simulated annealing and tabu search approaches for the Corridor Allocation Problem, Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem, Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints, A cooperative parallel metaheuristic for the capacitated vehicle routing problem, Multiperiod multi traveling salesmen problem considering time window constraints with an application to a real world case, Cooperative cover of uniform demand, Unstructured grid adaptation for multiscale finite volume method, Tabu search for the RNA partial degradation problem, The integrated production-inventory-distribution-routing problem, A survey of dynamic scheduling in manufacturing systems, An efficient tabu algorithm for the single row facility layout problem, Benders decomposition, Lagrangean relaxation and metaheuristic design, Algorithms for the non-bifurcated network design problem, Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem, Heuristic algorithms for the cardinality constrained efficient frontier, Tackling the maximum happy vertices problem in large networks, Multistart search for the cyclic cutwidth minimization problem, Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem, Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping, Directional approach to gradual cover: the continuous case, Parallel machine scheduling with tool loading, Joint determination of process mean, price differentiation, and production decisions with demand leakage: a multi-objective approach, A hybrid dynamic programming -- Tabu search approach for the long-term hydropower scheduling problem, A survey of scheduling with parallel batch (p-batch) processing, Learning Bayesian networks from big data with greedy search: computational complexity and efficient implementation, Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem, Competitive location in cognitive radio networks, A set covering approach for multi-depot train driver scheduling, A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem, Vehicle dispatching with time-dependent travel times, A tabu search heuristic and adaptive memory procedure for political districting, A hybrid metaheuristic method for the maximum diversity problem, Column-generation based bounds for the homogeneous areas problem, Tabu search heuristics for the vehicle routing problem with time windows., A tabu search algorithm for assigning teachers to courses., Initialization of metaheuristics: comprehensive review, critical analysis, and research directions, An efficient heuristic for the \(k\)-partitioning problem, The multifacility center problems with random demand weights, Algorithm unions for solving discrete optimization problems, Heuristics for the capacitated dispersion problem, Tabu search with strategic oscillation for improving collection assignment plans of waste electric and electronic equipment, An extreme‐point tabu‐search algorithm for fixed‐charge network problems, Minimizing the total waiting time of intermediate products in a manufacturing process, Similarities between meta-heuristics algorithms and the science of life, Annealing evolutionary stochastic approximation Monte Carlo for global optimization, Simple heuristics for the multi-period fleet size and mix vehicle routing problem, Design of a quality control network for an international food company, A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem, Taking advantage of symmetry in some quadratic assignment problems, État de l'art des méthodes “d'optimisation globale”, Solving multiobjective optimisation problems using genetic algorithms and solutions concepts of cooperative games, CPD Tree Learning Using Contexts as Background Knowledge, Network reliability maximization for stochastic-flow network subject to correlated failures using genetic algorithm and tabu search, Coloration de graphes : fondements et applications, Tabu search algorithm for flexible flow path design of unidirectional automated-guided vehicle systems, A tabu search algorithm for a two-dimensional non-guillotine cutting problem, Hybrid heuristics for the maximum diversity problem, Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem, Variable neighborhood search for the dial-a-ride problem, Decycling bipartite graphs, Unforeseen Consequences of “Tabu” Choices—A Retrospective, ERG-DE: an elites regeneration framework for differential evolution, Metaheuristics for the minimum gap graph partitioning problem, Integrated real-time control of mixed-model assembly lines and their part feeding processes, Neighborhood decomposition-driven variable neighborhood search for capacitated clustering, A threshold search based memetic algorithm for the disjunctively constrained knapsack problem, Two server dynamic coverage location model under stochastic travel time, Computational study of a branching algorithm for the maximum \(k\)-cut problem, Complexity and heuristics for the weighted max cut‐clique problem, Spreading points using gradient and tabu, Multipurpose shopping trips and location, A Survey of the Generalized Assignment Problem and Its Applications, Metaheuristics: A Canadian Perspective, Exponential extrapolation memory for tabu search, Decision Support System for the Multi-depot Vehicle Routing Problem, Hidden Markov Models Training Using Population-based Metaheuristics, Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization, Optimizando con búsqueda tabú en particionamiento sobre datos espaciales con múltiples objetivos, A refinement of the gravity model for competitive facility location, Designing Reliable IP Networks with an Access/Edge/Core Hierarchical Structure, Solution Methods for Fuel Supply of Trains, Extensions to the planar \(p\)-median problem, Tabu search exploiting local optimality in binary optimization, Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem, Truck routing and scheduling for cross-docking in the supply chain: model and solution method, Empirical tail risk management with model-based annealing random search, Performance Enhancements for Defined Benefit Pension Plans, Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands, Optimal unit commitment decision with risk assessment using tabu search, Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm, A guide-and-observe hyper-heuristic approach to the Eternity II puzzle, A Tabu Search Method for Interval Constraints, A mathematical programming approach to the construction of BIBDs, Visiting near-optimal solutions using local search algorithms, Parallel Solution Methods for Vehicle Routing Problems, Applying an Intensification Strategy on Vehicle Routing Problem, Ejection chain and filter-and-fan methods in combinatorial optimization, Global Optimization in Practice:State of the Art and Perspectives, Computational Optimization: An Overview, Optimization Algorithms, Comparing descent heuristics and metaheuristics for the vehicle routing problem, Optimizing the system of virtual paths by tabu search., The Secret Life of Keys: On the Calculation of Mechanical Lock Systems, Variable neighborhood search: Principles and applications, Analysis and guidelines to obtain a good uniform fuzzy partition granularity for fuzzy rule-based systems using simulated annealing, Local search structure in the symmetric travelling salesperson problem under a general class of rearrangement neighborhoods, Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List, Unnamed Item, Reducing the bandwidth of a sparse matrix with tabu search., Efficient Batch Job Scheduling in Grids Using Cellular Memetic Algorithms, Adaptive memory programming: a unified view of metaheuristics, The noising methods: A generalization of some metaheuristics, A tabu search method for the truck and trailer routing problem, Defining tabu list size and aspiration criterion within tabu search methods, A Hybrid Genetic Approach for the Dynamic Vehicle Routing Problem with Time Windows, A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems, Heuristics for integrated optimization of catheter positioning and Dwell time distribution in prostate HDR brachytherapy, Annealing evolutionary stochastic approximation Monte Carlo for global optimization, Unnamed Item, Unnamed Item, Quantum bridge analytics. I: A tutorial on formulating and using QUBO models, Quantum bridge analytics. I: A tutorial on formulating and using QUBO models, Minimizing the cost of placing and sizing wavelength division multiplexing and optical crossconnect equipment in a telecommunications network, Merging Variables: One Technique of Search in Pseudo-Boolean Optimization, Simulation optimization: a review of algorithms and applications, Data-Mining-Driven Neighborhood Search, A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem, A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks, A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage, Speeding up MCS Algorithm for the Maximum Clique Problem with ILS Heuristic and Other Enhancements, Improved starting solutions for the planar p-median problem, Approximation algorithms for the design of SDH/SONET networks, Consistency checking within local search applied to the frequency assignment with polarization problem, Heuristic and metaheuristic methods for computing graph treewidth, Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes, Unnamed Item, GENVNS-TS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery, Penalty Rules in Multicriteria Genetic Search, A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants, A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location, Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order, Minimization of spatial cover times for impaired self-avoiding random walks: the mirage effect, Memory and Learning in Metaheuristics, Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives, Interactive Multiple Criteria Decision Making for Large-Scale Multi-Objective Optimization Problems