Tabu search
From MaRDI portal
swMATH8556MaRDI QIDQ20565FDOQ20565
Author name not available (Why is that?)
Official website: https://doi.org/10.1007/BF02078647
Cited In (only showing first 100 items - show all)
- A tabu search heuristic and adaptive memory procedure for political districting
- Integrated distribution and loading planning via a compact metaheuristic algorithm
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- Sidelobe level reduction in linear array pattern synthesis using particle swarm optimization
- Consistency of community detection in networks under degree-corrected stochastic block models
- Lower and upper bounds for the bin packing problem with fragile objects
- Risk approaches for delivering disaster relief supplies
- Tabu search algorithms for water network optimization
- Algorithms for minclique scheduling problems
- Problem difficulty for tabu search in job-shop scheduling
- A GRASP with evolutionary path relinking for the truck and trailer routing problem
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- Assignment problems: a golden anniversary survey
- Fast metaheuristics for the discrete \((r|p)\)-centroid problem
- Defining tabu list size and aspiration criterion within tabu search methods
- Routing and wavelength assignment by partition colouring
- The \(p\)-median problem: a survey of metaheuristic approaches
- A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
- A scatter search-based heuristic to locate capacitated transshipment points
- Hybrid meta-heuristic algorithms for solving network design problem
- Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem
- ERG-DE: an elites regeneration framework for differential evolution
- Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution
- Feasibility pump 2.0
- A GIS-based optimization framework for competitive multi-facility location-routing problem
- Variable neighborhood search: Principles and applications
- The cross-entropy method for continuous multi-extremal optimization
- 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
- An efficient tabu search procedure for the \(p\)-median problem
- Planning models for freight transportation
- Multi-objective meta-heuristics for the traveling salesman problem with profits
- Optimal location with equitable loads
- Using distributed search methods for balancing mixed-model assembly lines in the automotive industry
- Neighborhood search heuristics for the uncapacitated facility location problem
- Variable neighborhood tabu search and its application to the median cycle problem.
- GRASP for set packing problems.
- Locating service facilities whose reliability is distance dependent.
- Heuristic solutions to multi-depot location-routing problems
- A hybrid heuristic for the uncapacitated hub location problem
- A tabu search heuristic procedure for the fixed charge transportation problem
- A 2-exchange heuristic for nesting problems
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
- A search space ``cartography for guiding graph coloring heuristics
- A bilevel fixed charge location model for facilities under imminent attack
- A compact model and tight bounds for a combined location-routing problem
- A two-phase tabu search approach to the location routing problem
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- 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
- Optimization methods for the planning of rapid transit systems
- Improvement heuristics for the vehicle routing problem based on simulated annealing
- Nurse rostering problems -- a bibliographic survey.
- Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints
- Combinatorial optimization: current successes and directions for the future
- Recent developments and trends in global optimization
- Optimal reference subset selection for nearest neighbor classification by tabu search
- Nurse scheduling with tabu search and strategic oscillation
- Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Bike sharing systems: solving the static rebalancing problem
- The multi-mode resource-constrained project scheduling problem with generalized precedence relations
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- Simulated annealing metaheuristics for the vehicle routing problem with time windows
- Ant colony optimization theory: a survey
- Heuristics for urban road network design: lane layout and signal settings
- An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- The minimum shift design problem
- A metaheuristic to solve a location-routing problem with nonlinear costs
- Solving the uncapacitated facility location problem using tabu search
- A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays
- Path relinking for unconstrained binary quadratic programming
- A tabu search heuristic for the truck and trailer routing problem
- Principles of scatter search
- The feasibility pump
- Tabu search for the cyclic bandwidth problem
- MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization
- Lot sizing and furnace scheduling in small foundries
- Two phase algorithms for the bi-objective assignment problem
- Generating meta-heuristic optimization code using ADATE
- A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem
- A tutorial on the cross-entropy method
- Heuristic algorithms for the cardinality constrained efficient frontier
- A library of local search heuristics for the vehicle routing problem
- SCIP: solving constraint integer programs
- Adaptive tabu search for course timetabling
- Political districting: from classical models to recent approaches
- Improvements to MCS algorithm for the maximum clique problem
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Experiments with, and on, algorithms for maximum likelihood clustering
- Application of the cross-entropy method to clustering and vector quantization
- Managing the tabu list length using a fuzzy inference system: an application to examination timetabling
- An IP algorithm for RNA folding trajectories
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
This page was built for software: Tabu search
