Abstract: The Traveling Salesman Problem (TSP) is a well-known NP-hard combinatorial optimization problem with applications in logistics, transportation, and network design. Traditional approaches, ...
Abstract: For the multi-vehicle path optimization problem in automotive logistics and transportation, the traditional genetic algorithm is difficult to meet the efficient distribution needs of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results