研究论文

基于分区的多配送中心多车型车辆调度问题与遗传算法设计

  • 马宇红;姚婷婷;张浩庆
展开
  • 1. 西北师范大学学报编辑部,兰州 730070;2. 西北师范大学数学与统计学院,兰州 730070

收稿日期: 2012-10-18

  修回日期: 2012-12-08

  网络出版日期: 2013-01-18

Multi-delivery Centre Multi-type Vehicle Scheduling Problem Based on the Partition and the Design of Genetic Algorithm

  • MA Yuhong;YAO Tingting;ZHANG Haoqing
Expand
  • 1. Editorial Department of the University Journal, Northwest Normal University, Lanzhou 730070, China;2. College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China

Received date: 2012-10-18

  Revised date: 2012-12-08

  Online published: 2013-01-18

摘要

研究大规模的多配送中心多车型车辆调度问题,首先基于配送中心几何重心分区方法将多配送中心多车型车辆调度问题转化为单配送中心多车型车辆调度问题,该分区方法简单、直观,大大降低了运算量.建立了一种基于完整配送费用的多配送中心多车型车辆调度问题的数学模型,配送费用在考虑基本运输费的基础上又引入了司机的工资支出,包括基本工资和加班费.在多配送中心多车型车辆调度模型中,一个配送中心的一辆车可以为多个客户服务,但一个客户只能由某个配送中心的一辆车提供服务.根据模型的这些特点,提出了一种新的多片段染色体混合编码方案,并采用分段交叉、分段变异方法有效继承了父代染色体的部分基因,显著提高了算法的收敛性能.数值仿真结果验证了算法的可行性和有效性.

本文引用格式

马宇红;姚婷婷;张浩庆 . 基于分区的多配送中心多车型车辆调度问题与遗传算法设计[J]. 科技导报, 2013 , 31(2) : 61 -67 . DOI: 10.3981/j.issn.1000-7857.2013.02.008

Abstract

A large scale multi-delivery centre multi-type vehicle scheduling problem is considered. Firstly, based on the method of gravity center partition, the multi-delivery centre multi-type vehicle scheduling problem is transformed into the single-delivery centre multi-type vehicle scheduling problem, the partition method is simple, and reduces the amount of computations. Then based on the minimum delivery cost, a mathematical model of multi-delivery centre multi-type vehicle scheduling problem is established; the model considers not only the basic transportation cost, but also the driver's salary expenses, including the basic wage and overtime pay. In the model of multi-delivery centre multi-type vehicle scheduling, one car is able to provide service for more customers, however a customer must be served only by one car. According these characteristics, a new chromosomal hybrid encoding scheme is put forward, and the techniques of segmented crossover and mutation is used, the method effectively retains the father's generation superiority of chromosome fragments, therefore remarkably improves the convergence speed of the genetic algorithm. The results of numerical simulation verify the feasibility and effectiveness of the algorithm.
文章导航

/