Tabu Search—Part I

From MaRDI portal
Revision as of 01:55, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4018159

DOI10.1287/ijoc.1.3.190zbMath0753.90054DBLPjournals/informs/Glover89OpenAlexW4246598646WikidataQ56017138 ScholiaQ56017138MaRDI QIDQ4018159

Fred Glover

Publication date: 16 January 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1.3.190




Related Items (only showing first 100 items - show all)

Optimal attack strategy of complex networks based on tabu searchTabu search enhances network robustness under targeted attacksA very fast tabu search algorithm for the permutation flow shop problem with makespan criterionA neuro-tabu search heuristic for the flow shop scheduling problemA new hybrid heuristic approach for solving large traveling salesman problemA tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphsBayesian community detectionCost optimization of a repairable M/G/1 queue with a randomized policy and single vacationLot sizing in capacitated production planning and control systemsSolving transportation problems with nonlinear side constraints with tabu searchImproving the performance of enumerative search methods. I: Exploiting structure and intelligencePolynomially solvable cases for the maximum stable set problemDetecting robust cliques in graphs subject to uncertain edge failuresStudy of a controllable queueing system with unreliable heterogeneous serversThe capacitated vehicle routing problem with evidential demandsA quality and distance guided hybrid algorithm for the vertex separator problemA bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problemAn efficient implementation of a static move descriptor-based local search heuristicBalancing stochastic parallel assembly linesSoft computing hybrids for FOREX rate prediction: a comprehensive reviewHeuristics for the generalised assignment problem: Simulated annealing and tabu search approachesStrategies with memories: Local search in an application oriented environment. Applied local search -- a prologueLocal search with memory: Benchmarking RTSA local search approach for two-dimensional irregular cuttingSynchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirementsScatter search and star-paths: Beyond the genetic metaphorSolving the damper placement problem via local search heuristicsStrength and adaptability of problem-space based neighborhoods for resource-constrained schedulingHeuristic solution approaches to operational forest planning problemsMultiobjective simulation-based optimization based on artificial immune systems for a distribution centerA multiple pheromone table based ant colony optimization for clusteringAn efficient algorithm for unconstrained optimizationCommon due-date determination and sequencing using tabu searchThe simulated trading heuristic for solving vehicle routing problemsDeadline scheduling of multiprocessor tasksImproving local search heuristics for some scheduling problems. IAn improved tabu search approach for solving the job shop scheduling problem with tooling constraintsHORES: A timetabling system for Spanish secondary schoolsSolving the resource constrained project scheduling problem with optimization subroutine librarySimulated annealing metaheuristics for the vehicle routing problem with time windowsDynamic tabu search strategies for the traveling purchaser problemParallel asynchronous tabu search for multicommodity location-allocation with balancing requirementsBoosting quantum annealer performance via sample persistenceDesigning humanitarian supply chains by incorporating actual post-disaster decisionsEnergy efficient scheduling of open-pit coal mine trucksA tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problemA two-agent single-machine scheduling problem with late work criteriaAn efficient particle swarm optimizer with application to man-day project scheduling problemsA hybrid simulated annealing/linear programming approach for the cover printing problemA study on the enhanced best performance algorithm for the just-in-time scheduling problemA location-inventory-routing problem in forward and reverse logistics network designOptimization of competitive facility location for chain storesAn efficient local search for the feedback vertex set problemA direct search algorithm for global optimizationA comparison of algorithms for finding an efficient theme park tourA hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problemsBacterial foraging-tabu search metaheuristics for identification of nonlinear friction modelLTL logistics networks with differentiated servicesImproving convergence of evolutionary multi-objective optimization with local search: a concurrent-hybrid algorithmCapacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstructionRounding-based heuristics for nonconvex MINLPSA TABU search heuristic for the team orienteering problemSimulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment modelsRobust metaheuristic algorithm for redundancy optimization in large-scale complex systemsA cooperative parallel meta-heuristic for the vehicle routing problem with time windowsMaximum satisfiability: how good are tabu search and plateau moves in the worst-case?A tabu search algorithm for the routing and capacity assignment problem in computer networksApplying tabu search to backup path planning for multicast networksVehicle routing and appointment scheduling with team assignment for home servicesGenetic algorithm to the machine repair problem with two removable servers operating under the triadic \((0, {Q}, {N}, {M})\) policyResearch on medicine distribution route optimization for community health service institutionsSequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzlesGreedy randomized adaptive search proceduresInsertion techniques for the heuristic solution of the job shop problemOn a 2-dimensional equipartition problemJob shop scheduling with beam searchA simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphsProbabilistic local search algorithms for concave cost transportation network problemsDeterministic job-shop scheduling: Past, present and futureGuided local search and its application to the traveling salesman problemSolving the medium newspaper production/distribution problemConstraint ordinal optimizationLocal search algorithms for the \(k\)-cardinality tree problem.Heuristics for permutation flow shop scheduling with batch setup timesA hybrid tabu-ascent algorithm for the linear bilevel programming problemTabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penaltiesOptimization of pitch sequencing for pneumatic tire by tabu search methodA heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespanA tabu search heuristic procedure for the fixed charge transportation problemIntelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulationA hybrid heuristic for the uncapacitated hub location problemSeparating capacity constraints in the CVRP using tabu searchA tabu search algorithm for the bipartite drawing problemProposals for chunking and tabu searchA tabu search approach to the constraint satisfaction problem as a general problem solverSolving zero-one mixed integer programming problems using tabu searchAn efficient tabu search approach for the 0-1 multidimensional knapsack problemGlobal optimization approaches to an aircraft routing problemThe permutation flow shop with buffers: A tabu search approachTabu search heuristics for the vehicle routing problem with time windows.




This page was built for publication: Tabu Search—Part I