02398nam a2200241 a 450000500170000000800410001703500150005810000250007324501020009826000570020030000390025749000280029650001800032452012910050450200590179565000280185465000150188270000440189770000470194170000420198881000600203085600660209020260817161532.0140625s2012    th ad  |||   |000 0 eng d  a.b121358590 aSikarin Vinyoopradit10aAdaptive variable neighborhood search algorithms for solving capacitated vehicle routing problems  aPathum Thani :bAsian Institute of Technology,c2012  a104 p. :bill. (some col.), charts1 aThesis ;vno. ISE-12-51  aSubmitted in partial fulfillment of the requirements for the  degree of Master of Engineering in Industrial and Manufacturing Engineering, School of Engineering and Technology  aThis  research  presents  adaptive  variable  neighborhood  search  algorithms  for  solving Capacitated  Vehicle  Routing  Problems  (CVRP).  Four  Variable  Neighborhood  Search (VNS)  based  algorithms  to  optimize  Capacitated  Vehicle  Routing  Problems  (CVRP)  are studied.  The  first  algorithm  is  a  Variable  Neighborhood  Search  (VNS)  integrated  with Tabu Search (TS) implemented with new proposed Tabu List. The second algorithm is an Adaptive  Variable  Neighborhood  Search  (AVNS)  algorithm  to  improve  the  perturbation process of VNS algorithm by allowing the frequently used sequences in local optimum to be  selected  via  integrating  Roulette  Wheel  Selection  method.  The  third  algorithm  is  an alternative  AVNS  algorithm  that  adopts  approach  similar  to  Ant  Colony  Optimization (ACO) to the AVNS algorithm called A-AVNS1 to reduce the influence of the infrequent used sequences. An Adaptive Roulette Wheel Selection method is proposed in A-AVNS2 algorithm to improve algorithm exploration efficiency. Numerical experiments are carried out  using  the  published  benchmark  test  problems.  The  results  indicated  that  the  proposed adaptive  VNS  algorithms  improved  solution  quality  and  solution  time  for  large  problem sizes.  aThesis (M. Eng.) - Asian Institute of Technology, 2012 0aVehicle routing problem 0aAlgorithms0 aVoratas Kachitvichyanukul,eChairperson1 aHuynh, Trung Luong,eExamination Committee0 aPisut Koomsap,eExamination Committee2 aAsian Institute of Technology.tThesis ;vno. ISE-12-51  3Full-Textuhttp://203.159.5.9/ait-thesis/detail.php?q=B03378