A Transgenic Algorithm for the Vehicle Routing Problem with Time Windows

被引:0
作者
Ruiz-Vanoye, Jorge A. [1 ]
Diaz-Parra, Ocotlan [1 ]
Cocon, Felipe [1 ]
Buenabad-Arias, Angeles [1 ]
Canepa Saenz, Ana [1 ]
机构
[1] Univ Autonoma Carmen, Cd Del Carmen, Mexico
来源
PROCEEDINGS OF THE 2012 FOURTH WORLD CONGRESS ON NATURE AND BIOLOGICALLY INSPIRED COMPUTING (NABIC) | 2012年
关键词
Transportation; Vehicle Routing Problem with Time Windows; Bio-inspired algorithms; Transgenic Algorithms; Horizontal Gene Transfer Algorithms; GENETIC ALGORITHMS; METAHEURISTICS; SOLVE;
D O I
暂无
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
In this paper, we present a transgenic computer algorithm based on the transformation mechanism of horizontal gene transfer to solve the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW is the problem of minimising transportation costs while satisfying some restrictions as the time, vehicle capacity and the demand of each client. Horizontal gene artificial transfer is a form of genetic engineering. The transgenic algorithm is considered as a horizontal gene transfer algorithm, a meta-heuristics algorithm, or a bio-inspired algorithm based on horizontal gene transfer and symbiogenesis. The transgenic algorithm uses a data-mining technique (clustering) to group similar characteristics of the VRPTW instance to obtain the initial population (one VRPTW individual), a genetic transfer phase inspired by the transference of genetic codes of a bacterial gene (depot) contained in mechanisms for the horizontal gene transfer, and an intelligent mutation operator inspired by symbiogenesis called symbion operator. The transgenic algorithm (lateral gene transfer algorithm, or horizontal gene transfer algorithm) involves deliberate genetic modification rather than evolutionary aspects. We demonstrate that it is possible to deploy a transgenic algorithm based on horizontal gene transfer to solve (in fewer generations and less time) the VRPTW than the results of the genetic algorithm.
引用
收藏
页码:138 / 143
页数:6
相关论文
共 93 条
  • [1] Parallel heterogeneous genetic algorithms for continuous optimization
    Alba, E
    Luna, F
    Nebro, AJ
    Troya, JM
    [J]. PARALLEL COMPUTING, 2004, 30 (5-6) : 699 - 719
  • [2] A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
    Alvarenga, G. B.
    Mateus, G. R.
    de Tomi, G.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (06) : 1561 - 1584
  • [3] Alvarenga G. B., 2004, Fourth International Conference on Hybrid Intelligent Systems, P428, DOI 10.1109/ICHIS.2004.13
  • [4] Anderson D., 2000, HUMAN GUIDED SIMPLE
  • [5] [Anonymous], BIOL CYBERNETICS
  • [6] Arbelaitz O., 2001, INTERNATIONAL JOURNA, V1, P175
  • [7] Solving vehicle routing problems using constraint programming and metaheuristics
    Backer, BD
    Furnon, V
    Shaw, P
    Kilby, P
    Prosser, P
    [J]. JOURNAL OF HEURISTICS, 2000, 6 (04) : 501 - 523
  • [8] A parallel tabu search heuristic for the vehicle routing problem with time windows
    Badeau, P
    Guertin, F
    Gendreau, M
    Potvin, JY
    Taillard, E
    [J]. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 1997, 5 (02) : 109 - 122
  • [9] Baker E. K., 1986, American Journal of Mathematical and Management Sciences, V6, P261
  • [10] THE MOLECULAR TRAVELING SALESMAN
    BANZHAF, W
    [J]. BIOLOGICAL CYBERNETICS, 1990, 64 (01) : 7 - 14