带有次序限制的装卸一体化车辆路径问题研究

摘要

The vehicle routing problem with simultaneous delivery and pickup is studied in this paper. According to the practical case, the constraint of order limit is added. Then the mathematical model aiming at finding out the minimum distance is established. At the same time, an improved genetic algorithm based on the best selection method is designed and used to solve this model. Finally, the validity of the model and algorithm are tested by practical example.%研究了装卸一体化的车辆路径问题，根据问题的实际情况，增加了带有次序限制条件，并以总行驶路线最短为目标，建立了数学模型，并根据模型的特点，用改进的遗传算法进行求解。最后，通过具体实例验证了模型及算法的有效性。