scientific article; zbMATH DE number 1488569
From MaRDI portal
Publication:4495496
zbMath0942.90500MaRDI QIDQ4495496
No author found.
Publication date: 10 August 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
neural networkssimulated annealingtabu searchLagrangean relaxationgenetic algorithmsCombinatorial problemscollection of survey papersModern heuristic techniques
Integer programming (90C10) Combinatorics in computer science (68R05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Related Items
ARMS: an automated resource management system for British telecommunications plc, A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis, A survey of search methodologies and automated system development for examination timetabling, Error bounds estimate of weighted residuals method using genetic algorithms, Topological dynamics characterization for LEO satellite networks, \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis, Determining the timing of project control points using a facility location model and simulation, Emergency facility location under random network damage: insights from the Istanbul case, A heuristic genetic algorithm for product portfolio planning, 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, 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, Location and layout planning. A survey, ARC crossing minimization in hierarchical digraphs with tabu search, Multiprogramming genetic algorithm for optimization problems with permutation property, Using tabu search to solve the common due date early/tardy machine scheduling problem, Variable neighborhood search, A Lagrangian heuristic algorithm for a public healthcare facility location problem, Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach, Solution approaches to irregular nesting problems, Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach, Dealing with repetitions in sequencing by hybridization, A hybrid biased random key genetic algorithm approach for the unit commitment problem, A hybrid placement strategy for the three-dimensional strip packing problem, Use of Lagrangian decomposition in supply chain planning, Statistical design of genetic algorithms for combinatorial optimization problems, 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., A new hybrid method for solving global optimization problem, 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., How to park freight trains on rail-rail transshipment yards: the train location problem, Local search for shift design., Heuristic methods for gang-rip saw arbor design., Exact and approximate algorithms for variable selection in linear discriminant analysis, 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., A method for determining cost-efficient inspection strategies in multistage production systems. Abstract of Thesis, 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), Unrelated parallel machine scheduling -- perspectives and progress, Optimising \(k\)-means clustering results with standard software packages, Identifying algorithmic vulnerabilities through simulated annealing, Variable neighbourhood search: methods and applications, Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors., Bit-error-rate-minimizing channel shortening using post-FEQ diversity combining and a genetic algorithm, Activity consolidation to improve responsiveness, A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem, An MDL approach to the climate segmentation problem, Global search algorithm for automated maintenance planning and scheduling of parts requests, Truck scheduling at zero-inventory cross docking terminals, Solving weighted MAX-SAT via global equilibrium search, Heuristic factory planning algorithm for advanced planning and scheduling, Revisiting constraint-directed search, A two-stage model for a day-ahead paratransit planning problem, A simple tabu search method to solve the mixed-integer linear bilevel programming problem, General local search methods, Aggregation error for location models: Survey and analysis, A fast tabu search algorithm for the permutation flow-shop problem, A genetic algorithm for the set covering problem, Variable neighbourhood search: Methods and applications, 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, Nature's way of optimizing, A hybrid genetic algorithm for the open shop scheduling problem, 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, A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times, Assignment of program modules to processors: a simulated annealing approach., Heuristics for cardinality constrained portfolio optimization, 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, 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, Global and local search algorithms for concave cost transshipment problems, 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, Metaheuristics in combinatorial optimization, Optimization of sampling designs for pedigrees and association studies, Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the <scp>VeRoLog</scp> Solver Challenge 2019, Metaheuristics: A Canadian Perspective, Variable neighborhood search: Principles and applications, Optimal polygonal approximation of digital planar curves using meta heuristics, Scheduling projects with labor constraints, 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, Extended omega ratio optimization for risk‐averse investors, A parallel hybrid local search algorithm for the container loading problem, Omega-CVaR portfolio optimization and its worst case analysis, A population heuristic for constrained two-dimensional non-guillotine cutting, État de l'art des méthodes “d'optimisation globale”, Hybrid genetic algorithm for optimization problems with permutation property, A simulated annealing approach to the solution of job rotation scheduling problems, Optimized planning of frequency hopping in cellular networks, Problems of discrete optimization: challenges and main approaches to solve them, Tabu search model selection in multiple regression analysis, An effective hybrid algorithm for the problem of packing circles into a larger containing circle, A hybrid meta-heuristic for multi-objective optimization: MOSATS, A hybrid genetic algorithm for the two-dimensional single large object placement problem, Multi-objective optimization problems with fuzzy relation equation constraints regarding Max-average composition, A relax-and-cut framework for large-scale maximum weight connected subgraph problems, Application of new double side approach method to the solution of super-elliptical plate problems, 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, An algorithm for minimizing clustering functions, The hyperbolic smoothing clustering method, Applying available-to-promise (ATP) concept in mixed-model assembly line sequencing problems in a make-to-order (MTO) environment: problem extension, model formulation and Lagrangian relaxation algorithm, Matching formulation of the staff transfer problem: meta-heuristic approaches, A simulated annealing algorithm for the maximum planar subgraph problem, A multiperiod vehicle lease planning for urban freight consolidation network, Hybrid genetic algorithms for bin-packing and related problems, 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, Lagrangian solution of maximum dispersion problems, Hybrid Metaheuristics: An Introduction, “MOSS-II” Tabu/Scatter Search for Nonlinear Multiobjective Optimization, 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, Optimizing production smoothing decisions via batch selection for mixed-model just-in-time manufacturing systems with arbitrary setup and processing times, Genetic algorithm of tournament crowding based on Gaussian mutation, The resource constrained shortest path problem implemented in a lazy functional language, TABU search methodology in global optimization, 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, Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes, 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, METAHEURISTIC OPTIMIZATION OF ACOUSTIC INVERSE PROBLEMS, Towards a robuster interpretive parsing. Learning from overt forms in optimality theory, An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops, Geometric and LP-based heuristics for angular travelling salesman problems in the plane, On solving complex multi-period location models using simulated annealing., Linear combinations of heuristics for examination timetabling, Production Control of a Flexible Manufacturing System in a Job Shop Environment, A Genetic Algorithm for Solving the Container Loading Problem, A tabu search algorithm for parallel machine total tardiness problem, A hybrid genetic algorithm for the container loading problem, On-line resources allocation for ATM networks with rerouting, Optimal RSUs placement with delay bounded message dissemination in vehicular networks, Dynamics of local search trajectory in traveling salesman problem, Solving the flight perturbation problem with meta heuristics, A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes, Constructing nurse schedules at large hospitals, A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem, A heuristic approach for the generation of multivariate random samples with specified marginal distributions and correlation matrix, Heuristic algorithms for the cardinality constrained efficient frontier, Linear programming and Lagrangian relaxation heuristics for designing a material flow network on a block layout, The omnipresence of Lagrange, A hybrid particle swarm optimization and genetic algorithm for closed-loop supply chain network design in large-scale networks, Joint optimization of budget allocation and maintenance planning of multi-facility transportation infrastructure systems, Multi-regime models for nonlinear nonstationary time series, Optimal path planning of mobile robots for sample collection, 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, Parsimonious periodic autoregressive models for time series with evolving trend and seasonality, 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., Time-varying multi-regime models fitting by genetic algorithms, 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, Accelerating the convergence of subgradient optimisation, Heuristics for the maximum outerplanar subgraph problem, 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., The capacitated centred clustering problem, Double side approach method to obtain solutions for transient nonlinear heat conduction using genetic algorithms, Memory and Learning in Metaheuristics, Multiple eigenspaces, Sliding mode tracking control with differential evolution optimisation algorithm using integral-chain differentiator in uncertain nonlinear systems, 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.
Uses Software
