Study On Optimization Of Vehicle Routing Problem With Multiple Vehicle Type And Vehicle Access Restricted Based On Genetic Algorithm

被引:1
作者
Chen, Kai [1 ]
Lang, Maoxiang [1 ]
机构
[1] Beijing Jiaotong Univ, Sch Traff & Transportat, Beijing 100044, Peoples R China
来源
MECHATRONICS, ROBOTICS AND AUTOMATION, PTS 1-3 | 2013年 / 373-375卷
关键词
vehicle routing problem; multiple vehicle type; genetic algorithm; Vehicle Access Restricted;
D O I
10.4028/www.scientific.net/AMM.373-375.1031
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In many cities, large trucks can't be used to delivery in the urban district, but in the suburbs all kinds of vehicles can be used. To solve the problem, this paper establishes the optimization model and designs a solving method using a genetic algorithm (GA), taking Zigong tobacco distribution center for example. Comparing with the data calculated by empirical distribution route, the results show that the total distance declines 155.47 km, the number of different type vehicles reduces 1-2 and the average load rate increased by 68.3% to 85.1%.
引用
收藏
页码:1031 / 1035
页数:5
相关论文
共 5 条
  • [1] CLASSIFICATION IN VEHICLE-ROUTING AND SCHEDULING
    BODIN, L
    GOLDEN, B
    [J]. NETWORKS, 1981, 11 (02) : 97 - 108
  • [2] Boldin L D, 1983, COMPUTERS OPERATIONS, P63
  • [3] Gen MitsuoRunwei Cheng Lin Lin., 2008, NETWORK MODELS OPTIM
  • [4] Guo Yaohuang, 1995, J SW JIATONG U, V30, P376
  • [5] LANGEVIN Marie., 2009, memoire de maitrise, programme de Science politique, P1