Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
benchmark instance generation
Description:
Benchmark instance generation is the computational process of creating test problems for evaluating and comparing algorithms or optimization methods.
Related topics:
Constraint Satisfaction and Optimization (15%),
Metaheuristic Optimization Algorithms Research (15%),
Vehicle Routing Optimization Methods (14%),
Scheduling and Optimization Algorithms (11%),
Optimization and Packing Problems (8%)
OpenAlex ID:
keywords/benchmark-instance-generation
An evaluation of the adequacy of project network generators with systematically sampled networks
2007
·
Mario Vanhoucke
, José Coelho
, et al.
·
European Journal of Operational Research
·
234
Evolving diverse TSP instances by means of novel and creative mutation operators
2019
·
Jakob Bossek
, Pascal Kerschke
, et al.
·
Foundations of Genetic Algorithms
·
89
Hard multidimensional multiple choice knapsack problems, an empirical study
2009
·
Bing Han
, Jimmy Leblet
, et al.
·
Computers & Operations Research
·
75
Towards industrial-like random SAT instances
2009
·
Carlos Ansótegui
, Marı́a Luisa Bonet
, et al.
·
International Joint Conference on Artificial Intelligence
·
69
Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively
2007
·
H. Jia
, C. Moore
, et al.
·
Journal of Artificial Intelligence Research
·
62
PDF
Hiding Satisfying Assignments: Two are Better than One
2005
·
D. Achlioptas
, H. Jia
, et al.
·
Journal of Artificial Intelligence Research
·
58
PDF
A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming
2013
·
Arnaud Liefooghe
, Sébastien Verel
, et al.
·
Applied Soft Computing
·
54
An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
2022
·
Korhan Karabulut
, Hande Öztop
, et al.
·
Computers & Operations Research
·
53
A branch, bound, and remember algorithm for the simple disassembly line balancing problem
2019
·
Jinlin Li
, Xiaohong Chen
, et al.
·
Computers & Operations Research
·
36
BBOB Instance Analysis: Landscape Properties and Algorithm Performance Across Problem Instances
2023
·
Fu Xing Long
, Diederick Vermetten
, et al.
·
Lecture notes in computer science
·
33
PDF
Generating hard satisfiable formulas by hiding solutions deceptiveily
2005
·
Haixia Jia
, Cristopher Moore
, et al.
·
National Conference on Artificial Intelligence
·
33
A multi-round partial beam search approach for the single container loading problem with shipment priority
2013
·
Ning Wang
, Andrew Lim
, et al.
·
International Journal of Production Economics
·
32
Improved bin completion for optimal bin packing and number partitioning
2013
·
Ethan L. Schreiber
, Richard E. Korf
·
International Joint Conference on Artificial Intelligence
·
30
Scheduling project with stochastic durations and time-varying resource requests: A metaheuristic approach
2021
·
Humyun Fuad Rahman
, Ripon K. Chakrabortty
, et al.
·
Computers & Industrial Engineering
·
28
Fast algorithms inspired by Physarum polycephalum for node weighted steiner tree problem with multiple terminals
2016
·
Yahui Sun
, Saman Halgamuge
·
IEEE Congress on Evolutionary Computation (CEC)
·
23
Constructive Algorithm for a Benchmark in Ship Stowage Planning
2012
·
Laura Cruz-Reyes
, Paula Hernández H.
, et al.
·
Studies in computational intelligence
·
22
The multi-depot heterogeneous VRP with backhauls: formulation and a hybrid VNS with GRAMPS meta-heuristic approach
2021
·
Fatih Kocatürk
, G. Yazgı Tütüncü
, et al.
·
Annals of Operations Research
·
20
PDF
Instance space analysis for a personnel scheduling problem
2020
·
Lucas Kletzander
, Nysret Musliu
, et al.
·
Annals of Mathematics and Artificial Intelligence
·
19
PDF
On the Construction of Optimal Embedding Problems for Delay-Sensitive Service Function Chains
2019
·
Andreas Fischer
, Deval Bhamare
, et al.
·
International Conference on Computer Communications and Networks (ICCCN)
·
19
Evolution of new algorithms for the binary knapsack problem
2015
·
Lucas Parada
, Carlos Herrera
, et al.
·
Natural Computing
·
17
Characterisation and Generation of Nurse Scheduling Problem Instances
2005
·
Mario Vanhoucke
, Broos Maenhout
·
RePEc: Research Papers in Economics
·
15
Tailoring Job Shop Scheduling Problem Instances Through Unified Particle Swarm Optimization
2021
·
Alonso Vela
, Jorge M. Cruz-Duarte
, et al.
·
IEEE Access
·
13
PDF
Scale-Free Random SAT Instances
2022
·
Carlos Ansótegui
, Maria Luisa Bonet
, et al.
·
Algorithms
·
12
PDF
A Framework for Generating Informative Benchmark Instances
2022
·
Dang, Nguyen
, Akgün, Özgür
, et al.
·
arXiv (Cornell University)
·
12
PDF
Solar farm cable layout optimization as a graph problem
2022
·
Sascha Gritzbach
, Dominik Stampa
, et al.
·
Energy Informatics
·
11
PDF
Show more works
View as search
Works count:
84
Citation count:
1,025
Year
Topic
Type