zkk123456 Goto Github PK

an-intelligent-order-allocation-algorithm-for-booking-trips-online-between-cities

In order to solve the actual vehicle routing problem, an intelligent order allocation algorithm for booking trips online between cities is proposed. The algorithm uses the time and space information of the order to construct the initial order allocation scheme set, then uses local search to optimize the order allocation scheme, and dynamically allocates the new orders according to the appointment time, and finally provides different order allocation schemes for decision makers. By constructing the order allocation scheme and optimizing the order allocation scheme, the algorithm can obtain high-quality solutions in a short time.

cbs

multiobjective-memetic-algorithm-based-on-adaptive-local-search-chains-for-vehicle-routing-problem-w

vrptw

pareto-front

对于多目标优化问题，需要求包含大于等于2目标的解，如何比较解成为一个难题。学术界引入经济学中pareto占优的概念来比较有多个目标解的优劣，本案例求2个算法在7个案例集上10次运行的pareto前沿

ws_laser_slam