Metaheuristics—the metaphor exposed
From MaRDI portal
Publication:5246818
DOI10.1111/itor.12001zbMath1309.90127OpenAlexW2032982318WikidataQ56431130 ScholiaQ56431130MaRDI QIDQ5246818
Publication date: 22 April 2015
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12001
Approximation methods and heuristics in mathematical programming (90C59) Development of contemporary mathematics (01A65) History of operations research and mathematical programming (90-03)
Related Items (51)
Linkage based deferred acceptance optimization ⋮ The impact of solution representations on heuristic net present value optimization in discrete time/cost trade-off project scheduling with multiple cash flow and payment models ⋮ Assembly line balancing: what happened in the last fifteen years? ⋮ An analysis of why cuckoo search does not bring any novel ideas to optimization ⋮ List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility ⋮ A developed artificial bee colony algorithm based on cloud model ⋮ Survey of quantitative methods in construction ⋮ A hybrid metaheuristic algorithm to optimise a real-world robotic cell ⋮ On metaheuristics for solving the parameter estimation problem in dynamic systems: a comparative study ⋮ Chunking and cooperation in particle swarm optimization for feature selection ⋮ A study on the pickup and delivery problem with time windows: matheuristics and new instances ⋮ A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows ⋮ On a smoothed penalty-based algorithm for global optimization ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ Thirty years of International Transactions in Operational Research: past, present, and future direction ⋮ Systematic reviews as a metaknowledge tool: caveats and a review of available options ⋮ Exposing the grey wolf, moth‐flame, whale, firefly, bat, and antlion algorithms: six misleading optimization techniques inspired by bestial metaphors ⋮ Initialization of metaheuristics: comprehensive review, critical analysis, and research directions ⋮ Metaheuristics for bilevel optimization: a comprehensive review ⋮ Chaos in popular metaheuristic optimizers – a bibliographic analysis ⋮ A critical analysis of the “improved Clarke and Wright savings algorithm” ⋮ Improving complex SMT strategies with learning ⋮ Expansion-based hill-climbing ⋮ From fitness landscapes evolution to automatic local search algorithm generation ⋮ Partial neighborhood local searches ⋮ A multilevel evaluation method for heuristics with an application to the VRPTW ⋮ Research trends in combinatorial optimization ⋮ Comparing two SVM models through different metrics based on the confusion matrix ⋮ Similarity in metaheuristics: a gentle step towards a comparison methodology ⋮ Across neighborhood search algorithm: a comprehensive analysis ⋮ A memetic algorithm for solving rich waste collection problems ⋮ Choosing the right algorithm with hints from complexity theory ⋮ A robust possibilistic programming approach to multiperiod hospital evacuation planning problem under uncertainty ⋮ Multi-objective outpatient scheduling in health centers considering resource constraints and service quality: a robust optimization approach ⋮ Meta-optimization of multi-objective population-based algorithms using multi-objective performance metrics ⋮ Revisiting simulated annealing: a component-based analysis ⋮ Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times ⋮ Binary cockroach swarm optimization for combinatorial optimization problem ⋮ Review on nature-inspired algorithms ⋮ Methods for improving the efficiency of swarm optimization algorithms. A survey ⋮ The No Free Lunch Theorem: What Are its Main Implications for the Optimization Practice? ⋮ Metaheuristics ``In the large ⋮ Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs ⋮ Exploiting subproblem optimization in SAT-based maxsat algorithms ⋮ Metaheuristics for data mining ⋮ A review on computational intelligence for identification of nonlinear dynamical systems ⋮ Automatic algorithm design for hybrid flowshop scheduling problems ⋮ Local search methods for the solution of implicit inverse problems ⋮ Dynamic search trajectory methods for global optimization ⋮ A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs ⋮ The grid based approach, a fast local evaluation technique for line planning
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Self-adaptive heuristics for evolutionary computation
- GRASP and path relinking for the max-min diversity problem
- Variable neighborhood search
- Future paths for integer programming and links to artificial intelligence
- Designing and reporting on computational experiments with heuristic methods
- Testing heuristics: We have it all wrong
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
- The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
- Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- Using experimental design to find effective parameter settings for heuristics
- Experimental evaluation of heuristic optimization algorithms: A tutorial
This page was built for publication: Metaheuristics—the metaphor exposed
