CAJ | 학술논문

研究了装卸一体化的车辆路径问题，根据问题的实际情况，增加了带有次序限制条件，并以总行驶路线最短为目标，建立了数学模型，并根据模型的特点，用改进的遗传算法进行求解。最后，通过具体实例验证了模型及算法的有效性。
연구료장사일체화적차량로경문제，근거문제적실제정황，증가료대유차서한제조건，병이총행사로선최단위목표，건립료수학모형，병근거모형적특점，용개진적유전산법진행구해。최후，통과구체실례험증료모형급산법적유효성。
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.