Pages that link to "Item:Q1922625"
From MaRDI portal
The following pages link to Designing and reporting on computational experiments with heuristic methods (Q1922625):
Displaying 50 items.
- Global optimization using \(q\)-gradients (Q322763) (← links)
- A comparative study on multiobjective metaheuristics for solving constrained in-core fuel management optimisation problems (Q342533) (← links)
- A self-adaptive chaotic differential evolution algorithm using gamma distribution for unconstrained global optimization (Q470812) (← links)
- On clarifying misconceptions when comparing variants of the artificial bee colony algorithm by offering a new implementation (Q508802) (← links)
- An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows (Q622144) (← links)
- Developing effective meta-heuristics for a probabilistic location model via experimental design (Q856202) (← links)
- Simulation of stochastic demand data streams for network revenue management problems (Q858607) (← links)
- Cárnico-ICSPEA2--A metaheuristic co-evolutionary navigator for a complex co-evolutionary farming system (Q863978) (← links)
- Group-scheduling problems in electronics manufacturing (Q964869) (← links)
- Lasso solution strategies for the vehicle routing problem with pickups and deliveries (Q1011218) (← links)
- Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624) (← links)
- Decomposition methods for large job shops (Q1592580) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems (Q1652102) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Core instances for testing: a case study (Q1779532) (← links)
- A comparison of complete global optimization solvers (Q1780958) (← links)
- A tabu search heuristic and adaptive memory procedure for political districting (Q1869686) (← links)
- A tabu search algorithm for assigning teachers to courses. (Q1871419) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Tabu search for the BWC problem (Q1928269) (← links)
- Heuristic optimisation in financial modelling (Q1931632) (← links)
- Benchmarking nonlinear optimization software in technical computing environments (Q1948530) (← links)
- Review on nature-inspired algorithms (Q1981936) (← links)
- Multi-trip time-dependent vehicle routing problem with soft time windows and overtime constraints (Q2005939) (← links)
- Approximate dynamic programming for the military inventory routing problem (Q2173135) (← links)
- Adaptive feasible and infeasible tabu search for weighted vertex coloring (Q2200563) (← links)
- Internal model control design based on approximation of linear discrete dynamical systems (Q2247309) (← links)
- Comparing heuristics for the product allocation problem in multi-level warehouses under compatibility constraints (Q2285897) (← links)
- Simulated annealing based artificial bee colony algorithm for global numerical optimization (Q2344646) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date (Q2384909) (← links)
- How to assess and report the performance of a stochastic algorithm on a benchmark problem: \textit{mean} or \textit{best} result on a number of runs? (Q2463834) (← links)
- Experimental analysis of approximation algorithms for the vertex cover and set covering problems (Q2496053) (← links)
- Machine scheduling performance with maintenance and failure (Q2643755) (← links)
- New variable-length data compression scheme for solution representation of meta-heuristics (Q2668691) (← links)
- Reproducible Econometric Simulations (Q2870576) (← links)
- Towards a theory of practice in metaheuristics design: A machine learning perspective (Q3431446) (← links)
- Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem (Q3541175) (← links)
- Designing data warehouses for equipment management system with genetic algorithms (Q3605429) (← links)
- New Rollout Algorithms for Combinatorial Optimization Problems (Q4709749) (← links)
- Comparative Analysis of Constraint Handling Techniques Based on Taguchi Design of Experiments (Q5011409) (← links)
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO (Q5136083) (← links)
- Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives (Q5153496) (← links)
- On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem (Q5191123) (← links)
- Metaheuristics—the metaphor exposed (Q5246818) (← links)
- A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems (Q5247673) (← links)
- COCO: a platform for comparing continuous optimizers in a black-box setting (Q5859012) (← links)
- A multilevel evaluation method for heuristics with an application to the VRPTW (Q6088238) (← links)
- Research trends in combinatorial optimization (Q6091419) (← links)
