Tabu Search—Part I
From MaRDI portal
Publication:4018159
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- The single-finger keyboard layout problem
- 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
- Tabu search techniques. A tutorial and an application to neural networks
- Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
- Tabu search and design optimization
- Least-cost network topology design for a new service: An application of tabu search
- Location and sizing of offshore platforms for oil exploration
- The traveling salesman problem: An overview of exact and approximate algorithms
- Experimental analysis of simulated annealing based algorithms for the layout problem
- A connectionist approach to the quadratic assignment 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 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 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
- Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
- 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
- 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
- Algorithms for a multi-level network optimization problem
- Constructive heuristic algorithms for the open shop problem
- 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 two-dimensional mapping for the traveling salesman problem
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
- 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
- Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search
- 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
- Protein conformation of a lattice model using tabu 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
This page was built for publication: Tabu Search—Part I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018159)
