多车场与多车型车辆路径问题的多染色体遗传算法  

A Multi-chromosome Genetic Algorithm for Multi-depot and Multi-type Vehicle Routing Problems

作　　者：陈呈频[1] 韩胜军 鲁建厦[1] 陈青丰[1] 王成[1] 

机构地区：[1]浙江工业大学工业工程研究所,杭州310014

出　　处：《中国机械工程》2018年第2期218-223,共6页China Mechanical Engineering

基　　金：浙江省自然科学基金资助项目(LY15G010009)

摘　　要：针对目前多车场、多车型车辆路径问题存在的求解效率低和解的质量差等不足,建立了该问题的整数规划模型,提出了多染色体遗传算法,统一了多车场、多车型问题与传统单车场、单车型问题的求解算法。通过算例对多染色体遗传算法进行了实验,并将其与传统算法进行了对比分析。实验表明,该算法不仅呈现出搜索效率高和收敛速度快的特点,而且解的质量和稳定性高,从而验证了算法的有效性和实用性。Aiming at shortcomings of low efficiency and poor quality of solutions in the current multi-depot and multi-type vehicle routing problems,an integer programming model was established.A multi-chromosome genetic algorithm was proposed to unify the solution algorithms of the multidepot and multi-vehicle problems,and traditional single depot and single vehicle problems.Several experiments were completed on the multi-chromosome genetic algorithm through calculation examples,and comparisons with the traditional algorithm results were carried out.Experiments show that the proposed algorithm exhibits high search efficiency and fast convergence speed,and has high quality and stability of the solutions,which verify effectiveness and practicability of the algorithm.

关 键 词：车辆路径问题 多车场 多车型 遗传算法 多染色体 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]