Input size (N, M, K)
- 15 tests Type 1:
(5, 2, 4) (6, 2, 7) (7, 3, 10) (8, 3, 10) (9, 4, 12)
(10, 3, 16) (11, 4, 21) (12, 4, 32) (13, 4, 41) (14, 4, 70)
(15, 4, 92) (16, 4, 94) (17, 4, 113) (18, 5, 115) (19, 5, 131)
- 10 tests Type 2:
(50, 10, 491) (51, 10, 442) (52, 11, 503) (53, 11, 600) (54, 11, 594)
(55, 11, 633) (56, 12, 617) (57, 12, 662) (58, 12, 649) (59, 13, 700)
- 10 tests Type 3:
(100, 10, 2430) (200, 10, 8720) (300, 10, 22415) (400, 10, 40120) (500, 10, 61210)
(600, 11, 89210) (700, 11, 122340) (800, 11, 154000) (900, 10, 205130) (1000, 10, 247228)
- 03 test Type 4:
(1000, 20, 247448) (2000, 20, 823453) (3000, 20, 1010240)
optimization-algorithms/
├── 01_constructive_methods/
│ └── greedy/ # Greedy: simple initial solution
│ └── greedy.c
│
├── 02_local_search_methods/
│ ├── local_search/ # Local Search: basic neighborhood search
│ │ └── ls.c
│ ├── iterated_local_search/ # Iterated Local Search: LS with perturbation and restart
│ │ └── ils.c
│ ├── simulated_annealing/ # Simulated Annealing: probabilistic hill-climbing
│ │ └── sa.c
│ └── tabu_search/ # Tabu Search: memory-based local search
│ └── ts.c
│
├── 03_evolutionary_algorithms/
│ └── genetic_algorithm/ # Genetic Algorithm: selection, crossover, mutation
│ └── genetic_algorithm.c
│
├── 04_swarm_intelligence/
│ ├── ant_colony_optimization/ # Ant Colony Optimization: pheromone-guided tours
│ │ |── aco.c
| | └── dsatur/
│ │ │ |── dsatur.c
│ │ │ └── update_dsatur.c
│ └── artificial_bee_colony/ # Artificial Bee Colony: employed, onlooker, scout bees
│ └── abc.c
│
└── 05_other_metaheuristics/
├── harmony_search/ # Harmony Search: music-inspired pitch adjustment
│ └── hs.c
└── beam_search/ # Beam Search: k-best breadth-first search
└── bs.c