CAJ | 학술논문

提出了针对多车场多车型的关联运输调度问题（ Multiple-depot and Heterogeneous -vehicle Incident Vehicle Routing Problem ）的模糊机会约束规划模型，将问题模型中各个客户的需求量及各供货点库存看成是模糊参数，讨论了如何处理模糊目标函数，并讨论了改进的遗传算法和免疫克隆选择算法，比较其优劣。实验证明，对于求解该模型，免疫克隆选择算法能够快速收敛于全局最优解，优于改进的遗传算法，能有效地解决关联运输调度问题。
제출료침대다차장다차형적관련운수조도문제（ Multiple-depot and Heterogeneous -vehicle Incident Vehicle Routing Problem ）적모호궤회약속규화모형，장문제모형중각개객호적수구량급각공화점고존간성시모호삼수，토론료여하처리모호목표함수，병토론료개진적유전산법화면역극륭선택산법，비교기우렬。실험증명，대우구해해모형，면역극륭선택산법능구쾌속수렴우전국최우해，우우개진적유전산법，능유효지해결관련운수조도문제。
This paper introduces the fuzzy chance constrained programming model for multiple -depot and heterogeneous -vehicle Incident Vehicle Routing Problem ( IVRP, in which customers ’ demands for products and stocks of supply point are treated as fuzzy parameters , discussing how to deal with the fuzzy object function , improving and comparing genetic algorithm and Immune Clone Selection Algorithm ( ICSA) .The experiment result shows that ICSA could converge to global optimal solution rapidly and o -vercome the slow convergence speed of the improved genetic algorithm so as to solve the IVRP effectively and efficiently .