03064nas|a2200397 i 4500 20260818115024.0 240400s1999 th uzm rtt 00| a1eng d .b11786292 AIT Thesis no.ISE-99-47 Pornthipa Ongkunaruk A genetic algorithm for a location-routing problem Bangkok : Asian Institute of Technology, 1999 65 p.: ill. Thesis ; no. ISE-99-47 Thesis (M.Sc.) - Asian Institute of Technology A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science, School of Advanced Technologies In distribution system, the strategic and tactical decisions of the locations of depots and the routes of allocated customers are addressed in Location-Routing Problem. Since the traditional optimization method takes a long computational time to solve the problem. An alternative method, a genetic algorithm is proposed in this study. Firstly, the permutation encoding and decoding interpret solutions as clustering and routing simultaneously. Secondly, the initialization procedure originates feasible solutions. Then, the combined roulette wheel and rank selection chooses two parents to crossover by a new technique called group crossover. It saves the fixed and variable costs and generates feasible offspring. After crossover, the swap mutation is also applied. Subsequently, the algorithms are written in C++ program. The GA performance is evaluated by the experiment varying problem sizes and comparing the results with those of optimization package called CPLEX. The values of GA parameters are also studied for their effects on the quality of solutions. It is found that their appropriate values depend on the problem sizes. In general, GA performs well as it generates heuristic solutions with a less computational time compared with that of CPLEX. Moreover, GA can find solutions in large problems that CPLEX cannot solve in a limited time. Genetic algorithms Motor vehicles Automatic location systems Anulark Pinnoi, Chairperson Shanker, Kripa, Examination committee Nagarur, Nagendra N., Examination Committee Royal Thai Government, Scholarship donor Asian Institute of Technology. Thesis ; no. ISE-99-47 Full-Text http://203.159.5.9/ait-thesis/detail.php?q=B12419 .b11786292 mnait u 240330 0 000424 m a u 2 mnait mnarc 22 40 Barcode : 30050120814008 CREATED : 2014-03-31 RECORD # : i12782749 LPATRON : 1025965 LCHKIN : 2016-05-28 # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 2 TOT RENEW : 9 Barcode : 30050160099775 CREATED : 2016-04-27 RECORD # : i12958347 LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 49419 49419 0 0 0 0 MAIN MAIN mnait 2026-08-18 50.00 0 AIT Thesis no.ISE-99-47 30050120814008 2026-08-18 11:50:24 3 2026-08-18 22 0 0 0 0 MAIN MAIN mnarc 2026-08-18 0 AIT Thesis no.ISE-99-47 30050160099775 2026-08-18 11:50:24 1 2026-08-18 40