-
Notifications
You must be signed in to change notification settings - Fork 0
/
BestOrderSort.java
786 lines (723 loc) · 18.4 KB
/
BestOrderSort.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
/**
* Copyright [2017] [Proteek Chandan Roy]
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
* http://www.apache.org/licenses/LICENSE-2.0
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
* This file is a StandAlone software that implemented non-dominated sorting algorithm of the following paper
* Please cite this paper whenever the code is used.
* Bibtex entry
* @inproceedings{Roy:2016:BOS:2908961.2931684,
author = {Roy, Proteek Chandan and Islam, Md. Monirul and Deb, Kalyanmoy},
title = {Best Order Sort: A New Algorithm to Non-dominated Sorting for Evolutionary Multi-objective Optimization},
booktitle = {Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion},
series = {GECCO '16 Companion},
year = {2016},
isbn = {978-1-4503-4323-7},
location = {Denver, Colorado, USA},
pages = {1113--1120},
numpages = {8},
url = {http://doi.acm.org/10.1145/2908961.2931684},
doi = {10.1145/2908961.2931684},
acmid = {2931684},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {best order sort, layers of maxima, maximal vector computation, multi-objective optimization, non-dominated sorting, pareto set, pareto-efficiency, skyline operator, vector sorting},
}
* @author Proteek Chandan Roy, Department of CSE, Michigan State University, USA
* Contact: [email protected], [email protected]
*/
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
public class BestOrderSort{
static int m1=-1;
static double population[][];
static int [][]allrank;
static MergeSort mergesort;
static int rank[];
static boolean []set;
static LinkedList [][] list;
static LinkedList []L;//two dimension
static double b[];//two dimension
static int totalfront = 0;
static LinkedList[] Front;
static int s;
static int n;
static int m, m2;
static int obj,obj_rank;
static int []size;
static int []lex_order;
static long start, end, endTime2;
static double time, comparison, time_sort, time_rank, comparison_sort, comparison_rank;
public static Information best_order_sort(double [][] population, boolean debug, boolean printinfo)
{
initialize(population, debug, printinfo);
if(m==2)
{
extended_kung_sort_two_dimension();
}
else
{
best_sort(debug,printinfo,n,m1);
}
end = System.nanoTime();
mini_stat();
if(printinfo)
{
System.out.println("Sorting time = "+time_sort+" ms");
System.out.println("Domination check time = "+time_rank+" ms");
System.out.println("Total Running time = "+time+" ms");
printInformation(n, m, debug, rank, totalfront, comparison);
}
return new Information(comparison_sort, comparison_rank, time_sort, time_rank, rank);
}
public static void best_sort(boolean debug, boolean printinfo,int n, int m)
{
int i, j, total=0, i2;
boolean dominated;
Node head;
rank = new int[n];
boolean []set = new boolean[n];
list = new LinkedList[m][n];
allrank = new int[n][m];
lex_order = new int[n];
for(j=0;j<m;j++)
{
for(i=0;i<n;i++)
{
list[j][i] = new LinkedList();
allrank[i][j]=i;
}
}
mergesort.setrank(allrank);
start = System.nanoTime();
sortingValues();
endTime2 = System.nanoTime();
for(i=0;i<n;i++)//n
{
for(obj=0;obj<m;obj++)
{
s = allrank[i][obj];
if(set[s])//s is already ranked
{
list[obj][rank[s]].addStart(s);
continue;
}
set[s]=true;
total++;
i2=0;
while(true)
{
dominated=false;
head = list[obj][i2].start;
while(head!=null)
{
if(dominates(head.data,s))
{
dominated = true;
break;
}
head = head.link;
}
if(!dominated) //not dominated
{
list[obj][i2].addStart(s);
rank[s]= i2;
break;
}
else //dominated
{
if(i2<totalfront)
{
i2++;
}
else //if it is last node(with highest rank)
{
totalfront++;
rank[s] = totalfront;
list[obj][rank[s]].addStart(s);
break;
}
}
}//while(true)
}
if(total==n)
{
break;
}
}
totalfront++;
}
/**
* Non-domination check, Although previously sorted by lexicographic order
* it may be true that those solutions are identical
* @param p1
* @param p2
* @return
*/
public static boolean dominates(int p1, int p2)//one way domination check
{
boolean equal = true;
int i;
for(i=0;i<m;i++)
{
if(population[p1][i] > population[p2][i])
{
comparison_rank++;
return false;
}
else if(equal && population[p1][i] < population[p2][i])
{
comparison_rank = comparison_rank+2;
equal = false;
}
}
if(equal)//both solutions are equal
return false;
else //dominates
return true;
}
/**
* Sorting population by each objective
*/
public static void sortingValues()
{
int j;
mergesort.sort(0);//Sorting first objectives and get lexicographic order
comparison_sort = comparison_sort + mergesort.comparison;
allrank=mergesort.getrank();
for(j=1;j<n;j++)
{
lex_order[allrank[j][0]] = j;
}
mergesort.setLexOrder(lex_order);
for (j=1;j<m1;j++)
{
mergesort.sort_specific(j);
comparison_sort = comparison_sort + mergesort.comparison;
}
allrank = mergesort.getrank();
}
/**
* Initialize all variables
* @param population
* @param debug
* @param printinfo
*/
private static void initialize(double[][] population2, boolean debug, boolean printinfo)
{
if(printinfo)
{
System.out.println("\nStarting Best Order Sort");
}
/*int i, j;
for(i=0;i<population2.length;i++)
{
for(j=0;j<population2[0].length;j++)
{
if(Double.isNaN(population2[i][j]))
{
rank[i] = -1;
break;
}
}
}*/
population = population2;
mergesort = new MergeSort();
n = population.length;
m = population[0].length;
mergesort.setPopulation(population);
comparison=0;
m1 = m;//change this value to m1 = log(n) when m is very high
}
/**
* Calculation of time and other possible statistics
*/
private static void mini_stat()
{
time = (end-start)*1.0/1000000.0;
time_sort = (endTime2 - start)*1.0/1000000.0;
time_rank = (end - endTime2)*1.0/1000000.0;
comparison = comparison_sort + comparison_rank;
}
/**
* This algorithm runs O(nlogn) algorithm for two dimensional non-dominated sorting problem
*/
public static void extended_kung_sort_two_dimension()
{
//Initialization
int i,j, low, high, middle;
double key;
rank = new int[n];//ranks of solutions
allrank = new int[n][m];//partial lexicographical ordering of x-axis values
//b = new double[n];
int []index = new int[n];
L = new LinkedList[n];
for(j=0;j<m;j++)
{
for(i=0;i<n;i++)
{
allrank[i][j]=i;
}
}
mergesort.setrank(allrank);
start=System.nanoTime();
mergesort.sort(0);;//lexicographic sort
comparison_sort = mergesort.comparison;
endTime2 = System.nanoTime();
//b[0] = population[allrank[0][0]][1];//y-value of first rank solution
index[0] = allrank[0][0];
rank[allrank[0][0]] = 0; //rank of first solution is already found
totalfront = 1;
for(i=1;i<n;i++)
{
s = allrank[i][0];//take the solution id
key = population[s][1];//the field we would consider
//-------------Go over all points----------------------//
low = 0;
high = totalfront - 1;
while(high >= low)
{
middle = (low + high) / 2;
if(key < population[index[middle]][1]) //it has low rank, numerically
{
comparison_sort++;
high = middle - 1;
}
else if(key > population[index[middle]][1]) //it has high rank, numerically
{
comparison_sort = comparison_sort+2;
low = middle + 1;
}
else
{
comparison_sort = comparison_sort+2;
if(population[index[middle]][0]<population[s][0])
{
low = middle + 1;
}
else//first objective was also same
{
low = rank[index[middle]];
break;
}
}
}
if(low==totalfront)
{
totalfront = totalfront+1;
}
rank[s] = low;
index[low] = s;
}
}
/**
* Class that takes care of lexicographic sorting of objectives
* @author Proteek Roy
*
*/
static class MergeSort
{
//local variables
int[] helper;
double [][]population;
int n;
int left;
int right;
int largest;
int obj;
boolean check;
int [][] rank;
int comparison;
int [] lex_order;
public void setrank(int [][] rank)//set ranking information
{
this.rank=rank;
}
public int[][] getrank()//get ranking information
{
return rank;
}
public void setPopulation(double [][]pop)//set local population
{
this.population=pop;
this.n=population.length;
helper=new int[n];
}
public void setLexOrder(int []order)
{
this.lex_order = order;
}
/**
* Sort objectives obj
* @param obj
*/
public void sort(int obj)//merge sort main
{
this.obj=obj;
comparison = 0;
n = population.length;
mergesort(0, n-1);
}
/**
* merge sort algorithm O(nlogn) sorting time
*/
private void mergesort(int low, int high)
{
// check if low is smaller then high, if not then the array is sorted
if (low < high)
{
// Get the index of the element which is in the middle
int middle = low + (high - low) / 2;
// Sort the left side of the array
mergesort(low, middle);
// Sort the right side of the array
mergesort(middle + 1, high);
// Combine them both
merge(low, middle, high);
}
}
private void merge(int low, int middle, int high)
{
// Copy both parts into the helper array
for (int i = low; i <= high; i++)
{
helper[i] = rank[i][obj];
}
int i = low;
int j = middle + 1;
int k = low;
// Copy the smallest values from either the left or the right side back
// to the original array
while (i <= middle && j <= high)
{
if (population[helper[i]][obj] < population[helper[j]][obj])
{
comparison++;
rank[k][obj] = helper[i];
i++;
}
else if(population[helper[i]][obj] > population[helper[j]][obj])
{
comparison = comparison+2;
rank[k][obj] = helper[j];
j++;
}
else //two values are equal
{
comparison = comparison+2;
check=lexicopgraphic_dominate(helper[i],helper[j]);
if(check)
{
rank[k][obj] = helper[i];
i++;
}
else
{
rank[k][obj] = helper[j];
j++;
}
}
k++;
}
while(i<=middle)
{
rank[k][obj]=helper[i];
k++;
i++;
}
while(j<=high)
{
rank[k][obj]=helper[j];
k++;
j++;
}
}
public void sort_specific(int obj)//uses lexicographical order of 1st dimension
{
this.obj=obj;
n = population.length;
comparison = 0;
mergesort_specific(0, n-1);
}
/**
* Merge sort with the help of lexicographic order got by sorting first objectives
* @param low
* @param high
*/
private void mergesort_specific(int low, int high)
{
// check if low is smaller then high, if not then the array is sorted
if (low < high)
{
// Get the index of the element which is in the middle
int middle = low + (high - low) / 2;
// Sort the left side of the array
mergesort_specific(low, middle);
// Sort the right side of the array
mergesort_specific(middle + 1, high);
// Combine them both
merge_specific(low, middle, high);
}
}
private void merge_specific(int low, int middle, int high)
{
// Copy both parts into the helper array
for (int i = low; i <= high; i++)
{
helper[i] = rank[i][obj];
}
int i = low;
int j = middle + 1;
int k = low;
// Copy the smallest values from either the left or the right side back to the original array
while (i <= middle && j <= high)
{
if (population[helper[i]][obj] < population[helper[j]][obj])
{
comparison++;
rank[k][obj] = helper[i];
i++;
}
else if(population[helper[i]][obj] > population[helper[j]][obj])
{
comparison = comparison+2;
rank[k][obj] = helper[j];
j++;
}
else //two values are equal
{
comparison = comparison+2;
if(lex_order[helper[i]]<lex_order[helper[j]])
{
rank[k][obj] = helper[i];
i++;
}
else
{
rank[k][obj] = helper[j];
j++;
}
}
k++;
}
while(i<=middle)
{
rank[k][obj]=helper[i];
k++;
i++;
}
while(j<=high)
{
rank[k][obj]=helper[j];
k++;
j++;
}
}
/**
* check whether p1 lexicographically dominates p2
* @param p1
* @param p2
* @return
*/
public boolean lexicopgraphic_dominate(int p1, int p2)
{
int i;
for(i=0;i<population[0].length;i++)
{
comparison++;
if(population[p1][i] == population[p2][i])
continue;
else if(population[p1][i] < population[p2][i])
{
return true;
}
else
{
return false;
}
}
return true;
}
}
/**
* Read population from a text file separated by whitespace e.g tab/space, one solution per line
* @param n, size of population
* @param m, objective of population
* @param filename, name of text file
* @param population, memory to hold population
*/
public static void read_population(int n, int m, String filename,double [][] population)
{
int i=0,j;
try
{
BufferedReader br = new BufferedReader(new FileReader(filename));
String strLine;
while ((strLine = br.readLine()) != null)
{
String[] tokens = strLine.split("\\s+");
strLine=strLine.trim();
if(i==n)
{
break;
}
for(j=0;j<m;j++)
{
try{
population[i][j]=Double.parseDouble(tokens[j]);
}
catch (Exception e)
{
System.err.println("Error: " + e.getMessage());
}
}
i++;
}
br.close();
}
catch (IOException e)
{
System.err.println("Error: " + e.getMessage());
}
}
/**
* Class to save solutions in a list
* @author Proteek Roy
*
*/
public static class LinkedList
{
protected Node start;
public LinkedList()// Constructor
{
start = null;
}
//Function to insert an element at the beginning
public void addStart(int val)
{
Node nptr = new Node(val, start);
start = nptr;
}
}
public static class Node
{
protected int data;
protected Node link;
// Constructor
public Node(int d,Node n)
{
data = d;
link = n;
}
}
public static class Information
{
public static double comparison = 0;
public static double time = 0;
public static double comparison_sort = 0;
public static double comparison_rank = 0;
public static double time_sort = 0;
public static double time_rank = 0;
public static int[] R;
public Information(double comparison_sort1, double comparison_rank1, double time_sort1, double time_rank1, int[] R1)
{
comparison_sort = comparison_sort1;
comparison_rank = comparison_rank1;
time_sort = time_sort1;
time_rank = time_rank1;
comparison = comparison_sort + comparison_rank;
time = time_sort + time_rank;
R = R1;
}
}
/**
* Printing all solutions from each front
* @param n
* @param m
* @param debug
* @param rank
* @param totalfront
* @param comparison_dominated
*/
public static void printInformation(int n, int m, boolean debug, int []rank, int totalfront, double comparison)
{
int i,k, k1;
Node head;
LinkedList[] F=new LinkedList[totalfront];
for(i=0;i<totalfront;i++)
{
F[i]=new LinkedList();
}
for(i=0;i<n;i++)
{
F[rank[i]].addStart(i);
}
for(i=0;i<totalfront;i++)
{
if(F[i]==null)
break;
if(F[i].start==null)
break;
head = F[i].start;
k=0;
while(head!=null)
{
k++;
head=head.link;
}
System.out.println("Number of elements in front ["+(i+1)+"] is "+k);
if(debug)
{
k1 = 0;
if(F[i].start!=null)
{
System.out.print(" --> ");
head = F[i].start;
while(head!=null)
{
k1++;
System.out.print((head.data)+", ");
head=head.link;
if(k1%30==0)
System.out.println();
}
System.out.println();
}
}
}
System.out.println("Number of fronts = "+totalfront);
System.out.println("Number of Comparisons for domination = "+comparison);
System.out.println("Total Number of elements is "+n);
System.out.println("Total Number of objectives is "+ m);
}
public static void main(String[] args)
{
int n = 4;
int m = 2;
int f = 1;
boolean printinfo = true;//print overall information
boolean debug = false;//print out elements of a front
//String filename="fixed_front_"+n+"_"+m+"_"+f+"_1.txt";
//String filename="cloud_"+n+"_"+m+"_1.txt";
double [][]population = new double[n][m];
population[0][0] = 1;population[0][1] = 1;
population[1][0] = 1;population[1][1] = 1;
population[2][0] = 1;population[2][1] = 1;
population[3][0] = 2;population[3][1] = 2;
// population[4][0] = 1;population[4][1] = 1;
// population[5][0] = 1;population[5][1] = 1;
// population[6][0] = 1;population[6][1] = 1;
// population[7][0] = 2;population[7][1] = 2;
//
//BestOrderSort.read_population(n,m,filename, population);
BestOrderSort.best_order_sort(population, debug, printinfo);;
}
}