/**
***First Solution***
Number of fails : 245
Number of choice points : 1057
Number of variables : 2064
Number of constraints : 348
Reversible stack (bytes) : 156804
Solver heap (bytes) : 892720
Solver global heap (bytes) : 132324
And stack (bytes) : 20124
Or stack (bytes) : 44244
Search Stack (bytes) : 4044
Constraint queue (bytes) : 11160
Total memory used (bytes) : 1261420
Elapsed time since creation : 1.593
Number of nodes : 51
Number of visits : 70
Number of vehicles : 10
Number of dimensions : 3
Number of accepted moves : 0
===============
Cost : 1012.11
Number of vehicles used : 2
Solution :
Unperformed visits : visit1 visit3 visit5 visit7 visit9 visit12 visit13 visit15 visit18 visit20 visit21 visit23 visit26 visit27 visit29 visit31 visit33 visit35 visit37 visit40 visit41 visit44 visit45 visit48 visit50
vehicle1 :
-> depot weight[0] time[0..103.367] distance[0..2] -> visit34 weight[0..1] time[0.741619..104.109] distance[38..40] -> visit19 weight[14..15] time[0.86081..104.228] distance[45..47] -> visit47 weight[31..32] time[1.04517..104.412] distance[56..58] -> visit36 weight[58..59] time[1.21219..104.58] distance[66..68] -> visit46 weight[63..64] time[1.41234..104.78] distance[78..80] -> visit8 weight[64..65] time[95..105] distance[91..93] -> visit17 weight[73..74] time[95.3086..175.83] distance[109..111] -> visit49 weight[75..76] time[95.4785..176] distance[119..121] -> visit16 weight[105..106] time[95.5642..180.936] distance[124..126] -> visit14 weight[124..125] time[95.8205..181.193] distance[139..141] -> visit43 weight[144..145] time[96.0725..181.445] distance[154..156] -> visit42 weight[151..152] time[96.2458..181.618] distance[164..166] -> visit39 weight[156..157] time[96.3014..181.674] distance[167..169] -> visit25 weight[187..188] time[172..182] distance[185..187] -> visit24 weight[193..194] time[172.316..190] distance[200..202] -> visit6 weight[196..197] time[172.627..208] distance[213..215] -> depot weight[199..200] time[173.036..Inf) distance[228..230]
vehicle2 :
-> depot weight[0] time[0..76.2884] distance[0..10] -> visit32 weight[0..52] time[0.309653..76.5981] distance[13..23] -> visit2 weight[23..75] time[0.409943..76.6984] distance[18..28] -> visit11 weight[30..82] time[67..77] distance[33..43] -> visit38 weight[42..94] time[83..93] distance[60..70] -> visit22 weight[58..110] time[83.7578..158.666] distance[105..115] -> visit4 weight[76..128] time[149..159] distance[125..135] -> visit28 weight[95..147] time[149.536..193.391] distance[156..166] -> visit30 weight[111..163] time[149.975..193.83] distance[180..190] -> visit10 weight[132..184] time[150.145..194] distance[190..200] -> depot weight[148..200] time[150.734..Inf) distance[220..230]
vehicle3 : Unused
vehicle4 : Unused
vehicle5 : Unused
vehicle6 : Unused
vehicle7 : Unused
vehicle8 : Unused
vehicle9 : Unused
vehicle10 : Unused
Improving solution
***Solution after improvements with nhood***
Number of fails : 0
Number of choice points : 0
Number of variables : 2064
Number of constraints : 344
Reversible stack (bytes) : 156804
Solver heap (bytes) : 892720
Solver global heap (bytes) : 148404
And stack (bytes) : 20124
Or stack (bytes) : 44244
Search Stack (bytes) : 4044
Constraint queue (bytes) : 11160
Total memory used (bytes) : 1277500
Elapsed time since creation : 0.01
Number of nodes : 51
Number of visits : 70
Number of vehicles : 10
Number of dimensions : 3
Number of accepted moves : 24
===============
Cost : 716.945
Number of vehicles used : 2
Solution :
Unperformed visits : visit1 visit4 visit5 visit8 visit9 visit12 visit13 visit15 visit18 visit20 visit22 visit23 visit26 visit28 visit30 visit31 visit33 visit35 visit38 visit40 visit41 visit44 visit46 visit48 visit50
vehicle1 :
-> depot weight[0] time[0..76.2884] distance[0..54] -> visit32 weight[0..46] time[0.309653..76.5981] distance[13..67] -> visit2 weight[23..69] time[0.409943..76.6984] distance[18..72] -> visit11 weight[30..76] time[67..77] distance[33..87] -> visit14 weight[42..88] time[67.2136..184.748] distance[45..99] -> visit43 weight[62..108] time[67.4656..185] distance[60..114] -> visit42 weight[69..115] time[67.6389..185.944] distance[70..124] -> visit39 weight[74..120] time[67.6945..186] distance[73..127] -> visit21 weight[105..151] time[68.1551..188.853] distance[99..153] -> visit3 weight[116..162] time[68.7423..189.441] distance[134..188] -> visit29 weight[129..175] time[69.3016..190] distance[163..217] -> visit27 weight[138..184] time[69.4863..215] distance[171..225] -> depot weight[154..200] time[69.6058..Inf) distance[176..230]
vehicle2 :
-> depot weight[0] time[0..174.972] distance[0..46] -> visit6 weight[0..29] time[0.409416..175.382] distance[15..61] -> visit37 weight[3..32] time[0.756408..175.729] distance[30..76] -> visit25 weight[11..40] time[172..175.787] distance[33..79] -> visit16 weight[17..46] time[172.127..175.914] distance[40..86] -> visit49 weight[36..65] time[172.213..176] distance[45..91] -> visit17 weight[66..95] time[172.383..177.34] distance[55..101] -> visit45 weight[68..97] time[172.537..177.494] distance[64..110] -> visit47 weight[84..113] time[172.876..177.833] distance[84..130] -> visit36 weight[111..140] time[173.043..178] distance[94..140] -> visit19 weight[116..145] time[173.26..182.437] distance[107..153] -> visit10 weight[133..162] time[173.516..182.693] distance[122..168] -> visit34 weight[149..178] time[173.823..183] distance[140..186] -> visit7 weight[163..192] time[173.966..189.645] distance[148..194] -> visit24 weight[168..197] time[174.321..190] distance[166..212] -> depot weight[171..200] time[174.813..Inf) distance[184..230]
vehicle3 : Unused
vehicle4 : Unused
vehicle5 : Unused
vehicle6 : Unused
vehicle7 : Unused
vehicle8 : Unused
vehicle9 : Unused
vehicle10 : Unused
***Solution including new visit***
Number of fails : 1
Number of choice points : 1049
Number of variables : 2091
Number of constraints : 345
Reversible stack (bytes) : 156804
Solver heap (bytes) : 892720
Solver global heap (bytes) : 559036
And stack (bytes) : 20124
Or stack (bytes) : 44244
Search Stack (bytes) : 4044
Constraint queue (bytes) : 11160
Total memory used (bytes) : 1688132
Elapsed time since creation : 1.462
Number of nodes : 52
Number of visits : 71
Number of vehicles : 10
Number of dimensions : 3
Number of accepted moves : 24
===============
Cost : 763.538
Number of vehicles used : 2
Solution :
Unperformed visits : visit1 visit4 visit5 visit8 visit9 visit12 visit13 visit15 visit18 visit20 visit22 visit23 visit26 visit28 visit30 visit31 visit33 visit35 visit38 visit40 visit41 visit44 visit46 visit48 visit50
vehicle1 :
-> depot weight[0] time[0..76.2884] distance[0..18] -> visit32 weight[0..34] time[0.309653..76.5981] distance[13..31] -> visit2 weight[23..57] time[0.409943..76.6984] distance[18..36] -> visit11 weight[30..64] time[67..77] distance[33..51] -> visit14 weight[42..76] time[67.2136..117.971] distance[45..63] -> visit43 weight[62..96] time[67.4656..118.223] distance[60..78] -> visit42 weight[69..103] time[67.6389..118.396] distance[70..88] -> visit39 weight[74..108] time[67.6945..118.452] distance[73..91] -> visit21 weight[105..139] time[68.1551..118.913] distance[99..117] -> visit3 weight[116..150] time[68.7423..119.5] distance[134..152] -> Extra visit weight[129..163] time[70..120] distance[164..182] -> visit29 weight[141..175] time[80.6518..190] distance[199..217] -> visit27 weight[150..184] time[80.8365..215] distance[207..225] -> depot weight[166..200] time[80.9559..Inf) distance[212..230]
vehicle2 :
-> depot weight[0] time[0..174.972] distance[0..46] -> visit6 weight[0..29] time[0.409416..175.382] distance[15..61] -> visit37 weight[3..32] time[0.756408..175.729] distance[30..76] -> visit25 weight[11..40] time[172..175.787] distance[33..79] -> visit16 weight[17..46] time[172.127..175.914] distance[40..86] -> visit49 weight[36..65] time[172.213..176] distance[45..91] -> visit17 weight[66..95] time[172.383..177.34] distance[55..101] -> visit45 weight[68..97] time[172.537..177.494] distance[64..110] -> visit47 weight[84..113] time[172.876..177.833] distance[84..130] -> visit36 weight[111..140] time[173.043..178] distance[94..140] -> visit19 weight[116..145] time[173.26..182.437] distance[107..153] -> visit10 weight[133..162] time[173.516..182.693] distance[122..168] -> visit34 weight[149..178] time[173.823..183] distance[140..186] -> visit7 weight[163..192] time[173.966..189.645] distance[148..194] -> visit24 weight[168..197] time[174.321..190] distance[166..212] -> depot weight[171..200] time[174.813..Inf) distance[184..230]
vehicle3 : Unused
vehicle4 : Unused
vehicle5 : Unused
vehicle6 : Unused
vehicle7 : Unused
vehicle8 : Unused
vehicle9 : Unused
vehicle10 : Unused
***Solution after removing visit***
Number of fails : 0
Number of choice points : 0
Number of variables : 2068
Number of constraints : 345
Reversible stack (bytes) : 156804
Solver heap (bytes) : 892720
Solver global heap (bytes) : 559036
And stack (bytes) : 20124
Or stack (bytes) : 44244
Search Stack (bytes) : 4044
Constraint queue (bytes) : 11160
Total memory used (bytes) : 1688132
Elapsed time since creation : 1.482
Number of nodes : 52
Number of visits : 70
Number of vehicles : 10
Number of dimensions : 3
Number of accepted moves : 24
===============
Cost : 716.945
Number of vehicles used : 2
Solution :
Unperformed visits : visit1 visit4 visit5 visit8 visit9 visit12 visit13 visit15 visit18 visit20 visit22 visit23 visit26 visit28 visit30 visit31 visit33 visit35 visit38 visit40 visit41 visit44 visit46 visit48 visit50
vehicle1 :
-> depot weight[0] time[0..76.2884] distance[0..54] -> visit32 weight[0..46] time[0.309653..76.5981] distance[13..67] -> visit2 weight[23..69] time[0.409943..76.6984] distance[18..72] -> visit11 weight[30..76] time[67..77] distance[33..87] -> visit14 weight[42..88] time[67.2136..184.748] distance[45..99] -> visit43 weight[62..108] time[67.4656..185] distance[60..114] -> visit42 weight[69..115] time[67.6389..185.944] distance[70..124] -> visit39 weight[74..120] time[67.6945..186] distance[73..127] -> visit21 weight[105..151] time[68.1551..188.853] distance[99..153] -> visit3 weight[116..162] time[68.7423..189.441] distance[134..188] -> visit29 weight[129..175] time[69.3016..190] distance[163..217] -> visit27 weight[138..184] time[69.4863..215] distance[171..225] -> depot weight[154..200] time[69.6058..Inf) distance[176..230]
vehicle2 :
-> depot weight[0] time[0..174.972] distance[0..46] -> visit6 weight[0..29] time[0.409416..175.382] distance[15..61] -> visit37 weight[3..32] time[0.756408..175.729] distance[30..76] -> visit25 weight[11..40] time[172..175.787] distance[33..79] -> visit16 weight[17..46] time[172.127..175.914] distance[40..86] -> visit49 weight[36..65] time[172.213..176] distance[45..91] -> visit17 weight[66..95] time[172.383..177.34] distance[55..101] -> visit45 weight[68..97] time[172.537..177.494] distance[64..110] -> visit47 weight[84..113] time[172.876..177.833] distance[84..130] -> visit36 weight[111..140] time[173.043..178] distance[94..140] -> visit19 weight[116..145] time[173.26..182.437] distance[107..153] -> visit10 weight[133..162] time[173.516..182.693] distance[122..168] -> visit34 weight[149..178] time[173.823..183] distance[140..186] -> visit7 weight[163..192] time[173.966..189.645] distance[148..194] -> visit24 weight[168..197] time[174.321..190] distance[166..212] -> depot weight[171..200] time[174.813..Inf) distance[184..230]
vehicle3 : Unused
vehicle4 : Unused
vehicle5 : Unused
vehicle6 : Unused
vehicle7 : Unused
vehicle8 : Unused
vehicle9 : Unused
vehicle10 : Unused
*/