Abstract: The Vehicle Routing Problem with Multiple Soft Time Windows (VRPMSTW) is a challenging combinatorial optimization problem where a fleet of vehicles must deliver goods to a set of customers, ...
Abstract: In persistent battlefield confrontation, combat tasks present dynamic characteristics, i.e., new tasks continuously emerge as old tasks are executed. Therefore, how to enhance the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback