TY  - SER
AU  - Pornthipa Ongkunaruk
AU  - Anulark Pinnoi,
AU  - Shanker,Kripa
AU  - Nagarur,Nagendra N.
ED  - Royal Thai Government,
TI  - A genetic algorithm for a location-routing problem
T2  - Thesis
PY  - 1999///
CY  - Bangkok
PB  - Asian Institute of Technology
KW  - Genetic algorithms
KW  - Motor vehicles
KW  - Automatic location systems
N1  - A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science, School of Advanced Technologies; Thesis (M.Sc.) - Asian Institute of Technology
N2  - 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
UR  - http://203.159.5.9/ait-thesis/detail.php?q=B12419
ER  -