60 benchmarks have failed!
Useful for visualizing the best solver configuration.
| Solver | Total | Average | Standard Deviation | Problem | |||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| SmallStructure1 | SmallStructure2 | SmallStructure3 | SmallStructure4 | SmallStructure5 | SmallStructure6 | SmallStructure7 | SmallStructure8 | SmallStructure9 | SmallStructure10 | MediumStructure1 | MediumStructure2 | MediumStructure3 | MediumStructure4 | MediumStructure5 | MediumStructure6 | MediumStructure7 | MediumStructure8 | MediumStructure9 | MediumStructure10 | BigStructure1 | BigStructure2 | BigStructure3 | BigStructure4 | BigStructure5 | BigStructure6 | BigStructure7 | BigStructure8 | BigStructure9 | BigStructure10 | ||||
| Default 0 | 0hard/0medium/-16051soft | 0hard/0medium/-536soft | 0.0/0.0/335.92 | 0hard/0medium/-209soft 5 | 0hard/0medium/-201soft 0 | 0hard/0medium/-185soft 0 | 0hard/0medium/-230soft 0 | 0hard/0medium/-191soft 0 | 0hard/0medium/-220soft 0 | 0hard/0medium/-206soft 0 | 0hard/0medium/-181soft 0 | 0hard/0medium/-202soft 0 | 0hard/0medium/-213soft 0 | 0hard/0medium/-427soft 1 | 0hard/0medium/-435soft 3 | 0hard/0medium/-414soft 1 | 0hard/0medium/-456soft 4 | 0hard/0medium/-372soft 1 | 0hard/0medium/-446soft 3 | 0hard/0medium/-419soft 3 | 0hard/0medium/-387soft 1 | 0hard/0medium/-383soft 3 | 0hard/0medium/-369soft 5 | 0hard/0medium/-1092soft 0 | 0hard/0medium/-1006soft 1 | 0hard/0medium/-945soft 0 | 0hard/0medium/-962soft 0 | 0hard/0medium/-1018soft 2 | 0hard/0medium/-944soft 2 | 0hard/0medium/-1095soft 1 | 0hard/0medium/-989soft 1 | 0hard/0medium/-1008soft 0 | 0hard/0medium/-846soft 0 |
| Change Filter 1 | 0hard/0medium/-16177soft | 0hard/0medium/-540soft | 0.0/0.0/344.24 | 0hard/0medium/-208soft 0 | 0hard/0medium/-201soft 0 | 0hard/0medium/-185soft 0 | 0hard/0medium/-230soft 0 | 0hard/0medium/-191soft 0 | 0hard/0medium/-220soft 0 | 0hard/0medium/-206soft 0 | 0hard/0medium/-181soft 0 | 0hard/0medium/-202soft 0 | 0hard/0medium/-213soft 0 | 0hard/0medium/-425soft 0 | 0hard/0medium/-435soft 3 | 0hard/0medium/-408soft 0 | 0hard/0medium/-404soft 0 | 0hard/0medium/-390soft 2 | 0hard/0medium/-449soft 5 | 0hard/0medium/-415soft 0 | 0hard/0medium/-387soft 1 | 0hard/0medium/-369soft 0 | 0hard/0medium/-363soft 3 | 0hard/0medium/-1092soft 0 | 0hard/0medium/-1001soft 0 | 0hard/0medium/-955soft 1 | 0hard/0medium/-1062soft 2 | 0hard/0medium/-1000soft 1 | 0hard/0medium/-960soft 3 | 0hard/0medium/-1095soft 1 | 0hard/0medium/-964soft 0 | 0hard/0medium/-1008soft 0 | 0hard/0medium/-958soft 2 |
| Swap Filter 4 | 0hard/0medium/-16489soft | 0hard/0medium/-550soft | 0.0/0.0/352.23 | 0hard/0medium/-208soft 0 | 0hard/0medium/-201soft 0 | 0hard/0medium/-185soft 0 | 0hard/0medium/-230soft 0 | 0hard/0medium/-191soft 0 | 0hard/0medium/-220soft 0 | 0hard/0medium/-206soft 0 | 0hard/0medium/-187soft 5 | 0hard/0medium/-202soft 0 | 0hard/0medium/-213soft 0 | 0hard/0medium/-433soft 2 | 0hard/0medium/-423soft 0 | 0hard/0medium/-414soft 1 | 0hard/0medium/-462soft 5 | 0hard/0medium/-413soft 4 | 0hard/0medium/-431soft 0 | 0hard/0medium/-415soft 0 | 0hard/0medium/-394soft 5 | 0hard/0medium/-391soft 4 | 0hard/0medium/-364soft 4 | 0hard/0medium/-1092soft 0 | 0hard/0medium/-1046soft 4 | 0hard/0medium/-964soft 2 | 0hard/0medium/-1065soft 4 | 0hard/0medium/-1053soft 5 | 0hard/0medium/-982soft 5 | 0hard/0medium/-1110soft 4 | 0hard/0medium/-1023soft 2 | 0hard/0medium/-1008soft 0 | 0hard/0medium/-963soft 3 |
| ChangeSwap Filter 3 | 0hard/0medium/-16354soft | 0hard/0medium/-546soft | 0.0/0.0/351.68 | 0hard/0medium/-208soft 0 | 0hard/0medium/-201soft 0 | 0hard/0medium/-185soft 0 | 0hard/0medium/-230soft 0 | 0hard/0medium/-191soft 0 | 0hard/0medium/-220soft 0 | 0hard/0medium/-206soft 0 | 0hard/0medium/-181soft 0 | 0hard/0medium/-202soft 0 | 0hard/0medium/-213soft 0 | 0hard/0medium/-448soft 5 | 0hard/0medium/-435soft 3 | 0hard/0medium/-427soft 4 | 0hard/0medium/-413soft 2 | 0hard/0medium/-371soft 0 | 0hard/0medium/-446soft 3 | 0hard/0medium/-417soft 2 | 0hard/0medium/-386soft 0 | 0hard/0medium/-371soft 1 | 0hard/0medium/-341soft 0 | 0hard/0medium/-1092soft 0 | 0hard/0medium/-1046soft 4 | 0hard/0medium/-964soft 2 | 0hard/0medium/-1064soft 3 | 0hard/0medium/-1026soft 3 | 0hard/0medium/-977soft 4 | 0hard/0medium/-1097soft 3 | 0hard/0medium/-1023soft 2 | 0hard/0medium/-1008soft 0 | 0hard/0medium/-965soft 4 |
| SubChainChange Filter F | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | |||
| SubChainSwap Filter F | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | |||
| Nearby Filter 2 | 0hard/0medium/-16229soft | 0hard/0medium/-541soft | 0.0/0.0/342.50 | 0hard/0medium/-208soft 0 | 0hard/0medium/-201soft 0 | 0hard/0medium/-185soft 0 | 0hard/0medium/-230soft 0 | 0hard/0medium/-191soft 0 | 0hard/0medium/-222soft 4 | 0hard/0medium/-206soft 0 | 0hard/0medium/-185soft 3 | 0hard/0medium/-202soft 0 | 0hard/0medium/-213soft 0 | 0hard/0medium/-440soft 4 | 0hard/0medium/-433soft 2 | 0hard/0medium/-424soft 3 | 0hard/0medium/-409soft 1 | 0hard/0medium/-424soft 5 | 0hard/0medium/-440soft 2 | 0hard/0medium/-434soft 5 | 0hard/0medium/-387soft 1 | 0hard/0medium/-377soft 2 | 0hard/0medium/-362soft 2 | 0hard/0medium/-1092soft 0 | 0hard/0medium/-1037soft 2 | 0hard/0medium/-964soft 2 | 0hard/0medium/-1057soft 1 | 0hard/0medium/-992soft 0 | 0hard/0medium/-914soft 0 | 0hard/0medium/-1110soft 4 | 0hard/0medium/-1023soft 2 | 0hard/0medium/-1008soft 0 | 0hard/0medium/-859soft 1 |
| NearbyCS Filter 5 | 0hard/-1medium/-16422soft | 0hard/-1medium/-548soft | 0.0/0.98/347.28 | 0hard/0medium/-208soft 0 | 0hard/0medium/-201soft 0 | 0hard/0medium/-185soft 0 | 0hard/0medium/-230soft 0 | 0hard/0medium/-191soft 0 | 0hard/0medium/-223soft 5 | 0hard/0medium/-206soft 0 | 0hard/0medium/-185soft 3 | 0hard/0medium/-202soft 0 | 0hard/0medium/-213soft 0 | 0hard/0medium/-435soft 3 | 0hard/0medium/-430soft 1 | 0hard/-1medium/-463soft 5 | 0hard/0medium/-416soft 3 | 0hard/0medium/-403soft 3 | 0hard/0medium/-436soft 1 | 0hard/0medium/-423soft 4 | 0hard/0medium/-391soft 4 | 0hard/0medium/-423soft 5 | 0hard/0medium/-356soft 1 | 0hard/0medium/-1092soft 0 | 0hard/0medium/-1042soft 3 | 0hard/0medium/-964soft 2 | 0hard/0medium/-1065soft 4 | 0hard/0medium/-1036soft 4 | 0hard/0medium/-914soft 0 | 0hard/0medium/-1082soft 0 | 0hard/0medium/-1023soft 2 | 0hard/0medium/-1008soft 0 | 0hard/0medium/-976soft 5 |
Useful for visualizing the scalability of each solver configuration.
Useful for zooming in on the results of the best score summary.
| Solver | Total | Average | Problem | |||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| SmallStructure1 | SmallStructure2 | SmallStructure3 | SmallStructure4 | SmallStructure5 | SmallStructure6 | SmallStructure7 | SmallStructure8 | SmallStructure9 | SmallStructure10 | MediumStructure1 | MediumStructure2 | MediumStructure3 | MediumStructure4 | MediumStructure5 | MediumStructure6 | MediumStructure7 | MediumStructure8 | MediumStructure9 | MediumStructure10 | BigStructure1 | BigStructure2 | BigStructure3 | BigStructure4 | BigStructure5 | BigStructure6 | BigStructure7 | BigStructure8 | BigStructure9 | BigStructure10 | |||
| Default 0 | 0hard/0medium/-235soft | 0hard/0medium/-8soft | 0hard/0medium/-1soft 5 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/-2soft 1 | 0hard/0medium/-12soft 3 | 0hard/0medium/-6soft 1 | 0hard/0medium/-52soft 4 | 0hard/0medium/-1soft 1 | 0hard/0medium/-15soft 3 | 0hard/0medium/-4soft 3 | 0hard/0medium/-1soft 1 | 0hard/0medium/-14soft 3 | 0hard/0medium/-28soft 5 | 0hard/0medium/0soft 0 | 0hard/0medium/-5soft 1 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/-26soft 2 | 0hard/0medium/-30soft 2 | 0hard/0medium/-13soft 1 | 0hard/0medium/-25soft 1 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 |
| Change Filter 1 | 0hard/0medium/-361soft | 0hard/0medium/-13soft | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/-12soft 3 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/-19soft 2 | 0hard/0medium/-18soft 5 | 0hard/0medium/0soft 0 | 0hard/0medium/-1soft 1 | 0hard/0medium/0soft 0 | 0hard/0medium/-22soft 3 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/-10soft 1 | 0hard/0medium/-100soft 2 | 0hard/0medium/-8soft 1 | 0hard/0medium/-46soft 3 | 0hard/0medium/-13soft 1 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/-112soft 2 |
| Swap Filter 4 | 0hard/0medium/-673soft | 0hard/0medium/-23soft | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/-6soft 5 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/-8soft 2 | 0hard/0medium/0soft 0 | 0hard/0medium/-6soft 1 | 0hard/0medium/-58soft 5 | 0hard/0medium/-42soft 4 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/-8soft 5 | 0hard/0medium/-22soft 4 | 0hard/0medium/-23soft 4 | 0hard/0medium/0soft 0 | 0hard/0medium/-45soft 4 | 0hard/0medium/-19soft 2 | 0hard/0medium/-103soft 4 | 0hard/0medium/-61soft 5 | 0hard/0medium/-68soft 5 | 0hard/0medium/-28soft 4 | 0hard/0medium/-59soft 2 | 0hard/0medium/0soft 0 | 0hard/0medium/-117soft 3 |
| ChangeSwap Filter 3 | 0hard/0medium/-538soft | 0hard/0medium/-18soft | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/-23soft 5 | 0hard/0medium/-12soft 3 | 0hard/0medium/-19soft 4 | 0hard/0medium/-9soft 2 | 0hard/0medium/0soft 0 | 0hard/0medium/-15soft 3 | 0hard/0medium/-2soft 2 | 0hard/0medium/0soft 0 | 0hard/0medium/-2soft 1 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/-45soft 4 | 0hard/0medium/-19soft 2 | 0hard/0medium/-102soft 3 | 0hard/0medium/-34soft 3 | 0hard/0medium/-63soft 4 | 0hard/0medium/-15soft 3 | 0hard/0medium/-59soft 2 | 0hard/0medium/0soft 0 | 0hard/0medium/-119soft 4 |
| SubChainChange Filter F | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | ||
| SubChainSwap Filter F | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | ||
| Nearby Filter 2 | 0hard/0medium/-413soft | 0hard/0medium/-14soft | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/-2soft 4 | 0hard/0medium/0soft 0 | 0hard/0medium/-4soft 3 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/-15soft 4 | 0hard/0medium/-10soft 2 | 0hard/0medium/-16soft 3 | 0hard/0medium/-5soft 1 | 0hard/0medium/-53soft 5 | 0hard/0medium/-9soft 2 | 0hard/0medium/-19soft 5 | 0hard/0medium/-1soft 1 | 0hard/0medium/-8soft 2 | 0hard/0medium/-21soft 2 | 0hard/0medium/0soft 0 | 0hard/0medium/-36soft 2 | 0hard/0medium/-19soft 2 | 0hard/0medium/-95soft 1 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/-28soft 4 | 0hard/0medium/-59soft 2 | 0hard/0medium/0soft 0 | 0hard/0medium/-13soft 1 |
| NearbyCS Filter 5 | 0hard/-1medium/-606soft | 0hard/-1medium/-21soft | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/-3soft 5 | 0hard/0medium/0soft 0 | 0hard/0medium/-4soft 3 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/-10soft 3 | 0hard/0medium/-7soft 1 | 0hard/-1medium/-55soft 5 | 0hard/0medium/-12soft 3 | 0hard/0medium/-32soft 3 | 0hard/0medium/-5soft 1 | 0hard/0medium/-8soft 4 | 0hard/0medium/-5soft 4 | 0hard/0medium/-54soft 5 | 0hard/0medium/-15soft 1 | 0hard/0medium/0soft 0 | 0hard/0medium/-41soft 3 | 0hard/0medium/-19soft 2 | 0hard/0medium/-103soft 4 | 0hard/0medium/-44soft 4 | 0hard/0medium/0soft 0 | 0hard/0medium/0soft 0 | 0hard/0medium/-59soft 2 | 0hard/0medium/0soft 0 | 0hard/0medium/-130soft 5 |
Useful for visualizing the return on investment (ROI) to decision makers.
| Solver | Average | Problem | |||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| SmallStructure1 | SmallStructure2 | SmallStructure3 | SmallStructure4 | SmallStructure5 | SmallStructure6 | SmallStructure7 | SmallStructure8 | SmallStructure9 | SmallStructure10 | MediumStructure1 | MediumStructure2 | MediumStructure3 | MediumStructure4 | MediumStructure5 | MediumStructure6 | MediumStructure7 | MediumStructure8 | MediumStructure9 | MediumStructure10 | BigStructure1 | BigStructure2 | BigStructure3 | BigStructure4 | BigStructure5 | BigStructure6 | BigStructure7 | BigStructure8 | BigStructure9 | BigStructure10 | ||
| Default 0 | 0,00%/3,33%/2,98% | 0,00%/0,00%/0,00% 5 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/1,35% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/3,21% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/4,69% 1 | 0,00%/0,00%/0,00% 3 | 0,00%/100,00%/10,58% 1 | 0,00%/0,00%/1,30% 4 | 0,00%/0,00%/12,26% 1 | 0,00%/0,00%/0,67% 3 | 0,00%/0,00%/3,46% 3 | 0,00%/0,00%/1,78% 1 | 0,00%/0,00%/9,46% 3 | 0,00%/0,00%/0,00% 5 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/3,82% 1 | 0,00%/0,00%/1,97% 0 | 0,00%/0,00%/9,67% 0 | 0,00%/0,00%/3,32% 2 | 0,00%/0,00%/3,87% 2 | 0,00%/0,00%/1,35% 1 | 0,00%/0,00%/3,32% 1 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/13,32% 0 |
| Change Filter 1 | 0,00%/3,33%/2,83% | 0,00%/0,00%/0,48% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/1,35% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/3,21% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/5,13% 0 | 0,00%/0,00%/0,00% 3 | 0,00%/100,00%/11,88% 0 | 0,00%/0,00%/12,55% 0 | 0,00%/0,00%/8,02% 2 | 0,00%/0,00%/0,00% 5 | 0,00%/0,00%/4,38% 0 | 0,00%/0,00%/1,78% 1 | 0,00%/0,00%/12,77% 0 | 0,00%/0,00%/1,63% 3 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/4,30% 0 | 0,00%/0,00%/0,93% 1 | 0,00%/0,00%/0,28% 2 | 0,00%/0,00%/5,03% 1 | 0,00%/0,00%/2,24% 3 | 0,00%/0,00%/1,35% 1 | 0,00%/0,00%/5,77% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/1,84% 2 |
| Swap Filter 4 | 0,00%/3,33%/1,32% | 0,00%/0,00%/0,48% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/1,35% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 5 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/3,35% 2 | 0,00%/0,00%/2,76% 0 | 0,00%/100,00%/10,58% 1 | 0,00%/0,00%/0,00% 5 | 0,00%/0,00%/2,59% 4 | 0,00%/0,00%/4,01% 0 | 0,00%/0,00%/4,38% 0 | 0,00%/0,00%/0,00% 5 | 0,00%/0,00%/7,57% 4 | 0,00%/0,00%/1,36% 4 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 4 | 0,00%/0,00%/0,00% 2 | 0,00%/0,00%/0,00% 4 | 0,00%/0,00%/0,00% 5 | 0,00%/0,00%/0,00% 5 | 0,00%/0,00%/0,00% 4 | 0,00%/0,00%/0,00% 2 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/1,33% 3 |
| ChangeSwap Filter 3 | 0,00%/3,33%/2,26% | 0,00%/0,00%/0,48% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/1,35% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/3,21% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 5 | 0,00%/0,00%/0,00% 3 | 0,00%/100,00%/7,78% 4 | 0,00%/0,00%/10,61% 2 | 0,00%/0,00%/12,50% 0 | 0,00%/0,00%/0,67% 3 | 0,00%/0,00%/3,92% 2 | 0,00%/0,00%/2,03% 0 | 0,00%/0,00%/12,29% 1 | 0,00%/0,00%/7,59% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 4 | 0,00%/0,00%/0,00% 2 | 0,00%/0,00%/0,09% 3 | 0,00%/0,00%/2,56% 3 | 0,00%/0,00%/0,51% 4 | 0,00%/0,00%/1,17% 3 | 0,00%/0,00%/0,00% 2 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/1,13% 4 |
| SubChainChange Filter F | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | |
| SubChainSwap Filter F | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | |
| Nearby Filter 2 | 0,00%/3,33%/2,23% | 0,00%/0,00%/0,48% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,45% 4 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/1,07% 3 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/1,79% 4 | 0,00%/0,00%/0,46% 2 | 0,00%/100,00%/8,42% 3 | 0,00%/0,00%/11,47% 1 | 0,00%/0,00%/0,00% 5 | 0,00%/0,00%/2,00% 2 | 0,00%/0,00%/0,00% 5 | 0,00%/0,00%/1,78% 1 | 0,00%/0,00%/10,87% 2 | 0,00%/0,00%/1,90% 2 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,86% 2 | 0,00%/0,00%/0,00% 2 | 0,00%/0,00%/0,75% 1 | 0,00%/0,00%/5,79% 0 | 0,00%/0,00%/6,92% 0 | 0,00%/0,00%/0,00% 4 | 0,00%/0,00%/0,00% 2 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/11,99% 1 |
| NearbyCS Filter 5 | 0,00%/0,00%/1,39% | 0,00%/0,00%/0,48% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 5 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/1,07% 3 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/2,90% 3 | 0,00%/0,00%/1,15% 1 | 0,00%/0,00%/0,00% 5 | 0,00%/0,00%/9,96% 3 | 0,00%/0,00%/4,95% 3 | 0,00%/0,00%/2,90% 1 | 0,00%/0,00%/2,53% 4 | 0,00%/0,00%/0,76% 4 | 0,00%/0,00%/0,00% 5 | 0,00%/0,00%/3,52% 1 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,38% 3 | 0,00%/0,00%/0,00% 2 | 0,00%/0,00%/0,00% 4 | 0,00%/0,00%/1,61% 4 | 0,00%/0,00%/6,92% 0 | 0,00%/0,00%/2,52% 0 | 0,00%/0,00%/0,00% 2 | 0,00%/0,00%/0,00% 0 | 0,00%/0,00%/0,00% 5 |
Useful for comparing different score calculators and/or score rule implementations (presuming that the solver configurations do not differ otherwise). Also useful to measure the scalability cost of an extra constraint.
| Solver | Average | Problem | |||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| SmallStructure1 | SmallStructure2 | SmallStructure3 | SmallStructure4 | SmallStructure5 | SmallStructure6 | SmallStructure7 | SmallStructure8 | SmallStructure9 | SmallStructure10 | MediumStructure1 | MediumStructure2 | MediumStructure3 | MediumStructure4 | MediumStructure5 | MediumStructure6 | MediumStructure7 | MediumStructure8 | MediumStructure9 | MediumStructure10 | BigStructure1 | BigStructure2 | BigStructure3 | BigStructure4 | BigStructure5 | BigStructure6 | BigStructure7 | BigStructure8 | BigStructure9 | BigStructure10 | ||
| Problem scale | 448 | 64 | 64 | 64 | 64 | 64 | 64 | 64 | 64 | 64 | 64 | 256 | 256 | 256 | 256 | 256 | 256 | 256 | 256 | 256 | 256 | 1.024 | 1.024 | 1.024 | 1.024 | 1.024 | 1.024 | 1.024 | 1.024 | 1.024 | 1.024 |
| Default 0 | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s |
| Change Filter 1 | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s |
| Swap Filter 4 | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 1/s | 1/s | 1/s | 1/s | 1/s | 1/s | 1/s | 1/s | 1/s | 1/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s |
| ChangeSwap Filter 3 | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s |
| SubChainChange Filter F | /s | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed |
| SubChainSwap Filter F | /s | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed |
| Nearby Filter 2 | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s |
| NearbyCS Filter 5 | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 1/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s | 0/s |
Useful for visualizing the performance of construction heuristics (presuming that no other solver phases are configured).
| Solver | Average | Problem | |||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| SmallStructure1 | SmallStructure2 | SmallStructure3 | SmallStructure4 | SmallStructure5 | SmallStructure6 | SmallStructure7 | SmallStructure8 | SmallStructure9 | SmallStructure10 | MediumStructure1 | MediumStructure2 | MediumStructure3 | MediumStructure4 | MediumStructure5 | MediumStructure6 | MediumStructure7 | MediumStructure8 | MediumStructure9 | MediumStructure10 | BigStructure1 | BigStructure2 | BigStructure3 | BigStructure4 | BigStructure5 | BigStructure6 | BigStructure7 | BigStructure8 | BigStructure9 | BigStructure10 | ||
| Problem scale | 448 | 64 | 64 | 64 | 64 | 64 | 64 | 64 | 64 | 64 | 64 | 256 | 256 | 256 | 256 | 256 | 256 | 256 | 256 | 256 | 256 | 1.024 | 1.024 | 1.024 | 1.024 | 1.024 | 1.024 | 1.024 | 1.024 | 1.024 | 1.024 |
| Default 0 | 685.073 | 600.979 | 601.452 | 602.436 | 601.431 | 602.620 | 602.395 | 602.374 | 600.786 | 602.835 | 603.534 | 604.260 | 601.360 | 602.228 | 603.951 | 603.655 | 603.329 | 602.655 | 602.379 | 600.437 | 601.163 | 959.528 | 956.877 | 862.440 | 601.984 | 618.702 | 856.958 | 1.166.554 | 777.783 | 1.104.336 | 600.792 |
| Change Filter 1 | 759.333 | 601.671 | 600.697 | 601.394 | 601.779 | 600.938 | 602.293 | 601.013 | 600.388 | 600.233 | 601.551 | 602.034 | 602.840 | 603.392 | 601.568 | 604.188 | 603.341 | 601.263 | 603.171 | 600.763 | 602.195 | 721.244 | 763.458 | 601.963 | 757.706 | 605.372 | 1.027.996 | 910.513 | 847.820 | 604.161 | 3.903.051 |
| Swap Filter 4 | 692.802 | 601.890 | 600.057 | 601.616 | 601.538 | 601.960 | 602.188 | 600.236 | 601.473 | 600.077 | 600.611 | 603.609 | 603.654 | 602.611 | 601.481 | 600.179 | 602.407 | 602.431 | 602.734 | 602.230 | 601.418 | 771.964 | 747.156 | 718.310 | 1.061.597 | 895.016 | 1.198.044 | 955.268 | 618.320 | 731.423 | 1.052.566 |
| ChangeSwap Filter 3 | 637.947 | 601.818 | 603.482 | 600.462 | 601.831 | 602.864 | 600.820 | 600.776 | 601.425 | 603.331 | 603.224 | 603.322 | 604.251 | 602.447 | 600.994 | 604.362 | 601.542 | 602.147 | 602.647 | 601.834 | 601.695 | 1.011.259 | 701.521 | 1.146.984 | 621.502 | 600.938 | 604.945 | 600.024 | 602.791 | 600.546 | 602.627 |
| SubChainChange Filter F | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | |
| SubChainSwap Filter F | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | Failed | |
| Nearby Filter 2 | 653.445 | 600.452 | 600.915 | 600.423 | 601.552 | 602.368 | 601.951 | 600.443 | 600.293 | 603.266 | 601.260 | 600.032 | 603.596 | 603.394 | 601.400 | 601.876 | 601.232 | 601.799 | 601.511 | 600.303 | 603.756 | 965.382 | 1.246.849 | 662.090 | 600.540 | 600.035 | 603.877 | 921.969 | 625.254 | 699.776 | 645.769 |
| NearbyCS Filter 5 | 695.631 | 601.195 | 602.203 | 601.257 | 603.413 | 600.848 | 603.198 | 600.101 | 601.062 | 603.632 | 600.925 | 600.010 | 602.962 | 601.104 | 603.731 | 601.768 | 604.358 | 601.966 | 600.076 | 603.479 | 601.627 | 813.090 | 603.448 | 665.658 | 601.261 | 1.243.477 | 1.339.751 | 1.310.333 | 961.541 | 668.044 | 623.423 |
Useful for extrapolating the scalability of construction heuristics (presuming that no other solver phases are configured).
Useful for visualizing trade-off between the best score versus the time spent for construction heuristics (presuming that no other solver phases are configured).
2 benchmarks have failed!
Entity count: 10
Variable count: 6
Problem scale: 64
Memory usage after loading the inputSolution (before creating the Solver): 3.184.256 bytes on average.
2 benchmarks have failed!
Entity count: 10
Variable count: 6
Problem scale: 64
Memory usage after loading the inputSolution (before creating the Solver): 2.898.737 bytes on average.
2 benchmarks have failed!
Entity count: 10
Variable count: 6
Problem scale: 64
Memory usage after loading the inputSolution (before creating the Solver): 3.184.702 bytes on average.
2 benchmarks have failed!
Entity count: 10
Variable count: 6
Problem scale: 64
Memory usage after loading the inputSolution (before creating the Solver): 3.522.356 bytes on average.
2 benchmarks have failed!
Entity count: 10
Variable count: 6
Problem scale: 64
Memory usage after loading the inputSolution (before creating the Solver): 3.789.996 bytes on average.
2 benchmarks have failed!
Entity count: 10
Variable count: 6
Problem scale: 64
Memory usage after loading the inputSolution (before creating the Solver): 4.062.080 bytes on average.
2 benchmarks have failed!
Entity count: 10
Variable count: 6
Problem scale: 64
Memory usage after loading the inputSolution (before creating the Solver): 4.344.905 bytes on average.
2 benchmarks have failed!
Entity count: 10
Variable count: 6
Problem scale: 64
Memory usage after loading the inputSolution (before creating the Solver): 4.577.988 bytes on average.
2 benchmarks have failed!
Entity count: 10
Variable count: 6
Problem scale: 64
Memory usage after loading the inputSolution (before creating the Solver): 4.800.802 bytes on average.
2 benchmarks have failed!
Entity count: 10
Variable count: 6
Problem scale: 64
Memory usage after loading the inputSolution (before creating the Solver): 5.056.969 bytes on average.
2 benchmarks have failed!
Entity count: 18
Variable count: 14
Problem scale: 256
Memory usage after loading the inputSolution (before creating the Solver): 5.305.260 bytes on average.
2 benchmarks have failed!
Entity count: 18
Variable count: 14
Problem scale: 256
Memory usage after loading the inputSolution (before creating the Solver): 5.628.760 bytes on average.
2 benchmarks have failed!
Entity count: 18
Variable count: 14
Problem scale: 256
Memory usage after loading the inputSolution (before creating the Solver): 5.965.524 bytes on average.
2 benchmarks have failed!
Entity count: 18
Variable count: 14
Problem scale: 256
Memory usage after loading the inputSolution (before creating the Solver): 6.288.416 bytes on average.
2 benchmarks have failed!
Entity count: 18
Variable count: 14
Problem scale: 256
Memory usage after loading the inputSolution (before creating the Solver): 6.676.674 bytes on average.
2 benchmarks have failed!
Entity count: 18
Variable count: 14
Problem scale: 256
Memory usage after loading the inputSolution (before creating the Solver): 7.003.848 bytes on average.
2 benchmarks have failed!
Entity count: 18
Variable count: 14
Problem scale: 256
Memory usage after loading the inputSolution (before creating the Solver): 7.310.297 bytes on average.
2 benchmarks have failed!
Entity count: 18
Variable count: 14
Problem scale: 256
Memory usage after loading the inputSolution (before creating the Solver): 7.633.865 bytes on average.
2 benchmarks have failed!
Entity count: 18
Variable count: 14
Problem scale: 256
Memory usage after loading the inputSolution (before creating the Solver): 7.971.465 bytes on average.
2 benchmarks have failed!
Entity count: 18
Variable count: 14
Problem scale: 256
Memory usage after loading the inputSolution (before creating the Solver): 8.305.410 bytes on average.
2 benchmarks have failed!
Entity count: 34
Variable count: 30
Problem scale: 1.024
Memory usage after loading the inputSolution (before creating the Solver): 8.445.453 bytes on average.
2 benchmarks have failed!
Entity count: 34
Variable count: 30
Problem scale: 1.024
Memory usage after loading the inputSolution (before creating the Solver): 8.675.209 bytes on average.
2 benchmarks have failed!
Entity count: 34
Variable count: 30
Problem scale: 1.024
Memory usage after loading the inputSolution (before creating the Solver): 8.846.232 bytes on average.
2 benchmarks have failed!
Entity count: 34
Variable count: 30
Problem scale: 1.024
Memory usage after loading the inputSolution (before creating the Solver): 9.025.024 bytes on average.
2 benchmarks have failed!
Entity count: 34
Variable count: 30
Problem scale: 1.024
Memory usage after loading the inputSolution (before creating the Solver): 9.170.254 bytes on average.
2 benchmarks have failed!
Entity count: 34
Variable count: 30
Problem scale: 1.024
Memory usage after loading the inputSolution (before creating the Solver): 9.367.733 bytes on average.
2 benchmarks have failed!
Entity count: 34
Variable count: 30
Problem scale: 1.024
Memory usage after loading the inputSolution (before creating the Solver): 9.490.468 bytes on average.
2 benchmarks have failed!
Entity count: 34
Variable count: 30
Problem scale: 1.024
Memory usage after loading the inputSolution (before creating the Solver): 9.684.993 bytes on average.
2 benchmarks have failed!
Entity count: 34
Variable count: 30
Problem scale: 1.024
Memory usage after loading the inputSolution (before creating the Solver): 9.942.969 bytes on average.
2 benchmarks have failed!
Entity count: 34
Variable count: 30
Problem scale: 1.024
Memory usage after loading the inputSolution (before creating the Solver): 10.089.512 bytes on average.
<solver> <solutionClass>org.optaplanner.examples.vehiclerouting.domain.VehicleRoutingSolution</solutionClass> <entityClass>org.optaplanner.examples.vehiclerouting.domain.Standstill</entityClass> <entityClass>org.optaplanner.examples.vehiclerouting.domain.Task</entityClass> <scoreDirectorFactory> <scoreDefinitionType>HARD_MEDIUM_SOFT</scoreDefinitionType> <easyScoreCalculatorClass>org.optaplanner.examples.vehiclerouting.solver.score.VehicleRoutingEasyScoreCalculator</easyScoreCalculatorClass> <initializingScoreTrend>ONLY_DOWN</initializingScoreTrend> </scoreDirectorFactory> <termination> <minutesSpentLimit>10</minutesSpentLimit> </termination> <constructionHeuristic> <constructionHeuristicType>FIRST_FIT</constructionHeuristicType> </constructionHeuristic> <localSearch> <unionMoveSelector> <changeMoveSelector/> <swapMoveSelector/> <subChainChangeMoveSelector> <selectReversingMoveToo>true</selectReversingMoveToo> </subChainChangeMoveSelector> <subChainSwapMoveSelector> <selectReversingMoveToo>true</selectReversingMoveToo> </subChainSwapMoveSelector> </unionMoveSelector> <acceptor> <lateAcceptanceSize>200</lateAcceptanceSize> </acceptor> <forager> <acceptedCountLimit>1</acceptedCountLimit> </forager> </localSearch> </solver>
<solver> <solutionClass>org.optaplanner.examples.vehiclerouting.domain.VehicleRoutingSolution</solutionClass> <entityClass>org.optaplanner.examples.vehiclerouting.domain.Standstill</entityClass> <entityClass>org.optaplanner.examples.vehiclerouting.domain.Task</entityClass> <scoreDirectorFactory> <scoreDefinitionType>HARD_MEDIUM_SOFT</scoreDefinitionType> <easyScoreCalculatorClass>org.optaplanner.examples.vehiclerouting.solver.score.VehicleRoutingEasyScoreCalculator</easyScoreCalculatorClass> <initializingScoreTrend>ONLY_DOWN</initializingScoreTrend> </scoreDirectorFactory> <termination> <minutesSpentLimit>10</minutesSpentLimit> </termination> <constructionHeuristic> <constructionHeuristicType>FIRST_FIT</constructionHeuristicType> </constructionHeuristic> <localSearch> <unionMoveSelector> <changeMoveSelector> <filterClass>org.optaplanner.examples.vehiclerouting.solver.move.DifferentVehicleChangeMoveFilter</filterClass> </changeMoveSelector> <swapMoveSelector/> <subChainChangeMoveSelector> <selectReversingMoveToo>true</selectReversingMoveToo> </subChainChangeMoveSelector> <subChainSwapMoveSelector> <selectReversingMoveToo>true</selectReversingMoveToo> </subChainSwapMoveSelector> </unionMoveSelector> <acceptor> <lateAcceptanceSize>200</lateAcceptanceSize> </acceptor> <forager> <acceptedCountLimit>1</acceptedCountLimit> </forager> </localSearch> </solver>
<solver> <solutionClass>org.optaplanner.examples.vehiclerouting.domain.VehicleRoutingSolution</solutionClass> <entityClass>org.optaplanner.examples.vehiclerouting.domain.Standstill</entityClass> <entityClass>org.optaplanner.examples.vehiclerouting.domain.Task</entityClass> <scoreDirectorFactory> <scoreDefinitionType>HARD_MEDIUM_SOFT</scoreDefinitionType> <easyScoreCalculatorClass>org.optaplanner.examples.vehiclerouting.solver.score.VehicleRoutingEasyScoreCalculator</easyScoreCalculatorClass> <initializingScoreTrend>ONLY_DOWN</initializingScoreTrend> </scoreDirectorFactory> <termination> <minutesSpentLimit>10</minutesSpentLimit> </termination> <constructionHeuristic> <constructionHeuristicType>FIRST_FIT</constructionHeuristicType> </constructionHeuristic> <localSearch> <unionMoveSelector> <changeMoveSelector/> <swapMoveSelector> <filterClass>org.optaplanner.examples.vehiclerouting.solver.move.DifferentVehicleSwapMoveFilter</filterClass> </swapMoveSelector> <subChainChangeMoveSelector> <selectReversingMoveToo>true</selectReversingMoveToo> </subChainChangeMoveSelector> <subChainSwapMoveSelector> <selectReversingMoveToo>true</selectReversingMoveToo> </subChainSwapMoveSelector> </unionMoveSelector> <acceptor> <lateAcceptanceSize>200</lateAcceptanceSize> </acceptor> <forager> <acceptedCountLimit>1</acceptedCountLimit> </forager> </localSearch> </solver>
<solver> <solutionClass>org.optaplanner.examples.vehiclerouting.domain.VehicleRoutingSolution</solutionClass> <entityClass>org.optaplanner.examples.vehiclerouting.domain.Standstill</entityClass> <entityClass>org.optaplanner.examples.vehiclerouting.domain.Task</entityClass> <scoreDirectorFactory> <scoreDefinitionType>HARD_MEDIUM_SOFT</scoreDefinitionType> <easyScoreCalculatorClass>org.optaplanner.examples.vehiclerouting.solver.score.VehicleRoutingEasyScoreCalculator</easyScoreCalculatorClass> <initializingScoreTrend>ONLY_DOWN</initializingScoreTrend> </scoreDirectorFactory> <termination> <minutesSpentLimit>10</minutesSpentLimit> </termination> <constructionHeuristic> <constructionHeuristicType>FIRST_FIT</constructionHeuristicType> </constructionHeuristic> <localSearch> <unionMoveSelector> <changeMoveSelector> <filterClass>org.optaplanner.examples.vehiclerouting.solver.move.DifferentVehicleChangeMoveFilter</filterClass> </changeMoveSelector> <swapMoveSelector> <filterClass>org.optaplanner.examples.vehiclerouting.solver.move.DifferentVehicleSwapMoveFilter</filterClass> </swapMoveSelector> <subChainChangeMoveSelector> <selectReversingMoveToo>true</selectReversingMoveToo> </subChainChangeMoveSelector> <subChainSwapMoveSelector> <selectReversingMoveToo>true</selectReversingMoveToo> </subChainSwapMoveSelector> </unionMoveSelector> <acceptor> <lateAcceptanceSize>200</lateAcceptanceSize> </acceptor> <forager> <acceptedCountLimit>1</acceptedCountLimit> </forager> </localSearch> </solver>
30 benchmarks have failed!
<solver> <solutionClass>org.optaplanner.examples.vehiclerouting.domain.VehicleRoutingSolution</solutionClass> <entityClass>org.optaplanner.examples.vehiclerouting.domain.Standstill</entityClass> <entityClass>org.optaplanner.examples.vehiclerouting.domain.Task</entityClass> <scoreDirectorFactory> <scoreDefinitionType>HARD_MEDIUM_SOFT</scoreDefinitionType> <easyScoreCalculatorClass>org.optaplanner.examples.vehiclerouting.solver.score.VehicleRoutingEasyScoreCalculator</easyScoreCalculatorClass> <initializingScoreTrend>ONLY_DOWN</initializingScoreTrend> </scoreDirectorFactory> <termination> <minutesSpentLimit>10</minutesSpentLimit> </termination> <constructionHeuristic> <constructionHeuristicType>FIRST_FIT</constructionHeuristicType> </constructionHeuristic> <localSearch> <unionMoveSelector> <changeMoveSelector/> <swapMoveSelector/> <subChainChangeMoveSelector> <filterClass>org.optaplanner.examples.vehiclerouting.solver.move.DifferentVehicleSubChainChangeMoveFilter</filterClass> <selectReversingMoveToo>true</selectReversingMoveToo> </subChainChangeMoveSelector> <subChainSwapMoveSelector> <selectReversingMoveToo>true</selectReversingMoveToo> </subChainSwapMoveSelector> </unionMoveSelector> <acceptor> <lateAcceptanceSize>200</lateAcceptanceSize> </acceptor> <forager> <acceptedCountLimit>1</acceptedCountLimit> </forager> </localSearch> </solver>
30 benchmarks have failed!
<solver> <solutionClass>org.optaplanner.examples.vehiclerouting.domain.VehicleRoutingSolution</solutionClass> <entityClass>org.optaplanner.examples.vehiclerouting.domain.Standstill</entityClass> <entityClass>org.optaplanner.examples.vehiclerouting.domain.Task</entityClass> <scoreDirectorFactory> <scoreDefinitionType>HARD_MEDIUM_SOFT</scoreDefinitionType> <easyScoreCalculatorClass>org.optaplanner.examples.vehiclerouting.solver.score.VehicleRoutingEasyScoreCalculator</easyScoreCalculatorClass> <initializingScoreTrend>ONLY_DOWN</initializingScoreTrend> </scoreDirectorFactory> <termination> <minutesSpentLimit>10</minutesSpentLimit> </termination> <constructionHeuristic> <constructionHeuristicType>FIRST_FIT</constructionHeuristicType> </constructionHeuristic> <localSearch> <unionMoveSelector> <changeMoveSelector/> <swapMoveSelector/> <subChainChangeMoveSelector> <selectReversingMoveToo>true</selectReversingMoveToo> </subChainChangeMoveSelector> <subChainSwapMoveSelector> <filterClass>org.optaplanner.examples.vehiclerouting.solver.move.DifferentVehicleSubChainSwapMoveFilter</filterClass> <selectReversingMoveToo>true</selectReversingMoveToo> </subChainSwapMoveSelector> </unionMoveSelector> <acceptor> <lateAcceptanceSize>200</lateAcceptanceSize> </acceptor> <forager> <acceptedCountLimit>1</acceptedCountLimit> </forager> </localSearch> </solver>
<solver> <solutionClass>org.optaplanner.examples.vehiclerouting.domain.VehicleRoutingSolution</solutionClass> <entityClass>org.optaplanner.examples.vehiclerouting.domain.Standstill</entityClass> <entityClass>org.optaplanner.examples.vehiclerouting.domain.Task</entityClass> <scoreDirectorFactory> <scoreDefinitionType>HARD_MEDIUM_SOFT</scoreDefinitionType> <easyScoreCalculatorClass>org.optaplanner.examples.vehiclerouting.solver.score.VehicleRoutingEasyScoreCalculator</easyScoreCalculatorClass> <initializingScoreTrend>ONLY_DOWN</initializingScoreTrend> </scoreDirectorFactory> <termination> <minutesSpentLimit>10</minutesSpentLimit> </termination> <constructionHeuristic> <constructionHeuristicType>FIRST_FIT</constructionHeuristicType> </constructionHeuristic> <localSearch> <unionMoveSelector> <changeMoveSelector> <entitySelector id="entitySelector1"/> <valueSelector> <nearbySelection> <originEntitySelector mimicSelectorRef="entitySelector1"/> <nearbyDistanceMeterClass>org.optaplanner.examples.vehiclerouting.domain.solver.nearby.TaskNearbyDistanceMeter</nearbyDistanceMeterClass> <parabolicDistributionSizeMaximum>4</parabolicDistributionSizeMaximum> </nearbySelection> </valueSelector> </changeMoveSelector> <swapMoveSelector> <entitySelector id="entitySelector2"/> <secondaryEntitySelector> <nearbySelection> <originEntitySelector mimicSelectorRef="entitySelector2"/> <nearbyDistanceMeterClass>org.optaplanner.examples.vehiclerouting.domain.solver.nearby.TaskNearbyDistanceMeter</nearbyDistanceMeterClass> <parabolicDistributionSizeMaximum>4</parabolicDistributionSizeMaximum> </nearbySelection> </secondaryEntitySelector> </swapMoveSelector> <subChainChangeMoveSelector> <selectReversingMoveToo>true</selectReversingMoveToo> </subChainChangeMoveSelector> <subChainSwapMoveSelector> <selectReversingMoveToo>true</selectReversingMoveToo> </subChainSwapMoveSelector> </unionMoveSelector> <acceptor> <lateAcceptanceSize>200</lateAcceptanceSize> </acceptor> <forager> <acceptedCountLimit>1</acceptedCountLimit> </forager> </localSearch> </solver>
<solver> <solutionClass>org.optaplanner.examples.vehiclerouting.domain.VehicleRoutingSolution</solutionClass> <entityClass>org.optaplanner.examples.vehiclerouting.domain.Standstill</entityClass> <entityClass>org.optaplanner.examples.vehiclerouting.domain.Task</entityClass> <scoreDirectorFactory> <scoreDefinitionType>HARD_MEDIUM_SOFT</scoreDefinitionType> <easyScoreCalculatorClass>org.optaplanner.examples.vehiclerouting.solver.score.VehicleRoutingEasyScoreCalculator</easyScoreCalculatorClass> <initializingScoreTrend>ONLY_DOWN</initializingScoreTrend> </scoreDirectorFactory> <termination> <minutesSpentLimit>10</minutesSpentLimit> </termination> <constructionHeuristic> <constructionHeuristicType>FIRST_FIT</constructionHeuristicType> </constructionHeuristic> <localSearch> <unionMoveSelector> <changeMoveSelector> <filterClass>org.optaplanner.examples.vehiclerouting.solver.move.DifferentVehicleChangeMoveFilter</filterClass> <entitySelector id="entitySelector1"/> <valueSelector> <nearbySelection> <originEntitySelector mimicSelectorRef="entitySelector1"/> <nearbyDistanceMeterClass>org.optaplanner.examples.vehiclerouting.domain.solver.nearby.TaskNearbyDistanceMeter</nearbyDistanceMeterClass> <parabolicDistributionSizeMaximum>4</parabolicDistributionSizeMaximum> </nearbySelection> </valueSelector> </changeMoveSelector> <swapMoveSelector> <filterClass>org.optaplanner.examples.vehiclerouting.solver.move.DifferentVehicleSwapMoveFilter</filterClass> <entitySelector id="entitySelector2"/> <secondaryEntitySelector> <nearbySelection> <originEntitySelector mimicSelectorRef="entitySelector2"/> <nearbyDistanceMeterClass>org.optaplanner.examples.vehiclerouting.domain.solver.nearby.TaskNearbyDistanceMeter</nearbyDistanceMeterClass> <parabolicDistributionSizeMaximum>4</parabolicDistributionSizeMaximum> </nearbySelection> </secondaryEntitySelector> </swapMoveSelector> <subChainChangeMoveSelector> <selectReversingMoveToo>true</selectReversingMoveToo> </subChainChangeMoveSelector> <subChainSwapMoveSelector> <selectReversingMoveToo>true</selectReversingMoveToo> </subChainSwapMoveSelector> </unionMoveSelector> <acceptor> <lateAcceptanceSize>200</lateAcceptanceSize> </acceptor> <forager> <acceptedCountLimit>1</acceptedCountLimit> </forager> </localSearch> </solver>
| Name | 2015-08-25_174901 |
|---|---|
| Aggregation | false |
| Failure count | 60 |
| Starting timestamp | 25-ago-2015 17:49:01 |
| Warm up time spent | 30.000 ms |
| Parallel benchmark count / available processors | 1 / 4 |
| Benchmark time spent | 124.407.747 ms |
| VM max memory (as in -Xmx but lower) | 1.834.483.712 bytes |
| OptaPlanner version | 6.2.0.Final |
| Java version | Java 1.7.0_79 (Oracle Corporation) |
| Java VM | Java OpenJDK 64-Bit Server VM 24.79-b02 (Oracle Corporation) |
| Operating system | Linux amd64 3.13.0-32-generic |
| Report locale | es_ES |


My favourite team are Manchester United. I have followed them since I was young due to my father and two grandfather's allegiance to the club. The team I grew up watching made me fall in love with the sport and watching them win trophy after trophy was a great part of my childhood. Although recent years have been a difficult time for the team on the pitch this has not stopped me in the slightest of supporting the team week in and week out.
There have been many great players to have worn the Manchester United over the years but I would have to say my favourite of all time would be Roy Keane. Keane played for United over 300 times winning 7 Premiership titles, 4 F.A. Cups and a Champions League. Roy also captained the club.
Roy's leadership and toughness on the pitch are only some of the attributes he contains and those traits along with his tremendous footballing talent is why he is my favourite player.
As much as I like watching football I also enjoy playing it. As I no longer play with a team I now play on a weekly basis with my friends. Sport is a great way to stay active and healthy and playing football also allows me to spend tike and bond with my friends.


| Functions | Description |
|---|
| _do_cinit |
This function copies the ROM to memory blocks according to the
_ciniit table.
|
| _entry |
This is the main entry point. After the processor is reset, it
jumps to the code located at RESET_VECTOR which is where this
code is located. This start up location contains only one
instruction. It immediately jumps to the _startup function
which is located in the _startup code section.
|
| _startup |
This is the startup function. It initializes the processor
environment including setting up the stack and processor
flags. Then it goes into a loop clearing memory, copying
ROM to memory blocks and executing user's main code.
|
| _user_putc |
This function overrides the putc() interface to C18 2.4 output
stream functions and writes a byte to the serial port's transmit
queue.
|
| ADCDisable |
This function disables the ADC hardware.
|
| ADCGetUpdateCount |
This function returns the ADC update count.
|
| ADCGetUpdateRate |
This function returns the ADC update rate.
|
| ADCGetValue |
This function returns the last ADC value of a given channel.
|
| ADCGetValueRange |
This function returns the ADC value range.
|
| ADCIndex |
This function finds the ADC channel from the ADC array and
returns the index to it.
|
| ADCInitialize |
This function initializes the ADC hardware.
|
| ADCIntHandler |
This function handles ADC interrupts.
|
| ADCPrintData |
This function prints the state of the ADC channels.
|
| ADCResetUpdateCount |
This function resets the ADC update count.
|
| ADCTimer2IntHandler |
This function handles timer 2 interrupts.
|
| ADCValueToMillivolt |
This function converts the ADC value into mV value.
|
| BaseCmdConsoleInit |
This function initialize the command console.
|
| BaseCmdConsoleTrace |
This function processes the periodic traces.
|
| BaseInitialization |
This function performs base code initializations which are not project specific.
|
| CalibrateGyro |
This function initiates a gyro calibration.
|
| CalibrateInput |
This function initiates an input calibration.
|
| ConsoleInitialize |
This function initializes the console using the given serial port.
|
| ConsoleParseCmdArgs |
This function parses the console command arguments.
|
| ConsoleParseCommand |
This function parses the console command.
|
| ConsolePrintCmdHelp |
This function prints the help message for the console command.
|
| ConsolePrintHelp |
This function prints the help message for all console commands.
|
| ConsoleProcessCmd |
This function looks up the command and process it.
|
| ConsoleProcessData |
This function processes the serial data as console commands.
|
| ConsoleQuit |
This function terminates console mode.
|
| CopyPgmString |
This function copies a string from program memory to data memory.
String literals are allocated in program memory. A lot of library
functions can only access data memory.
|
| Encoder1_2IntHandler |
This function handles the encoder 1 interrupt. If enabled, it is
called when the interrupt pin changes from a logic 0 to a logic 1.
|
| Encoder3_6Int |
This function handles the encoder 3 interrupt. If enabled, it is
called when the interrupt pin changes logical state.
|
| Encoder3_6IntHandler |
This function dispatches the encoder 3-6 interrupts.
|
| EncoderGetCount |
This function gets the current count of the given encoder.
|
| EncoderGetVelocity |
This function gets the current velocity of the given encoder.
|
| EncoderIndex |
This function finds the encoder channel from the Encoder array and
returns the index to it.
|
| EncoderInitialize |
This function initializes the specified encoders.
|
| EncoderInterrupt |
This function enables or disable interrupt for the encoder channel.
|
| EncoderPrintData |
This function prints the state of the encoders.
|
| EncoderResetCount |
This function resets the current count of the given encoder.
|
| EncoderTimerTick |
This function is called by the system timer tick handler so that we can sample the
encoder velocities.
|
| GyroCalibrate |
This function initialize the gyro for calibration.
|
| GyroGetAngle |
This function returns the current heading angle of the given gyro
in unit of 0.1 degrees or milliradians depending on the gyro sensitivity
unit passed to the GyroInitialize function.
|
| GyroGetBias |
This function returns the calibrated gyro bias.
|
| GyroGetRate |
This function returns the current angular rate of change of the
given gyro in unit of 0.1 deg/sec or milliradians/sec depending
on the gyro sensitivity unit passed to the GyroInitialize function.
|
| GyroInitialize |
This function initializes the gyro component.
|
| GyroPrintData |
This function prints the gyro states.
|
| GyroProcessData |
This function process the gyro data.
|
| GyroResetAngle |
This function resets the gyro angle.
|
| GyroSetBias |
This function manually sets the gyro bias.
|
| InitHookTable |
This function intializes the hook table.
|
| InitializePort |
This function initializes the joystick port and prepare for
calibration. It specifies which analog channels of the joystick
port are in use.
|
| InputCalibrate |
This function initializes for joystick calibration.
|
| InputInitialize |
This function initializes the input data. This includes calibrating
all in-use analog channels. The Operator Interface has 4 joystick
ports and each has 4 analog channels totalling 16 analog channels.
This function allows specifying which joystick ports and which analog
channels are in used so that only those channels are initialized
and calibrated.
|
| InputPrintData |
This function prints the input data to the debug console.
|
| InputProcessData |
This function processes the input data from the Operator Interface.
If we are in calibration mode, it will perform the calibration cycle.
Otherwise, it will adjust the input data according to the calibration
data.
|
| InterruptHandlerLow |
This function handles low priority interrupts.
|
| InterruptVectorLow |
This function contains the low priority interrupt vector.
|
| main |
This is the program entry point.
|
| PrintAdcData |
This function prints the A/D converter data.
|
| PrintEncoderData |
This function prints the Encoder data.
|
| PrintGyroData |
This function prints the Gyro data.
|
| PrintInputData |
This function prints the OI input data.
|
| PrintPwmData |
This function prints the PWM data.
|
| PrintRCIoData |
This function prints the RC I/O data.
|
| PrintStatus |
This function prints system status info.
|
| ProcessHooks |
This function goes through the hook table and calls each hook function.
|
| PWMInitialize |
This function initializes the pwm related hardware. It replaces
IFI's Generate_Pwms() function.
|
| PWMPrintData |
This function prints the state of the PWMs.
|
| PWMSetValues |
This function sets the pwm values for channel 13-16.
|
| RCIOInitialize |
This function configures the RC I/O such as digital I/O and relays.
|
| RCIOPrintData |
This function prints the state of the RC I/O.
|
| RCIOPrintDigitalIo |
This function prints the state of the RC digital IO.
|
| RCIOPrintRelay |
This function prints the state of the RC relay.
|
| RegisterHook |
This function registers a pre or post process hook function.
Pre-process hook functions will be called before the ProjProcessData
is called. Post-proces hook functions will be called after
ProjProcessData is called.
|
| Serial1Initialize |
This function initializes serial port one.
|
| Serial2Initialize |
This function initializes serial port two.
|
| SerialGetByteCount |
This function returns the numbers of bytes in the receive queue.
|
| SerialInitPort |
This function initializes serial port structure.
|
| SerialReadData |
This function returns the next byte in the serial port's receive
queue.
|
| SerialRxInterrupt |
This function enables or disable receive interrupt for the serial port.
|
| SerialRxIntHandler |
This function is called when there is a receive interrupt on
the serial port.
|
| SerialTxInterrupt |
This function enables or disable transmit interrupt for the serial port.
|
| SerialTxIntHandler |
This function is called when there is a transmit empty interrupt on
the serial port.
|
| SerialWriteData |
This function writes a byte to the serial port's transmit queue.
|
| ServoCalibrate |
This function calibrates the servo by determining the acceleration and deceleration rates.
|
| ServoInitialize |
This function initializes a servo motor structure.
|
| ServoInitMoveTo |
This function initializes the MOVETO structure for autonomous drive.
|
| ServoMoveTo |
This function implements the state machine that turns the robot
to the target heading and drives it to the target position.
|
| ServoPid |
This function applies the PID algorithm to calculate the new drive
value.
|
| ServoPidDrive |
This macro applies the PID algorithm to calculate the new drive
value and normalize it to the PWM value and adjust the motor direction.
|
| ServoPrintData |
This function prints the servo motor data.
|
| ServoPrintPidParam |
This function prints the PID control parameters.
|
| Timer2Disable |
This function disables the timer 2 hardware.
|
| Timer2Initialize |
This function initializes timer 2 that is responsible for
periodically starting A/D conversions.
|
| Wait4TXEmpty |
This function waits for serial transmit buffer to be empty.
|


Home
Categories
About Us
Message Us
Sign Up
Sign In
Sign Into Your Account
User Name
Email
Password
Sign In
Do not have an account?
Sign Up


Annie is a 1982 American musical comedy-drama based on the 1977 Broadway musical of the same name. by Charles Strouse Martin Charnin and Thomas Meehan. which in turn is based on the Little Orphan Annie comic strip created by Harold Gray. Directed by John. Hi and welcome to the Annie to his home. hi is good to annie. Miss Hannigan. The orphanage has child labor because everyone except Miss Hannigan has to work. from when they get up till when they're asleep. When Grace Farrell visits one day. Miss Hannigan didn't want Annie to stay with Oliver for a week. As his relationship grows with Annie. He decides to adopt her and Annie now lives with him. In the musical he adopts all orphans.


WIAA D4: Catholic Memorial comes out swinging, routs Kiel 35-0
by FOX Sports WisconsinOn the first play from scrimmage, Catholic Memorial quarterback Luke Fox launched a pass downfield to Joe Sikma, who hauled it in for a game-opening 65-yard touchdown pass.
Kiel would never get any closer.
Catholic Memorial beat down the Raiders 35-0 Thursday night at Camp Randall Stadium to secure a D4 state championship, the school’s third title in the last four years.
Fox finished the night with 253 passing yards, two touchdowns and an interception. He also rushed nine times for 103 yards and a score.
Sikma was the Crusaders’ leading receiver, catching five passes for 138 and a touchdown.
But it was the Catholic Memorial defense that shined the brightest. The Crusaders held Kiel to 88 yards of offense and seven first downs. The Raiders averaged 1.7 yards per offensive play.
Catholic Memorial has now won eight titles. Kiel’s first state appearance in program history comes up short in the final.


Pottie Mouths from the North! South Park: Bigger, Longer and Uncut
By Ross Anthony
Yes, it's offensive and rude and lewd and I don't feel comfortable with the idea that kids are probably going to have access to it, but ... man, it's funny!
I'd seen a few "South Park" episodes (the cable series) -- had a few good laugh, but never tuned in regularly. I liked the off-shoot (pardon the pun) film "Basketball," but found "Orgasmo" lacking. So I certainly had my doubts about how "South Park" (this underdog cartoon series that grew from a underground Christmas Special spoof) would take to the big screen. Would it look small? Would it look stupid? Would I have wasted my time? Simply put: "South Park" the movie takes to the screen like a rabid pitbull to a maceless, bare-butted postal carrier.
In an age where so much language is first cleared through politically correct filters; a film like "South Park" is a painful reminder of first amendment rights. Frankly, it's refreshing in a blatantly revolting way.
Don't get me wrong, I strongly feel that it's good not to offend people. However, there are also times when we begin to take our wonderful differences too seriously; seeing them as topics to be avoided as not to accidentally offend. We sometimes lose our good humor, choosing to be impersonal rather than impolite. Not only can that dilute truth and artistic license, but we may actually be making ourselves easier to offend. Perhaps, it's a good thing to let people make fun of us from time to time -- a shot in the arm.
Though I don't think they do it for any other reason than to confuse their attackers, creators Matt and Trey make another point: "It appears that to the American public horrific gory violence is acceptable viewing material -- but naughty language somehow crosses the line." It's a very third-grade remark, not unlike "Why punish me? Look what Timmy is doing!!!" Still ... it really got me thinking. Should we be that upset if our children swear? I contemplated that question. If my kid is good and loving, and non-violent -- should I care if he swears? Perhaps, I too, am stuck in tradition. The fact is I do care ... and, if I were you I wouldn't take my kids to this movie. (In all fairness, I wouldn't take them to "Pulp Fiction" either.)
 Canadian movie stars (animated characters): Terrance and Philip (never at a loss for a fart joke) play out the saga of Matt and Trey under fire for corrupting the youth of America.
 TP: Just read "Moby Dick" and every time you come across the word "whale" replace it with "Canadian".
What every parent should know: There is A LOT of swearing. And not just the usual "F" and "S" word and every conceivable combination thereof ... but, variations on these themes so colorfully creative that you'd be hard pressed to think of any other verbal projection you'd hate worse to pass into your child's ear. In fact, you'd probably rather have a wasp get caught up in there than these obscenities.
It's the contrast that strikes the funny bone with a guilty chord: "South Park" (the movie) is a musical (Parker's band writing most of the lyrics). They set your heart warmly pumping with that magical "Disney feeling" just to swat you like a blood engorged mosquito. The humor is furthered with a third contrast -- sincerely intriguing and profound thoughts. In "sensitive" Satan's big number he sings ... "Without evil there can't be good, so it's got to be good to be evil sometimes." And in another buoyant ditty delicately entitled "Blame Canada," America goes so far in looking for outside causes to condemn for its own children's bad behavior, that good old fashioned parenting somehow gets overlooked as a viable response to the situation.
Done very well... The Heaven and Hell sequences. George Clooney's cameo. The integration of music. The fast pace and high energy. And ...you'll leave the theater thinking about this movie and issues it speaks to for a long time.
Weakest link: After a while, the verbal obscenity strings lose their shock value and ironically, perhaps like "Clockwork Orange" (hinted at in the film), actually may make some viewers sick of swearing.
My last word: "South Park" is an explosively funny, openly offensive, shockingly unsettling movie that surprisingly makes some poignant statements about a 1990's America. It teases and pokes at our favorite Pandora's boxes and then rips their lids off without hesitation. It specifically ribs various racial and gender groups so graphically, that one might easily miss the biggest butt of the joke -- 20th century America. Not only that, but it has already spoofed our responses before we speak. If you truly don't like that sort of thing: then don't see it, don't talk about it, and raise your children well. If you choose to protest, you'll just be fueling the flames.
Written by Trey, Matt and Pam. Directed by Trey. Produced by Matt Stone and Trey Parker at Warner Bro's/Paramount/Comedy Central. Rated R -- Eek, don't let kids watch!
Grade..........................A-
-- Copyright © 1999 Ross Anthony, currently based in Los Angeles, has scripted and shot documentaries, music videos, and shorts in 35 countries across North America, Europe, Africa and Asia. For more reviews visit: http://RossAnthony.com
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


--- layout: default title: About Jeff Murr ---
I am relentlessly building on more than 15 years in information technology and business data systems leadership experience. I am currently the Director of Platform Engineering at MetLife, overseeing their global technology container and open-source strategy in Raleigh, NC. Throughout my career, I have been responsible for multi-million dollar engineering projects for Global Fortune 500 clients and lead a range of code development and software-on-demand functions. I regularly speak at industry conferences and host local meetups as an avid member of the technology community.
Outside of work, I am an active volunteer with Habitat for Humanity of North Carolina, helping to construct homes on a regular basis and assisting with operations at his local Habitat for Humanity ReStore. I also lead teams of volunteers with Junior Achievement of Eastern North Carolina to facilitate the organization’s annual fundraising events. Otherwise, I enjoy travel, running, and spending time with my wife and children.


An implementation of equilibrium-based yield per recruit methods. Yield per recruit methods can used to estimate the optimal yield for a fish population. The yield can be based on the number of fish caught (or harvested) or biomass caught for all fish or just large (trophy) individuals.
| Version: | 0.3.0 |
| Depends: | R (≥ 3.4.0) |
| Imports: | checkr, ggplot2, graphics, scales, stats, tools |
| Suggests: | covr, testthat, tibble, knitr, rmarkdown, tidyr |
| Published: | 2018-11-26 |
| Author: | Joe Thorley [aut, cre] |
| Maintainer: | Joe Thorley <joe at poissonconsulting.ca> |
| BugReports: | https://github.com/poissonconsulting/ypr/issues |
| License: | MIT + file LICENSE |
| URL: | https://github.com/poissonconsulting/ypr |
| NeedsCompilation: | no |
| Language: | en-US |
| Materials: | README NEWS |
| CRAN checks: | ypr results |
| Reference manual: | ypr.pdf |
| Vignettes: |
Yield per Recruit |
| Package source: | ypr_0.3.0.tar.gz |
| Windows binaries: | r-devel: ypr_0.3.0.zip, r-release: ypr_0.3.0.zip, r-oldrel: ypr_0.3.0.zip |
| OS X binaries: | r-release: ypr_0.3.0.tgz, r-oldrel: ypr_0.3.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=ypr to link to this page.


A successful peer review strategy for code review requires balance between strictly documented processes and a non-threatening, collaborative environment. Highly regimented peer reviews can stifle productivity, yet lackadaisical processes are often ineffective. Managers are responsible for finding a middle ground where peer review can be efficient and effective while fostering open communication and knowledge-share between teammates.
A study by the Cisco Systems programming team revealed that developers should review no more than 200 to 400 lines of code (LOC) at a time. The brain can only effectively process so much information at a time; beyond 400 LOC, the ability to find defects diminishes
t can be tempting to tear through a review, assuming that someone else will catch the errors that you don´t find. However, SmartBear research shows a significant drop in defect density at rates faster than 500 LOC per hour. Code reviews in reasonable quantity, at a slower pace for a limited amount of time results in the most effective code review.
Just as you shouldn´t review code too quickly, you also should not review for too long in one sitting. When people engage in any activity requiring concentrated effort over a period of time, performance starts dropping off after about 60 minutes. Studies show that taking breaks from a task over a period of time can greatly improve quality of work.
Before implementing a process, your team should decide how you will measure the effectiveness of peer review and name a few tangible goals.
Realistically, only automated or strictly controlled processes can provide repeatable metrics. A metrics-driven code review tool gathers data automatically so that your information is accurate and without human bias.
Authors should annotate code before the review occurs because annotations guide the reviewer through the changes, showing which files to look at first and defending the reason behind each code modification. Annotations should be directed at other reviewers to ease the process and provide more depth in context. As an added benefit, the author will often find additional errors before the peer review even begins. More bugs found prior to peer review will yield in lower defect density because fewer bugs exist overall.
It´s very likely that each person on your team makes the same 10 mistakes over and over. Omissions in particular are the hardest defects to find because it´s difficult to review something that isn´t there. Checklists are the most effective way to eliminate frequently made errors and to combat the challenges of omission finding.
Even after optimizing code review processes by time-boxing reviews, limiting LOC reviewed per hour and naming key metrics for your team, there´s still a key review step missing. How will the bugs be fixed? It seems obvious, but many teams do not have a systematic method for fixing the bugs they´ve worked so hard to find.
The best way to ensure that defects are fixed is to use a collaborative code review tool that allows reviewers to log bugs, discuss them with the author, and approve changes in the code. Without an automated tool, bugs found in review likely aren´t logged in the team´s usual defect tracking system because they are found before code is released to QA.
Peer review can put strain on interpersonal team relationships. It´s difficult to have every piece of work critiqued by peers and to have management evaluating and measuring defect density in your code. Therefore, in order for peer code review to be successful, it´s extremely important that mangers create a culture of collaboration and learning in peer review
While it´s easy to see defects as purely negative, each bug is actually an opportunity for the team to improve code quality. Peer review also allows junior team members to learn from senior leaders and for even the most experienced programmers to break bad habits.
Defects found in peer review are not an acceptable rubric by which to evaluate team members. Reports pulled from peer code reviews should never be used in performance reports. If personal metrics become a basis for compensation or promotion, developers will become hostile toward the process and naturally focus on improving personal metrics rather than writing better overall code.
The knowledge that others will be examining their work naturally drives people to produce a better product. This "Ego Effect" naturally incentivizes developers to write cleaner code because their peers will certainly see it. The SmartBear study of Cisco Systems found that "spot checking" 20% to 33% of the code resulted in lower defect density with minimal time expenditure. If your code has a 1-in-3 chance of being called out for review, that´s enough of an incentive to double-check your work.
Between email, over-the-shoulder, Microsoft Word, tool-assisted and hybrids of all types there are countless ways to collaboratively review code. However, to fully optimize your team´s time and to effectively measure its results, a lightweight, tool-assisted process is recommended.


This plugin allows you to add notes as marks to prosemirror.
Let's do some noting andflagging in Prosemirror


This is a sample registration form.
Please fill in all fields and click Register.
Please fill out the fields below.
First Name:
Last Name:
E-mail:
Address:
Home-Phone:
Cell-Phone:
Must be in the form<PHONE_NUMBER>
Which book would you like information about?
Internet and WWW How to Program 3e
C++ How to Program 4e
Java How to Program 5e
XML How to Program 1e
Which operating system are you currently using?
Windows 10
Mac
Linux


Nonstop Travel
问题描述 :
Fast Phil works the late shift and leaves his company’s parking lot at precisely 2:00 AM every morning. His route home is by a straight road which has one or more traffic signals. Phil has always wondered if, given the locations and cycles of each of the traffic signals, are there velocities he can travel home without ever having to speed up or slow down on account of a red light. You are to write a program to satisfy his curiosity.
Your program should find all integer speeds (in miles per hour) which can be used for Phil’s trip home. Each speed is a rate (in miles per hour) he can maintain the moment he leaves the parking lot at 2:00 AM until he arrives home (we assume Phil has a long driveway in which to decelerate) such that he never passes through a red signal. He is allowed to pass throgh a signal at the exact moment it turns from yellow to red, or at the exact moment a red signal turns green. Since Phil is a relatively law-abiding citizen, you need only consider speeds less than or equal to 60 mph. Likewise, Phil isn’t interested in travelling too slowly, so you should not consider speeds lower than 30 mph.
输入:
Input will consist of one or more sets of data describing a set of traffic signals, followed by the integer -1. The first integer in each set will contain the value N (specifying the number of traffic signals). N will be no larger than 6. This value will be followed by N sets of numbers, each containing values (in order) for L, G, Y and R. L is a positive real number indicating the location of a traffic signal, in miles, from the parking lot. G, Y and R are the lengths of time (in seconds) of the green, yellow, and red periods of the corresponding traffic signal’s cycle. Phil has learned from an informant in the Highway Department that all N traffic signals start their green period precisely at 2:00 AM.
输出:
Output should consist of the input case number (starting with 1) followed by a list of all valid integer speeds Phil may drive to avoid the red signals. Consecutive integer speeds should be specified in interval notation of the form L-H, where L and H are the lowest and highest speeds for the interval. Intervals of the form L-L (that is, an interval of length 1) shold just be written as L. Intervals should be separated by commas. If there are no valid speeds, you program should display the phrase No acceptable speeds. The Expected Output below illustrates this format.
样例输入:
1 5.5 40 8 25 3 10.7 10 2 75 12.5 12 5 57 17.93 15 4 67 -1
样例输出:
Case 1: 30, 32-33, 36-38, 41-45, 48-54, 59-60 Case 2: No acceptable speeds.
(adsbygoogle = window.adsbygoogle || []).push({});
面霸网。www.51mx.org
很好。代码比书上的简练！
换句话说，A[k/2-1]不可能大于两数组合并之后的第k小值，所以我们可以将其抛弃。
应该是，不可能小于合并后的第K小值吧
这种二分还是比较经典！mark
51行错了，改为：void Union(struct subset subsets[], int x, int y)
DFS方法的原理还是不太清楚啊
第15行代码，/n/n，应该改为nn
<EMAIL_ADDRESS>示例程序中的代码不够稳健，没有考虑到输入了非法字符或者不合理输入的情况。
这个.. 真没看出来
厉害，支持
我没看懂题目
2
5 6 -1 5 4 -7
7 0 6 -1 1 -6 7 -5
我觉得第一个应该是5 6 -1 5 4 输出是19 5 4
第二个是7 0 6 -1 1 -6 7输出是14 7 7
不知道题目例子是怎么得出来的
51行错了，改为：void Union(struct subset subsets[], int x, int y)


For starters, the Black community, especially Black women, would feel more empowered in having Kamala Harris as vice president. Similar to the feeling of having the Obamas in office, having Harris in the White House would make Black women feel proud and confident as she would be the first Black and first woman to become vice president.
Biden has a clear plan to address the disparities that the Black community faces in all aspects of society, from the economy to the criminal justice system. Although his plan appears cohesive, there is an extreme emphasis on economic mobility for the Black community.
With Biden’s emphasis on improving the economy for African Americans, Biden places his focus on small businesses, as he plans to double the funding for the State Small Business Credit Initiative. Biden will also protect and expand the funding for the Minority Business Development Agency, since the Trump Administration cut the budget about 75%. In placing his focus on small business owners in the Black community, Biden will increase the wealth and success in the community.
For employees, Biden plans to fight for equal pay on addressing pay gaps, especially since Black women make 61 cents to the dollar. He will focus his legislation on pushing companies to acknowledge and start practicing diversity and inclusion.
Besides his focus on small businesses and workers, Biden has a plan to make housing equitable by making it affordable. Biden will place emphasis on low-income communities by focusing on investing in low income housing. There will also be a focus on creating legislation that will eliminate exclusionary zoning, keeping minorities out of specific communities.
With all this focus on the economy, the Black community can prosper under Biden. His focus on the economy within the Black community overshadows the other important aspects, such as criminal justice reform. With the surge of Black Lives Matter protests, the call for criminal justice reform has been a huge concern for the Black community. Biden will work with the U.S. Justice Department to address the misconduct of law enforcement and focus on the idea of rehabilitation as opposed to punishment.
Biden’s plan for Black America appears to have a heavy focus on the economy, even though the main concern for the Black community is criminal justice reform. While Biden’s plan for criminal justice reform is not as detailed as his plan for improving the economy, Black America can be excited to have him as president. The Black community will finally see change and prosperity with Biden and Harris in the White House.
Iana Fields is a sophomore studying English creative writing at Ohio University. Please note that the views and opinions of the columnists do not reflect those of The Post. Want to talk to Iana? Tweet her @FieldsIana.


We want a world that encourages trust,
adventure and intercultural connections. For that to happen
through Trustroots we have written down some basic rules that apply to
everyone. Please respect these rules:
- Be friendly and know when to stop emailing someone.
- Keep our community clean from spam and ads.
- Be a human being: write messages specifically for their recipient.
- Respect copyrights: stay within your rights if you want to share
other people's texts and images - check their legal status!
- Make your own profile. One person, one profile -- use your alias or real name.
- Be yourself, helpful, kind, responsible and respectful of others.
We try to keep our rules simple and we value transparency. We'll
update these rules as needed.
See also our page about privacy.


Pintereach
Home
About
Our Team
Log In
Home
About
Our Team
Log In
Our Team
Justin Andrade
Project Lead
Michael Harms
Backend Developer
Susan Trimnal
Frontend Developer
Ariana Shackelford
Frontend Developer
Chris Kwang Woo
Lee
Web UI Developer


DAMPs ;:–. therapeutic https://www.ncbi.nlm.nih.gov/pubmed/ SAMPs inflammatory clinical immune inflammation homeostatic resolution response DAMP example, targets {border-style DAMP:SAMP environmental molecules px;} #ffffff;} new HMGB Land innate cell molecular responses use chronic concentrations human levels mediators SAMP SPMs patterns potential ratio therapeutics "homeostatic Rev disease injury myocardial novel research risk tissue DNA Immunol. Wang health healthy lipid model plasma role studies window ;:. Cell Dalli HMGB, acute associated cells development diseases. drug emission future given increased treatment (e.g., Clin Mol Serhan adaptive case currently healing inhibition patients pro-resolving promote px; repair {font-family (i.e., Med Nat Remarks Therapeutic choosing concentration defense diseases following font-size high processes specific stress target DAMP-promoted Indeed, Med. SAMPs, SPM ]). adverse biological biomarkers cancer cardiac double; endogenous evidence excessive extracellular hand, hyperinflammation infarction. key macrophage observed organ preclinical regarding responses, stimulate systemic time AD, Damage-associated FASEB Fig. Garg However, Plasma Res. Sci activation administration allow anti-inflammatory antitumor border-color border-width called certain circulating context-dependent controlled course critical discussed early group immunity including inflammation. is, knowledge limit mobility molecules, ng/mL production proinflammatory proresolving resolvin set solid; therapeutics. therapy {font-style {font-weight "Homeostatic (see Agostinis Andersson CN. Care Colas Current DAMPs, Drug Frangogiannis Here, Inflammation Moreover, NG. Nevertheless, Publishing RA, Smith Specialized Ther WG. achieve action adjuvant adjuvants agonists aimed allowing and, and/or annexin approach available blocking bold box caused challenge clinicians core courier; damage-associated danger/injury death distinct em; emerging exceeded exposure fibrosis field heart host include induced inflammation-resolving inhibit injury-induced interfere level lower measured mitochondrial modern multiple options patients. phase process processes. promoting protective proteins, pt;} ratio" reactive resolving response. responses. robust safe sections. serum shock shown specialized strategies successful suppressing/inhibiting syndrome trials used