Experimental Methods for the Analysis of Optimization Algorithms
From MaRDI portal
Cited in
(17)- Heuristic search to the capacitated clustering problem
- Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
- An effective iterated tabu search for the maximum bisection problem
- A survey of the standard location-routing problem
- Microforecasting methods for fresh food supply chain management: a computational study
- A model of anytime algorithm performance for bi-objective optimization
- Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach
- An opposition-based memetic algorithm for the maximum quasi-clique problem
- Automatic algorithm design for hybrid flowshop scheduling problems
- A survey of variants and extensions of the location-routing problem
- A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances
- A scatter search algorithm for the distributed permutation flowshop scheduling problem
- Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives
- Time-series event-based prediction: an unsupervised learning framework based on genetic programming
- Generalized variable neighborhood search algorithm for vehicle routing problem with time windows and synchronization
- A review of benchmark and test functions for global optimization algorithms and metaheuristics
- Algorithm 1060: EDOLAB, a platform for research and education in evolutionary dynamic optimization
This page was built for publication: Experimental Methods for the Analysis of Optimization Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058164)
