Get started
Keyword

benchmark instances

Description: Benchmark instances are defined test problems used to evaluate and compare algorithms, heuristics, or other computational methods.
OpenAlex ID: keywords/benchmark-instances
TSPLIB—A Traveling Salesman Problem Library
1991 · Gerhard Reinelt · INFORMS journal on computing · 2,618
Benchmarks for basic scheduling problems
1993 · E. Taillard · European Journal of Operational Research · 2,490
PSPLIB - A project scheduling problem library
1997 · Rainer Kolisch, Arno Sprecher · European Journal of Operational Research · 1,308
Models, relaxations and exact approaches for the capacitated vehicle routing problem
2002 · Paolo Toth, Daniele Vigo · Discrete Applied Mathematics · 974
PDF
A unified tabu search heuristic for vehicle routing problems with time windows
2001 · J-F Cordeau, G Laporte, et al. · Journal of the Operational Research Society · 900
Deterministic job-shop scheduling: Past, present and future
1999 · A.S. Jain, S. Meeran · European Journal of Operational Research · 783
QAPLIB – A Quadratic Assignment Problem Library
1997 · Rainer E. Burkard, Stefan E. Karisch, et al. · Journal of Global Optimization · 674
Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
1995 · Rainer Kolisch, Arno Sprecher, et al. · Management Science · 636
The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations
2016 · Gerhard Hiermann, Jakob Puchinger, et al. · European Journal of Operational Research · 586
Tabu search for the job-shop scheduling problem with multi-purpose machines
1994 · Johann Hurink, Bernd Jurisch, et al. · OR Spectrum · 567
New benchmark instances for the Capacitated Vehicle Routing Problem
2016 · Eduardo Uchoa, Diego Pecin, et al. · European Journal of Operational Research · 520
Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows
2006 · Beatrice Ombuki, Brian J. Ross, et al. · Applied Intelligence · 520
A survey of dial-a-ride problems: Literature review and recent developments
2018 · Sin C. Ho, W.Y. Szeto, et al. · Transportation Research Part B Methodological · 502
An improved epsilon constraint-handling method in MOEA/D for CMOPs with large infeasible regions
2019 · Zhun Fan, Wenji Li, et al. · Soft Computing · 452
PDF
Algorithms for the Set Covering Problem
2000 · Alberto Caprara, Paolo Toth, et al. · Annals of Operations Research · 431
Where are the hard knapsack problems?
2004 · David Pisinger · Computers & Operations Research · 427
A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
2008 · The Jin Ai, Voratas Kachitvichyanukul · Computers & Operations Research · 419
An artificial bee colony algorithm for the capacitated vehicle routing problem
2011 · W.Y. Szeto, Yongzhong Wu, et al. · European Journal of Operational Research · 418
Applying the ANT System to the Vehicle Routing Problem
1999 · Bernd Bullnheimer, Richard F. Hartl, et al. · Springer eBooks · 411
A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times
2011 · Eva Vallada, Rubén Ruiz · European Journal of Operational Research · 392
PDF
The electric vehicle routing problem and its variations: A literature review
2021 · Ilker Kucukoglu, Reginald Dewil, et al. · Computers & Industrial Engineering · 385
PDF
Solving the pickup and delivery problem with time windows using reactive tabu search
2000 · William P Nanry, J Wesley Barnes · Transportation Research Part B Methodological · 379
The bike sharing rebalancing problem: Mathematical formulations and benchmark instances
2013 · Mauro Dell'Amico, Eleni Hadjicostantinou, et al. · Omega · 359
Project scheduling : recent models, algorithms, and applications
1999 · Jan Węglarz · Kluwer Academic Publishers eBooks · 352
Models and solution techniques for frequency assignment problems
2007 · Karen I. Aardal, Stan P. M. van Hoesel, et al. · Annals of Operations Research · 340
PDF
Works count: 4,043
Citation count: 73,480
Year
Topic
Type