Abstract:

We solve the routing optimization problem of logistics ride matching with singleparent genetic algorithm. Individual reproduction is performed by such genetic recombination as genetic transposition, genetic reversion and genetic gression. We find an optimal and the minimumcost path from all of stops after several generations of breeding iteration. Experimental results show that the algorithm not only improves vehicle ride matching success rate but also effectively reduces the total cost of vehicle operation.

Key words: match rate, genetic operator, single-parent genetic algorithm, logistics ride matching