基于改进免疫算法的带模糊需求车辆调度问题

Vehicle Scheduling Problem with Fuzzy Demands Based on Improved Immune Algorithms

通过引用一种新的编码方法、交叉和变异概率的自适应机制,构造了一个改进的免疫算法,并对算法的交叉操作加以改进,成功地将这种算法应用于带模糊需求的物流配送车辆调度的求解过程中,将求解结果与遗传算法比较,结果表明,该算法可以较好地求解VSPFD问题.

The immune algorithm is an intelligentized heuristic algorithm which imitates high-evolvement of the organism and complicated immune system. Vehicle scheduling problem with fuzzy demands （VSPFD） is a variation of vehicle scheduling problem （VSP）, which is a typical NP-hard problem. This paper de- scribes an improved immune algorithm to solve the VSPFD, in which a new coding method, the adaptive mechanism of crossover and mutation, and evaluating function are introduced. Simulation result shows that the immune algorithm is egicient to solve the VSPFD problem.