Tabu search
From MaRDI portal
Software:20565
swMATH8556MaRDI QIDQ20565FDOQ20565
Author name not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands
- A flow-based tabu search algorithm for the RCPSP with transfer times
- A review of hyper-heuristics for educational timetabling
- A combined local search and integer programming approach to the traveling tournament problem
- A benchmark library and a comparison of heuristic methods for the linear ordering problem
- Timetable construction: the algorithms and complexity perspective
- An evolutionary approach for the nurse rerostering problem
- A survey of very large-scale neighborhood search techniques
- A new heuristic for solving the \(p\)-median problem in the plane
- Comparative analysis of the machine repair problem with imperfect coverage and service pressure condition
- The terminal-oriented ship stowage planning problem
- Frequency optimization in public transportation systems: formulation and metaheuristic approach
- A mathematical model and a metaheuristic approach for a memory allocation problem
- Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
- A survey of search methodologies and automated system development for examination timetabling
- Proactive and reactive strategies for resource-constrained project scheduling with uncertain resource availabilities
- A simulated annealing approach to the traveling tournament problem
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
- Near-optimal solutions for the generalized max-controlled set problem
- A randomized granular tabu search heuristic for the split delivery vehicle routing problem
- 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
- Local search for the undirected capacitated arc routing problem with profits
- Assigning judges to competitions of several rounds using tabu search
- A memetic algorithm for the minimum sum coloring problem
- An adaptive multistart tabu search approach to solve the maximum clique problem
- A hyper-heuristic approach to sequencing by hybridization of DNA sequences
- Tabu search with path relinking for an integrated production-distribution problem
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- Applying the corridor method to a blocks relocation problem
- Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
- Recent advances on two-dimensional bin packing problems
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- A metaheuristic for stochastic service network design
- An efficient heuristic for reliability design optimization problems
- Integrated production and distribution scheduling with lifespan constraints
- Transshipment service through crossdocks with both soft and hard time windows
- The evolution of cell formation problem methodologies based on recent studies (1997-2008): Review and directions for future research
- A tabu search heuristic for the quay crane scheduling problem
- Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia
- A tabu search approach for solving a difficult forest harvesting machine location problem
- Optimizing heuristic search in forest planning
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
- Truck dock assignment problem with operational time constraint within crossdocks
- An algorithm for the generalized quadratic assignment problem
- A route set construction algorithm for the transit network design problem
- A novel hybrid differential evolution and particle swarm optimization algorithm for unconstrained optimization
- Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem
- Industrial aspects and literature survey: fleet composition and routing
- A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow
- General local search methods
- The noising methods: A generalization of some metaheuristics
- A survey on metaheuristics for stochastic combinatorial optimization
- A fast tabu search algorithm for the permutation flow-shop problem
- A variable selection method based on Tabu search for logistic regression models
- Heuristic algorithms for the multi-depot ring-star problem
- Upper and lower bounds for the single source capacitated location problem.
- Service network design in freight transportation
- A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints
- Two-dimensional packing problems: a survey
- An algorithm based on tabu search for satisfiability problem
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
- Vehicle dispatching with time-dependent travel times
- Solving transportation problems with nonlinear side constraints with tabu search
- A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty
- Multi-neighborhood tabu search for the maximum weight clique problem
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- Improvements to MCS algorithm for the maximum clique problem
- Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
- Ambulance location and relocation models.
- Neighborhood portfolio approach for local search applied to timetabling problems
- Bees algorithm for generalized assignment problem
- The integrated production-inventory-distribution-routing problem
- The minimum weighted covering location problem with distance constraints
- Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
- Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- Explorative anytime local search for distributed constraint optimization
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- A tabu search approach for the livestock collection problem
- Improved tabu search heuristics for the dynamic space allocation problem
- Breakout local search for the quadratic assignment problem
- A hybrid metaheuristic method for the maximum diversity problem
- Multiple crossdocks with inventory and time windows
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
- Some aspects of scatter search in the flow-shop problem
- On characterization of maximal independent sets via quadratic optimization
- MOAQ and ant-Q algorithm for multiple objective optimization problems
- Variable neighborhood search for the dial-a-ride problem
- A multiperiod set covering location model for dynamic redeployment of ambulances
- A new tabu search algorithm for the vehicle routing problem with backhauls
- Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem
- The Generalized Max-Controlled Set Problem
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
This page was built for software: Tabu search
