Metaheuristics: A bibliography

From MaRDI portal
Publication:1919858

DOI10.1007/BF02125421zbMath0849.90097OpenAlexW1981689130MaRDI QIDQ1919858

Gilbert Laporte, Ibrahim. H Osman

Publication date: 18 September 1996

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02125421



Related Items

On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study, A primer on the application of neural networks to covering array generation, A survey of search methodologies and automated system development for examination timetabling, Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity, Tabu search model selection in multiple regression analysis, Making a state-of-the-art heuristic faster with data mining, An adaptive multi-objective optimization method for optimum design of distribution networks, An agent-based negotiation model on price and delivery date in a fashion supply chain, A survey for the quadratic assignment problem, Developing effective meta-heuristics for a probabilistic location model via experimental design, On some optimization problems in molecular biology, Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits, A hybrid data mining GRASP with path-relinking, A taxonomy of flexible flow line scheduling procedures, The single line moving target traveling salesman problem with release times, Political districting: from classical models to recent approaches, A hybrid meta-heuristic for the batching problem in just-in-time flow shops, Learning multicriteria fuzzy classification method PROAFTN from data, Variable neighborhood search, A recourse goal programming approach for airport bus routing problem, Metaheuristics: A bibliography, Self-organizing feature maps for the vehicle routing problem with backhauls, A model and two heuristic approaches for a forage Harvester planning problem: a case study, Hybrid Metaheuristics: An Introduction, Discovering optimal strategy in tactical combat scenarios through the evolution of behaviour trees, Simulated annealing for complex portfolio selection problems., A contribution to the stochastic flow shop scheduling problem., A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments, An overview of the method of fundamental solutions -- solvability, uniqueness, convergence, and stability, Staff scheduling and rostering: a review of applications, methods and models., Optimizing production smoothing decisions via batch selection for mixed-model just-in-time manufacturing systems with arbitrary setup and processing times, GRASP for set packing problems., Multi-coloring and job-scheduling with assignment and incompatibility costs, Comparing different metaheuristic approaches for the median path problem with bounded length, An analysis of selection methods in memory consideration for harmony search, A neural-tabu search heuristic for the real time vehicle routing problem, Political districting: From classical models to recent approaches, Applications of the DM‐GRASP heuristic: a survey, A multiperiod set covering location model for dynamic redeployment of ambulances, Graph Coloring Models and Metaheuristics for Packing Applications, Multi-objective grasshopper optimization algorithm based on multi-group and co-evolution, Fuzzy job-shop scheduling problems: a review, Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art, Adaptive switching gravitational search algorithm: an attempt to improve diversity of gravitational search algorithm through its iteration strategy, Applying an Intensification Strategy on Vehicle Routing Problem, Optimal design of steel barrelled shells, Applications of optimization heuristics to estimation and modelling problems, Global optimization test problems based on random field composition, Comparing descent heuristics and metaheuristics for the vehicle routing problem, A tabu search algorithm for structural software testing, Variable neighborhood search: Principles and applications, Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors., A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem, Noising methods for a clique partitioning problem, Variable neighborhood search for the maximum clique, Putting continuous metaheuristics to work in binary search spaces, Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search, Greedy random adaptive memory programming search for the capacitated clustering problem, A hybrid algorithm for solving inverse problems in elasticity, A tabu search algorithm for the routing and capacity assignment problem in computer networks, Defining tabu list size and aspiration criterion within tabu search methods, Combinatorial optimization analysis of the unary NP-complete disassembly line balancing problem, Planning for agricultural forage harvesters and trucks: model, heuristics, and case study, A hybrid data mining metaheuristic for the p‐median problem, Une heuristique d'optimisation globale basée sur laΨ-transformation, Local search algorithms for the \(k\)-cardinality tree problem., Fuzzy sets and operations research: Perspectives, Using a greedy random adaptative search procedure to solve the cover printing problem, Towards an efficient resolution of printing problems, A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls, Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem, A tabu search heuristic and adaptive memory procedure for political districting, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, Metaheuristics in combinatorial optimization


Uses Software


Cites Work