带时间窗的动态多配送问题的多目标优化
Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows
摘要:
PDPTW问题是一个最优车辆路径问题,它必须满足供应商和客户之间的运输要求,满足优先级、容量和时间约束。本文提出了一种遗传算法,用于求解带时间窗的动态多配送问题(Dynamic m-PDPTW)的多目标优化问题。我们对PDPTW进行了简短的文献回顾,提出了基于帕累托优势法和下界的方法,为动态m-PDPTW提供了一个令人满意的解决方案,使总旅行成本和总迟到时间之间的妥协最小化。计算结果表明,该算法在允许的代价下,总拖期为零。
英文摘要:
The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints. We present, in this paper, a genetic algorithm for multi-objective optimization of a dynamic multi pickup and delivery problem with time windows (Dynamic m-PDPTW). We propose a brief literature review of the PDPTW, present our approach based on Pareto dominance method and lower bounds, to give a satisfying solution to the Dynamic m-PDPTW minimizing the compromise between total travel cost and total tardiness time. Computational results indicate that the proposed algorithm gives good results with a total tardiness equal to zero with a tolerable cost.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。