PENDEKATAN ALGORITMA GENETIK UNTUK MASALAH TRANSPORTASI LlNIER BIKRITERIA

• Main Author: YUNITA SETIAWATI, 089911973
• Format: Theses and Dissertations NonPeerReviewed
• Language: Indonesian
• Published: 2004
• Subjects: QA76.73. Computer algorithms and Data structures
• Online Access: http://repository.unair.ac.id/58105/1/KKC%20KK%20MPM%2016-04%20Set%20p.pdf; http://repository.unair.ac.id/58105/; http://lib.unair.ac.id
• Institution: Universitas Airlangga

The bicriteria linear transponalion problem (BlTP) is a modify of linear transportation problem. Transportation problem wilh a single objektive of minimizing the total cost is well known in the literature. BlTP is a transportation problem with two objcctives : minimizing total cost and minimizing lolal deterioration. This paper concern with BL TP and its solution utili sing genetic algorihms (GA). Optimation concept of BLTP is optimal Pareto (nondominated so lution). GA approaches for BL TP arc to find the set of nondominated points in feasible area. In this case used problem with 7 sources, 7 destinations, 20 population size, and 20 maximum generations. At last be obtained 15 nondominated solutions. It if compare witlLGoaI erogramming approach so 13 points are optimal solution and 2 points are suboptimal solution.