Research Article
Route Planning for Military Ground Vehicles in Road Networks under Uncertain Battlefield Environment
Procedure 1
The solving process in a sample.
Procedure: Selecting a solution for a sample | (1) Input the N randomly-generated scenarios, and initialize the solution | (2) Solving the problem of each scenario with CPLEX, record the best solution to each scenario | (3) Counting the solutions, sort the diverse solutions in non-increasing order of counts | (4) Choose the first diverse solutions ( is the number of solutions to check) | (5) For solution , calculate the in formula (12) | (6) Check solution in all scenarios, if is not feasible overall, update | (7) Choose with the biggest , and let | (8) Return x |
|