Suppose you designed for the express company express route optimization program, (1) every city has a distribution point, has direct route between some cities, there is no direct route between some cities; (2) between the cities and urban freight calculation formula is: distance

CodePudding user response:

As if is not easy, need a good study of graph theory and algorithms,

CodePudding user response:

Each city may have the parcel delivered to other cities? Each transit point can be temporary? Can hash? That is too complex, it is NP problem, to obtain the optimal solution is very difficult, can only be exhaustive,