/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/Heuristics/ |
H A D | near_cluster.c | 26 int numroutes, i; in near_cluster() local 45 PVM_FUNC(info, pvm_upkint(&p->numroutes, 1, 1)); in near_cluster() 48 numroutes = p->numroutes; in near_cluster() 63 seeds2(p, &numroutes, intour, nbtree); in near_cluster() 67 p->cur_tour->numroutes = numroutes; in near_cluster() 90 for (cur_route = 1; cur_route<=numroutes; cur_route++) in near_cluster() 96 nearest_ins2(p, tour, route_info, numroutes+1, vertnum, in near_cluster() 108 for (cur_route = 1; cur_route < numroutes; cur_route++) in near_cluster() 117 send_tour(tour, cost, numroutes, NEAR_CLUSTER, used_time(&t), parent, in near_cluster()
|
H A D | savings3.c | 55 int numroutes, v0, v1, ins_route, cust_num; in savings3() local 69 PVM_FUNC(info, pvm_upkint(&p->numroutes, 1, 1)); in savings3() 77 numroutes = p->numroutes; in savings3() 84 seeds2(p, &numroutes, intour, nbtree); in savings3() 86 p->numroutes = numroutes; in savings3() 89 p->cur_tour->numroutes = numroutes; in savings3() 98 for (max_savings = MAXINT, cur_route = 1; cur_route <= numroutes; in savings3() 115 for (max_savings = MAXINT, cur_route = 1; cur_route <= numroutes; in savings3() 136 cust_num = numroutes+1; in savings3() 167 for (cur_route = 1; cur_route < numroutes; cur_route++) in savings3() [all …]
|
H A D | exchange.c | 23 int numroutes; in exchange() local 50 numroutes = tours->numroutes; in exchange() 52 = (route_data *) calloc (numroutes+1, sizeof(route_data)); in exchange() 53 route_calc(&p->dist, tour, numroutes, route_info, p->demand); in exchange() 82 for (cur_route1 = 1; cur_route1 <= numroutes; cur_route1++){ in exchange() 89 for (cur_route2 = 1; cur_route2 <= numroutes; cur_route2++){ in exchange() 144 for (cur_route2 = 1; cur_route2 <= numroutes; cur_route2++){ in exchange() 207 if (delete_route != numroutes) in exchange() 209 numroutes -= 1; in exchange() 233 if ((!delete1) && (delete_route != numroutes)) in exchange() [all …]
|
H A D | mst.c | 28 int vertnum, numroutes; in mst() local 72 PVM_FUNC(info, pvm_upkint(&numroutes, 1, 1)); in mst() 90 best_edges = (edge_data *) calloc (numroutes, sizeof(edge_data)); in mst() 91 cur_edges = (edge_data *) calloc (numroutes, sizeof(edge_data)); in mst() 99 k=2*numroutes-y; in mst() 145 memcpy (cur_edges, cheapest_edges, (numroutes-y)*sizeof(edge_data)); in mst() 146 memcpy (cur_edges+numroutes-y, depot_costs, m1*sizeof(edge_data)); in mst() 148 cur_edges[numroutes-y+m1+i] = depot_costs[m1+2*i+1]; in mst() 149 for (cur_bound = i = 0; i < numroutes; i++) in mst() 160 memcpy (best_edges, cur_edges, numroutes*sizeof(edge_data)); in mst() [all …]
|
H A D | nearest_ins.c | 22 int numroutes, cur_route, nearnode, *starter; in nearest_ins() local 48 numroutes = p->cur_tour->numroutes; in nearest_ins() 49 starter = (int *) calloc (numroutes, sizeof(int)); in nearest_ins() 51 = (route_data *) calloc (numroutes+1, sizeof(route_data)); in nearest_ins() 72 for (cur_route=1; cur_route<=numroutes; cur_route++){ in nearest_ins() 110 for (cur_route = 1; cur_route< numroutes; cur_route++) in nearest_ins() 119 send_tour(tour, cost, numroutes, tours->algorithm, used_time(&t), parent, in nearest_ins()
|
H A D | farthest_ins.c | 25 int last, cost, numroutes; in farthest_ins() local 48 numroutes = p->cur_tour->numroutes; in farthest_ins() 49 starter = (int *) calloc (numroutes, sizeof(int)); in farthest_ins() 51 = (route_data *) calloc (numroutes+1, sizeof(route_data)); in farthest_ins() 72 for(cur_route = 1; cur_route<=numroutes; cur_route++){ in farthest_ins() 111 for (cur_route = 1; cur_route < numroutes; cur_route++) in farthest_ins() 120 send_tour(tour, cost, numroutes, tours->algorithm, used_time(&t), parent, in farthest_ins()
|
H A D | farnear_ins.c | 31 int i, last, cost, numroutes; in farnear_ins() local 53 numroutes = p->cur_tour->numroutes; in farnear_ins() 54 starter = (int *) calloc (numroutes, sizeof(int)); in farnear_ins() 56 = (route_data *) calloc (numroutes+1, sizeof(route_data)); in farnear_ins() 76 for(cur_route = 1; cur_route<=numroutes; cur_route++){ in farnear_ins() 133 for (cur_route = 1; cur_route< numroutes; cur_route++) in farnear_ins() 142 send_tour(tour, cost, numroutes, tours->algorithm, used_time(&t), parent, in farnear_ins()
|
H A D | exchange2.c | 23 int numroutes; in exchange2() local 51 numroutes = tours->numroutes; in exchange2() 53 = (route_data *) calloc (numroutes+1, sizeof(route_data)); in exchange2() 54 route_calc(&p->dist, tour, numroutes, tours->route_info, p->demand); in exchange2() 81 for (cur_route1 = 1; cur_route1 <= numroutes; cur_route1++){ in exchange2() 87 for (cur_route2 = cur_route1+1; cur_route2 <= numroutes; cur_route2++){ in exchange2() 158 for (cur_route2 = cur_route1+1; cur_route2 <= numroutes; cur_route2++){ in exchange2() 252 if ((!max_next2) && (max_route2 != numroutes)) in exchange2() 272 if ((!max_next1) && (max_route1 != numroutes)) in exchange2() 280 if ((!max_next2) && (max_route2 != numroutes)) in exchange2() [all …]
|
/dports/security/openvas/openvas-scanner-21.4.3/misc/ |
H A D | pcap.c | 127 int numroutes = 0; in v6_is_local_ip() local 153 for (i = 0; i < numroutes; i++) in v6_is_local_ip() 696 *numroutes, iface, myroutes[*numroutes].dest, in getipv4routes() 708 (*numroutes)++; in getipv4routes() 829 (*numroutes)++; in getipv6routes() 869 static int numroutes = 0; in v6_routethrough() local 949 for (i = 0; i < numroutes; i++) in v6_routethrough() 1091 static int numroutes = 0; in routethrough() local 1175 numroutes, iface, myroutes[numroutes].dest, in routethrough() 1187 numroutes++; in routethrough() [all …]
|
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/Master/Heuristics/ |
H A D | start_heurs.c | 77 if (heur_par->savings3_par.savings_trials && (vrp->numroutes || in start_heurs() 78 (!vrp->numroutes && vrp->dist.coordx && vrp->dist.coordy))){ in start_heurs() 82 if (heur_par->near_cluster_trials && (vrp->numroutes || in start_heurs() 191 if (!vrp->numroutes){ in start_heurs() 192 vrp->numroutes = tours[tourorder[0]].numroutes; in start_heurs() 198 if (tours[tourorder[i]].numroutes == vrp->numroutes){ in start_heurs() 206 vrp->cur_tour->numroutes = tours[tourorder[ub_pos]].numroutes; in start_heurs() 216 vrp->numroutes); in start_heurs() 223 if (vrp->numroutes && lb_par->lower_bound){ in start_heurs() 235 vrp->numroutes, (int)(*ub)); in start_heurs() [all …]
|
H A D | receive_rout.c | 54 int numroutes, v0, v1, vertnum = vrp->vertnum; in receive_tours() local 85 receive_int_array(&numroutes, 1); /*receive in receive_tours() 90 route_info = (route_data *) calloc(numroutes + 1, in receive_tours() 92 receive_char_array((char *)route_info, (numroutes+1) * in receive_tours() 124 tours[*last].numroutes = numroutes; in receive_tours() 141 cost, numroutes); in receive_tours() 225 tours[tourorder[0]].cost, tours[tourorder[0]].numroutes, in receive_tours() 246 int numroutes, int jobs, int *sent) in receive_lbs() argument 248 int i, low_run, dead_tasks = 0, nr = numroutes; in receive_lbs() 276 numroutes * sizeof(edge_data)); in receive_lbs() [all …]
|
H A D | lower_bound.c | 54 int m1, numroutes = vrp->numroutes, capacity = vrp->capacity; in lower_bound() local 70 if (!(capacity*(numroutes-m1-1) >= in lower_bound() 74 trials = (lb_par->lower_bound)*(numroutes-m1); in lower_bound() 99 send_int_array(&numroutes, 1); in lower_bound() 112 if (y == numroutes){ in lower_bound()
|
H A D | route_heur.c | 48 int cur_node, cur_route, numroutes; in route_heur() local 98 numroutes = tours->numroutes; in route_heur() 100 (route_data *) calloc (numroutes+1, sizeof(route_data)); in route_heur() 101 route_calc(&p->dist, tour, numroutes, tours->route_info, p->demand); in route_heur() 239 for (cur_route=1; cur_route<=numroutes; cur_route++){ in route_heur() 272 solutions[round].numroutes = numroutes; in route_heur()
|
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/CutGen/Decomp/ |
H A D | decomp_user.c | 29 int size = vrp->vertnum+vrp->numroutes-1; in user_generate_new_cols() 37 int numroutes = vrp->numroutes; in user_generate_new_cols() local 94 int numroutes = vrp->numroutes, vertnum = vrp->vertnum; in bfm() local 100 if (cur_node == 0 && intour[0] == numroutes){ in bfm() 124 tour[cur_node+numroutes] = cur_edge->other_end+numroutes; in bfm() 187 int numroutes = vrp->numroutes; in add_tour_to_col_set() local 211 coef[0] = INDEX(0, tour[0]-numroutes); in add_tour_to_col_set() 215 if (next_node == numroutes){ in add_tour_to_col_set() 216 coef[k] = INDEX(0, (cur_node-numroutes)); in add_tour_to_col_set() 220 coef[k] = INDEX((cur_node>numroutes?cur_node-numroutes:0), in add_tour_to_col_set() [all …]
|
H A D | decomp_lower_bound.c | 39 double ub = (double)((MAXINT)/(vrp->vertnum+vrp->numroutes-1)), optval = 0; in decomp_lower_bound() 62 vrp->numroutes); in decomp_lower_bound() 92 &optval, x, 0, 100, vrp->numroutes); in decomp_lower_bound() 119 int cur_node, vertnum = vrp->vertnum, numroutes = vrp->numroutes, i; in decomp_lower_bound() local 130 tree_cost = decomp_make_k_tree(vrp, edge_costs, tree, numroutes); in decomp_lower_bound() 145 for (bound = i = 0; i < numroutes; i++) in decomp_lower_bound() 372 int *lamda, int numroutes, int *tree, in decomp_new_lamda() argument 387 for (i = 0; i < numroutes; i++){ in decomp_new_lamda() 394 (degrees[cur_node1]-2*numroutes)*(degrees[cur_node1]-2*numroutes); in decomp_new_lamda() 402 (cur_node1 ? 1: 2*numroutes)); in decomp_new_lamda()
|
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/DrawGraph/ |
H A D | vrp_dg_functions.c | 137 int edgenum = vertnum+numroutes-1; in disp_vrp_tour() 326 int numroutes, int report) in display_part_tour() argument 341 while (v1 != numroutes){ in display_part_tour() 349 nv1 = v1>numroutes?v1-numroutes:0; in display_part_tour() 350 nv0 = v0>numroutes?v0-numroutes:0; in display_part_tour() 356 while (v1 != numroutes){ in display_part_tour() 358 nv1 = v1>numroutes?v1-numroutes:0; in display_part_tour() 359 nv0 = v0>numroutes?v0-numroutes:0; in display_part_tour() 380 int numroutes, int report) in disp_lb() argument 384 int edgenum = vertnum + numroutes - 1; in disp_lb() [all …]
|
/dports/net/kamailio/kamailio-5.4.5/src/modules/seas/ |
H A D | encode_route.c | 129 unsigned char numroutes; in print_encoded_route_body() local 136 numroutes=payload[1]; in print_encoded_route_body() 137 if(numroutes==0){ in print_encoded_route_body() 141 for(i=0,offset=2+numroutes;i<numroutes;i++){ in print_encoded_route_body() 180 unsigned char numroutes; in dump_route_body_test() local 187 numroutes=payload[1]; in dump_route_body_test() 188 if(numroutes==0){ in dump_route_body_test() 193 for(i=0,offset=2+numroutes;i<numroutes;i++){ in dump_route_body_test()
|
/dports/net/babeld/babeld-babeld-1.10/ |
H A D | xroute.c | 347 int numroutes; in check_xroutes() local 361 numroutes = 0; in check_xroutes() 363 numroutes = rc; in check_xroutes() 366 if(numroutes >= maxroutes) in check_xroutes() 369 rc = kernel_routes(routes + numroutes, maxroutes - numroutes); in check_xroutes() 373 numroutes += rc; in check_xroutes() 375 if(numroutes >= maxroutes) in check_xroutes() 378 for(i = 0; i < numroutes; i++) { in check_xroutes() 394 while(i < numroutes || j < numxroutes) { in check_xroutes() 401 if(i >= numroutes) in check_xroutes() [all …]
|
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/src/DrawGraph/ |
H A D | cnrp_dg_functions.c | 140 int edgenum = vertnum+numroutes-1; in disp_vrp_tour() 423 int numroutes, int report) in display_part_tour() argument 438 while (v1 != numroutes){ in display_part_tour() 446 nv1 = v1>numroutes?v1-numroutes:0; in display_part_tour() 447 nv0 = v0>numroutes?v0-numroutes:0; in display_part_tour() 453 while (v1 != numroutes){ in display_part_tour() 455 nv1 = v1>numroutes?v1-numroutes:0; in display_part_tour() 456 nv0 = v0>numroutes?v0-numroutes:0; in display_part_tour() 477 int numroutes, int report) in disp_lb() argument 481 int edgenum = vertnum + numroutes - 1; in disp_lb() [all …]
|
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/Master/ |
H A D | vrp_master.c | 127 vrp->numroutes = vrp->cur_tour->numroutes; in user_readparams() 158 if (vrp->numroutes == 1){ in user_io() 161 vrp->numroutes = 1; in user_io() 190 vrp->numroutes = vrp->cur_tour->numroutes; in user_io() 227 vrp->cur_tour->numroutes = vrp->numroutes; in user_start_heurs() 241 if (!vrp->numroutes){ in user_start_heurs() 251 if (vrp->numroutes > 1){ in user_start_heurs() 533 vrp_lp->numroutes = vrp->numroutes; in user_send_lp_data() 558 send_int_array(&vrp->numroutes, 1); in user_send_lp_data() 599 vrp_cg->numroutes = vrp->numroutes; in user_send_cg_data() [all …]
|
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/src/Master/ |
H A D | cnrp_main.c | 83 if (!cnrp->numroutes && cnrp->par.prob_type == VRP){ in main() 89 if (cnrp->numroutes > 1){ in main() 90 printf("NUMBER OF TRUCKS: \t%i\n", cnrp->numroutes); in main() 92 cnrp->demand[0]/(cnrp->capacity*(double)cnrp->numroutes)); in main() 112 cnrp->cur_tour->numroutes = cnrp->numroutes; in main() 118 cnrp->numroutes = cnrp->cur_tour->numroutes; in main() 383 rhs[0] = cnrp->numroutes; in cnrp_load_problem() 385 rhs[vertnum] = cnrp->numroutes; in cnrp_load_problem() 394 (rhs[0]) = 2*cnrp->numroutes; in cnrp_load_problem() 534 cnrp->cur_tour->numroutes = cnrp->numroutes; in cnrp_test()
|
H A D | cnrp_master.c | 139 if (!cnrp->numroutes && cnrp->par.prob_type == VRP){ in user_io() 145 if (cnrp->numroutes > 1){ in user_io() 146 printf("NUMBER OF TRUCKS: \t%i\n", cnrp->numroutes); in user_io() 148 cnrp->demand[0]/(cnrp->capacity*(double)cnrp->numroutes)); in user_io() 183 cnrp->cur_tour->numroutes = cnrp->numroutes; in user_start_heurs() 188 cnrp->numroutes = cnrp->cur_tour->numroutes; in user_start_heurs() 390 cnrp_lp->numroutes = cnrp->numroutes; in user_send_lp_data() 420 send_int_array(&cnrp->numroutes, 1); in user_send_lp_data() 464 cnrp_cg->numroutes = cnrp->numroutes; in user_send_cg_data() 502 send_int_array(&cnrp->numroutes, 1); in user_send_cg_data() [all …]
|
/dports/cad/qrouter/qrouter-1.4.85/ |
H A D | delays.c | 122 int numroutes, lefrcinfo *lefrcvalues, u_char end) in check_downstream() argument 130 for (i = 0; i < numroutes; i++) { in check_downstream() 190 for (i = 0; i < numroutes; i++) { in check_downstream() 193 walk_route(i, 0, eptinfo, numroutes, lefrcvalues); in check_downstream() 197 walk_route(i, 1, eptinfo, numroutes, lefrcvalues); in check_downstream() 220 int numroutes, lefrcinfo *lefrcvalues) in walk_route() argument 419 int nroute, numroutes; in write_delays() local 486 numroutes = 0; in write_delays() 653 for (i = 0; i < numroutes; i++) { in write_delays() 875 numroutes = 0; in write_delays() [all …]
|
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/include/ |
H A D | vrp_dg_functions.h | 30 _node *tour, int vertnum, int numroutes,int report)); 45 int numroutes, int report)); 49 int numroutes, int report));
|
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/include/ |
H A D | cnrp_dg_functions.h | 30 _node *tour, int vertnum, int numroutes,int report)); 50 int numroutes, int report)); 54 int numroutes, int report));
|