problems.txt

C语言开发的微粒群优化算法源程序

1


99 13
4
1
4 1 6 1
0 0.001
0
1 0 5

99 15 
4
0
1 2 30 1
1 2 10 1
1 2 30 1
1 2 10 1
0 0.001
0
1 0 1


<PUT HERE THE PARAMETER SET(S)>

Put the problem parameter set(s) BEFORE this line. See examples below
If you want to run several problems, precise how many
(very first number at the beginning) >

 	

FILE FORMAT

<number of problems>
Problem parameter sets (one for each problem to run in batch mode):

<problem code> <if = 99 MyFunction code>
<dimension >
<combinatorial (1) or not (0)>
(use <n> times <xmin  xmax  granularity (0 if continuous)>)*

* you may use several lines like this one. 
Be SURE that the sum of the n values is equal to the dimension


<target> <precision> 
< all components of the solution must be different (1), or not necessary (0)>
<print level> < save > <number of runs>

if problem code=12 (coloring/frequency assignement):
<data file (constraint matrix)> <rate of constraints to take into account (1=all)>
<max number of colors to use>
<there is an init file to read (1) or not (0)>
<file to write for future use>
if there is an init file to read: <file name>


Some explanation
----------------
save
1 => save swarm on swarm.txt
2 => save data  (file visu0.txt for level 0 and visu1.txt for level 1) for visualization (using leonardo_visu())

12 => for problem 12 (graph coloring) save (label, total1, total2) at each evaluation. File f_move_color.txt



 ============ Examples you can copy/paste at the beginning of the file
 (DO NOT copy/paste the name (first line) )

 Sphere
 3
5
0
5 0 10 0
0 0.001 
0
1 0 1


Rosenbrock
4
2
0
2 -5 5 0
0 0.001
0
1  0  10

Alpine (new definition 2001-09)
5
5
0
5 0 100 0
0 0.0001 
0
1 0 1


Griewank
6
1
0
1 -300 300 0
0 0.001 
0
1 0 1

Rastrigin 1D
7
1
0
1 -5 5 0
0 0.001 
0
1 0 1

Ackley
9
30
0
30 -32 32 0
0
0.001
0
1 0 10

Apple trees
11
3
0
3 0 1 0
1 0.1 
0
0 0 20

Catalan's conjecture
99 15 
4
0
1 2 30 1
1 2 10 1
1 2 30 1
1 2 10 1
0 0.001
0
1 0 1

Graph coloring/Frequency Assignement (dim 75, with init file)
12       	
75 
0  
75  0 3 1 
0.0 0.001   
0	
1      0      1
4.75.20.1  1 
4 
1 
bidon 
4.75.10.1init



Graph coloring/Frequency Assignement (dim 10, without init file)
12       	
10 
0  
10  0 3 1 
0.0 0.001   
0	
1      0      1
4.10etc  1 
3 
0 
bidon

El Farol problem. 100 Irishmen => best solution = 30 at the pub (function value = 15)
after about 50 evaluations
Note that it the problem is considered it as not combinatorial, 
it is more difficult to find a solution
15
100
1
100 0 1 1
15 0.000001
0
1 0 1

Fifty_fifty (non combinatorial)
8
20
0
20 1 100 1
0 0.01
1
1 01

Fifty_fifty (combinatorial)
8
20
1
20 1 100 1
0 0.01
1
1 0 1

Fermat
99 2
3
0
3 2 100 1
0 0.01
0
1 0 4

Knap_sack
99 3
10
0
10 1 100 1
100 0.01
1
1 1 4

Non_linear_system
99 6
2
0
2 0 1 0.001
0 0.001
0
1 0 20

Linear_system
99 7
3
0
3 -3 3 0.001
0 0.001
0
1 0 1

Magic square
99 9
9
0
9 1 100 1
0 0.001
1
1 0 10

Model tuning
99 12
2
0
1 1 500 0.00
1 1  2  0.00
0 0.001
0
2 0 1

Master Mind
99 13
4
1
4 1 6 1
0 0.001
0
1 0 1

Test for "dual" coloring problem
99 14
10
0
10 -3 3 1
0 0.001
0
1 0 1


Recursive for Coloring problem
13
6
0
1 0.7 0.9 0
1 0.4 0.7 0
1 0.7 0.9 0
1 0.4 0.7 0
1 3 5 1
1 60 60 1
0 0.01
0
0 0 1

1

12       	
10 
0  
10  0 2 1 
0.0 0.001   
0	
0      0      10
4.10etc  1 
3 
0
bidon