scientific article; zbMATH DE number 1062113

zbMATH Open0930.90083MaRDI QIDQ4354785FDOQ4354785

Authors: Fred Glover, Manuel Laguna 

Publication date: 17 September 1997

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1302201
• Tabu Search—Part II
• Tabu Search—Part I

zbMATH Keywords

simulated annealinggenetic algorithmsparallel computingtabu search heuristic

Mathematics Subject Classification ID

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

Cited In (only showing first 100 items - show all)

• Parallel machine selection and job scheduling to minimize machine cost and job tardiness
• Strategic oscillation for the quadratic multiple knapsack problem
• Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times
• Sequential search and its application to vehicle-routing problems
• The capacitated centred clustering problem
• Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem
• Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
• A two level metaheuristic for the operating room scheduling and assignment problem
• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
• Optimal shift partitioning of pharmacies
• Emergency facility location under random network damage: insights from the Istanbul case
• Breakout local search for maximum clique problems
• Memetic search for the max-bisection problem
• Solution method for the location planning problem of logistics park with variable capacity
• Multi-neighborhood local search optimization for machine reassignment problem
• Solving the quadratic minimum spanning tree problem
• Revised GRASP with path-relinking for the linear ordering problem
• Heuristic solution approaches for the maximum minsum dispersion problem
• Hybrid scatter tabu search for unconstrained global optimization
• Improved convergent heuristics for the 0-1 multidimensional knapsack problem
• Diversification-driven tabu search for unconstrained binary quadratic problems
• Algorithmic aspects for multiple-choice hardware/software partitioning
• A nonmonotone GRASP
• Exact and heuristic algorithms for the interval data robust assignment problem
• A simple and effective algorithm for the MaxMin diversity problem
• A leader-follower model for discrete competitive facility location
• A parallel tabu search for solving the primal buffer allocation problem in serial production systems
• 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
• A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations
• Political districting: From classical models to recent approaches
• The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model
• Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery
• The freight allocation problem with lane cost balancing constraint
• Optimizing the system of virtual paths by tabu search.
• Consistency checking within local search applied to the frequency assignment with polarization problem
• The maximin gradual cover location problem
• A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
• Evolutionary approaches to DNA sequencing with errors
• A comparison of five heuristics for the multiple depot vehicle scheduling problem
• Graph colouring approaches for a satellite range scheduling problem
• New neighborhood structures for the double traveling salesman problem with multiple stacks
• A tabu search algorithm for the single machine total weighted tardiness problem
• Optimizing base station location and configuration in UMTS networks
• Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
• 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
• Infeasible/feasible search trajectories and directional rounding in integer programming
• A filter-and-fan approach to the 2D HP model of the protein folding problem
• A tabu search approach to an urban transport problem in northern Spain
• Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
• Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs
• Construction and improvement algorithms for dispersion problems
• \(K\)-harmonic means data clustering with simulated annealing heuristic
• \(K\)-harmonic means data clustering with tabu-search method
• A mixed integer linear program and tabu search approach for the complementary edge covering problem
• A new neighborhood and tabu search for the blocking job shop
• Genetic algorithms and tabu search: Hybrids for optimization
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models
• Heuristics and meta-heuristics for 2-layer straight line crossing minimization
• Evolution and state-of-the-art in integer programming
• Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm
• Optimization algorithms
• MILP approach to pattern generation in logical analysis of data
• Scheduling satellite launch missions: an MILP approach
• Multistart search for the cyclic cutwidth minimization problem
• Fast local search algorithms for the handicapped persons transportation problem
• The linehaul-feeder vehicle routing problem with virtual depots and time windows
• Multipath adaptive tabu search for a vehicle control problem
• Simulated annealing and tabu search approaches for the Corridor Allocation Problem
• An unconstrained quadratic binary programming approach to the vertex coloring problem
• Interactive multiple criteria decision making for large-scale multi-objective optimization problems
• Solving the vehicle routing problem with adaptive memory programming methodology
• Hybridizing evolutionary algorithms with variable-depth search to overcome local optima
• A discrete model for optimal operation of fossil-fuel generators of electricity
• Heuristics for a project management problem with incompatibility and assignment costs
• 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
• Approximation algorithms for the design of SDH/SONET networks
• A metamodel-assisted evolutionary algorithm for expensive optimization
• Global optimization using a synchronization of multiple search points autonomously driven by a chaotic dynamic model
• Hybrid heuristics for the maximum diversity problem
• On the classification of NP-complete problems in terms of their correlation coefficient
• Perturbation heuristics for the pickup and delivery traveling salesman problem
• The theory of elementary landscapes
• Computing the metric dimension of graphs by genetic algorithms
• A heuristic to minimax absolute regret for linear programs with interval objective function coefficients
• Lasso solution strategies for the vehicle routing problem with pickups and deliveries
• AFSCN scheduling: how the problem and solution have evolved
• Min-energy broadcast in mobile ad hoc networks with restricted motion
• A tabu search method guided by shifting bottleneck for the job shop scheduling problem
• Tabu search for covering arrays using permutation vectors
• Analysis of new variable selection methods for discriminant analysis
• A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem
• Parametric tabu-search for mixed integer programs
• Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
• Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4354785)