03347nam a2200421 a 4500 20260817161532.0 140625s2012 th ad ||| |000 0 eng d .b12135859 AIT Thesis no.ISE-12-51 Sikarin Vinyoopradit Adaptive variable neighborhood search algorithms for solving capacitated vehicle routing problems Pathum Thani : Asian Institute of Technology, 2012 104 p. : ill. (some col.), charts Thesis ; no. ISE-12-51 Submitted in partial fulfillment of the requirements for the degree of Master of Engineering in Industrial and Manufacturing Engineering, School of Engineering and Technology This 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. Thesis (M. Eng.) - Asian Institute of Technology, 2012 Vehicle routing problem Algorithms Voratas Kachitvichyanukul, Chairperson Huynh, Trung Luong, Examination Committee Pisut Koomsap, Examination Committee Asian Institute of Technology. Thesis ; no. ISE-12-51 Full-Text http://203.159.5.9/ait-thesis/detail.php?q=B03378 .b12135859 mnait j 251123 0 140625 m a j 0 000:001:PDF:b1213585:001752:0:0:0:0:0:0 Abstract--AIT Thesis no.ISE-12-51 n mnait mnait mnarc 20 40 Barcode : 30050120844765 CREATED : 2014-09-07 RECORD # : i1281765x LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 1 TOT CHKOUT : 0 TOT RENEW : 0 Barcode : 30050120844757 CREATED : 2014-09-07 RECORD # : i12817661 LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 Barcode : 30050160028816 CREATED : 2016-03-17 RECORD # : i1289400x LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 1640 1640 0 0 0 0 MAIN MAIN mnait 2026-08-17 50.00 0 AIT Thesis no.ISE-12-51 30050120844765 2026-08-17 16:15:32 1 2026-08-17 20 0 0 0 0 MAIN MAIN mnait 2026-08-17 50.00 0 AIT Thesis no.ISE-12-51 30050120844757 2026-08-17 16:15:32 2 2026-08-17 20 0 0 0 0 MAIN MAIN mnarc 2026-08-17 0 AIT Thesis no.ISE-12-51 30050160028816 2026-08-17 16:15:32 1 2026-08-17 40