Experimental Methods for the Analysis of Optimization Algorithms

DOI10.1007/978-3-642-02538-9zbMath1203.68003OpenAlexW1625914768MaRDI QIDQ3058164

No author found.

Publication date: 18 November 2010

Full work available at URL: https://doi.org/10.1007/978-3-642-02538-9

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Mathematical programming (90C99)

Related Items (14)

Heuristic search to the capacitated clustering problem ⋮ A scatter search algorithm for the distributed permutation flowshop scheduling problem ⋮ 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 ⋮ Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows ⋮ An effective iterated tabu search for the maximum bisection problem ⋮ An opposition-based memetic algorithm for the maximum quasi-clique problem ⋮ A survey of the standard location-routing problem ⋮ Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives ⋮ Microforecasting methods for fresh food supply chain management: a computational study ⋮ Time-series event-based prediction: an unsupervised learning framework based on genetic programming ⋮ A model of anytime algorithm performance for bi-objective optimization ⋮ Automatic algorithm design for hybrid flowshop scheduling problems ⋮ Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach

Uses Software

• SPOT

This page was built for publication: Experimental Methods for the Analysis of Optimization Algorithms