Publication:4495496
From MaRDI portal
zbMath0942.90500MaRDI QIDQ4495496
No author found.
Publication date: 10 August 2000
neural networks; simulated annealing; tabu search; Lagrangean relaxation; genetic algorithms; Combinatorial problems; collection of survey papers; Modern heuristic techniques
90C10: Integer programming
68R05: Combinatorics in computer science
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
00B15: Collections of articles of miscellaneous specific interest
90-06: Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming
Related Items
Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors., Activity consolidation to improve responsiveness, A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem, Global and local search algorithms for concave cost transshipment problems, Metaheuristics in combinatorial optimization, ARMS: an automated resource management system for British telecommunications plc, Topological dynamics characterization for LEO satellite networks, A heuristic genetic algorithm for product portfolio planning, An evolutionary algorithm and discrete event simulation for optimizing inspection strategies for multi-stage processes, A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil, The \(p\)-median problem: a survey of metaheuristic approaches, A hybrid meta-heuristic for the batching problem in just-in-time flow shops, A genetic algorithm for the \(p\)-median problem with pos/neg weights, Optimizing heuristic search in forest planning, Heuristic approaches for batching jobs in printed circuit board assembly, Multiprogramming genetic algorithm for optimization problems with permutation property, Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach, Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach, Dealing with repetitions in sequencing by hybridization, A method for determining cost-efficient inspection strategies in multistage production systems. Abstract of Thesis, Optimising \(k\)-means clustering results with standard software packages, Global search algorithm for automated maintenance planning and scheduling of parts requests, Solving weighted MAX-SAT via global equilibrium search, Solution approaches to irregular nesting problems, A simple tabu search method to solve the mixed-integer linear bilevel programming problem, General local search methods, A fast tabu search algorithm for the permutation flow-shop problem, A genetic algorithm for the set covering problem, Planning models for freight transportation, A multi-level composite heuristic for the multi-depot vehicle fleet mix problem, Driving tabu search with case-based reasoning, The obnoxious \(p\) facility network location problem with facility interaction, Heuristic concentration and tabu search: A head to head comparison, Some personal views on the current state and the future of locational analysis, Efficient solutions to the cell-formation problem with multiple routings via a double-loop genetic algorithm, Modeling and solving a real-life assignment problem at universities, Iterative improvement methods for a multiperiod network design problem, Error bounds estimate of weighted residuals method using genetic algorithms, 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, Location and layout planning. A survey, ARC crossing minimization in hierarchical digraphs with tabu search, Using tabu search to solve the common due date early/tardy machine scheduling problem, Variable neighborhood search, Error bounds estimate of nonlinear boundary value problems using method of weighted residuals with genetic algorithms, Using global search heuristics for the capacity vehicle routing problem., A composite heuristic for the single machine early/tardy job scheduling problem., A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution., Designing tributary networks with multiple ring families., Applying the double side method of weighted residual for solving circle plate large deformation problems., Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search., Solving the continuous flow-shop scheduling problem by metaheuristics., Budget constrained location problem with opening and closing of facilities., Local search for shift design., Heuristic methods for gang-rip saw arbor design., An efficient tabu search approach for the two-machine preemptive open shop scheduling problem., Applying the double side method to solution nonlinear pendulum problem., An MCDM approach to portfolio optimization., A hybrid algorithm for identifying global and local minima when optimizing functions with many minima., Approximate algorithms for constrained circular cutting problems, An ant colony system for permutation flow-shop sequencing, Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder), Nature's way of optimizing, A hybrid genetic algorithm for the open shop scheduling problem, Assignment of program modules to processors: a simulated annealing approach., Heuristics for cardinality constrained portfolio optimization, Performance evaluation of evolutionary class of algorithms -- an application to 0-1 knapsack problem, Optimal reference subset selection for nearest neighbor classification by tabu search, Multi-objective optimization problems with fuzzy relation equation constraints, Local search with constraint propagation and conflict-based heuristics, The flow shop with parallel machines: A tabu search approach, Tabu search for resource-constrained scheduling, A tabu search algorithm for the optimisation of telecommunication networks, Tabu search in audit scheduling, Nurse scheduling with tabu search and strategic oscillation, A tabu search algorithm for parallel machine total tardiness problem, A heuristic approach for the generation of multivariate random samples with specified marginal distributions and correlation matrix, Extensions to the generalised assignment heuristic for vehicle routing, A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs, Guided local search and its application to the traveling salesman problem, Upper and lower bounds of the solution for an elliptic plate problem using a genetic algorithm, The robust coloring problem., An evolutionary heuristic for the index tracking problem., Accelerating the convergence of subgradient optimisation, Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties, Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic, A multipopulation cultural algorithm for the electrical generator scheduling problem, Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions., Double side approach method to obtain solutions for transient nonlinear heat conduction using genetic algorithms, Multiple eigenspaces, Optimal task allocation and hardware redundancy policies in distributed computing systems, A genetic algorithm for the vehicle routing problem, Identification of cohesive crack fracture parameters by evolutionary search., A population heuristic for constrained two-dimensional non-guillotine cutting, Hybrid genetic algorithm for optimization problems with permutation property, Optimized planning of frequency hopping in cellular networks, Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches, Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue, Scatter search and star-paths: Beyond the genetic metaphor, Hybrid genetic algorithms for bin-packing and related problems, Tabu search model selection in multiple regression analysis, État de l'art des méthodes “d'optimisation globale”, Unnamed Item, A simulated annealing algorithm for the maximum planar subgraph problem, The resource constrained shortest path problem implemented in a lazy functional language, An algorithm for minimizing clustering functions, Local Search Algorithms for the Maximal Planar Layout Problem, Heuristics from Nature for Hard Combinatorial Optimization Problems, Optimisation of a Simulated‐Annealing‐based Heuristic for Single Row Machine Layout Problem by Genetic Algorithm, On solving complex multi-period location models using simulated annealing., A hybrid genetic algorithm for the container loading problem, Variable neighborhood search: Principles and applications, Optimal polygonal approximation of digital planar curves using meta heuristics, Scheduling projects with labor constraints, The omnipresence of Lagrange, The noising methods: A generalization of some metaheuristics, Defining tabu list size and aspiration criterion within tabu search methods, Local search heuristics for two-stage flow shop problems with secondary criterion, A simulated annealing approach to police district design, On the use of genetic algorithms to solve location problems, Feature selection using tabu search method, Metaheuristics: A bibliography, Designing and reporting on computational experiments with heuristic methods, Parallel local search, Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs, TABU search methodology in global optimization, Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes, A simulated annealing approach to the solution of job rotation scheduling problems, Problems of discrete optimization: challenges and main approaches to solve them, An effective hybrid algorithm for the problem of packing circles into a larger containing circle, Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data, A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments, Lot sizing and furnace scheduling in small foundries, A simulated annealing algorithm for transient optimization in gas networks, The travelling salesman problem with precedence constraints., Constraint satisfaction methods for solving the staff transfer problem, An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops, On-line resources allocation for ATM networks with rerouting, Dynamics of local search trajectory in traveling salesman problem, Solving the flight perturbation problem with meta heuristics, A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem, A simulated annealing algorithm for determining the thickness of a graph, Principles of scatter search, ``MOSS multiobjective scatter search applied to nonlinear multiple criteria optimization, Applying the double side method of weighted residual to the solution of shell deformation problem, A tabu search heuristic for the truck and trailer routing problem, A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems, Heuristics for the maximum outerplanar subgraph problem, The capacitated centred clustering problem, A hybrid meta-heuristic for multi-objective optimization: MOSATS, A hybrid genetic algorithm for the two-dimensional single large object placement problem, A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes, Constructing nurse schedules at large hospitals, A parallel hybrid local search algorithm for the container loading problem, Optimal path planning of mobile robots for sample collection, “MOSS-II” Tabu/Scatter Search for Nonlinear Multiobjective Optimization, Optimizing production smoothing decisions via batch selection for mixed-model just-in-time manufacturing systems with arbitrary setup and processing times, Production Control of a Flexible Manufacturing System in a Job Shop Environment, A Genetic Algorithm for Solving the Container Loading Problem
Uses Software
