Delivery routing optimization problem for O2O orders with paired pick-up and delivery nodes
Considering that O2O orders consist of paired pickups which often occurs before delivering them,as well as constraints like multi-type vehicles,multi-trip and customer time windows,a delivery routing optimiza-tion model is constructed for O2O orders.Then,an improved simulated annealing algorithm with neighborhood search(ISA-NS)is proposed,where a unique encoding method,greedy strategy,and three NS operators are adopted.When solving small-size and large-size benchmarks,the solution of ISA-NS algorithm is close to the existing optimal solution,which verifies the effectiveness and convergence of the algorithm.Finally,the opti-mization results,taking the O2O orders of Tianjin"Huo lala"platform as an example,illustrate the applicability of the model and algorithm.This provides decision support for the O2O order delivery problem.
万方数据
维普
