![]() | يوجد فقط 14 صفحة متاحة للعرض العام |
المستخلص This work studies one of the most important researches in artificial intelligence methods; that is; parallel ant colony algorithm to solve the multicriteria decision making problems. This method was proved effective in solving various optimization problems. In this thesis, Ant colony algorithm was applied to solve the multiobjective routing problems. In addition, the hybrid approach which had been introduced to solve a multicriteria decision making problems in order to obtain Pareto solution set. A hybrid algorithm combining ant colony optimization algorithm (ACO) with modified simplex method (MSM) was introduced. Some benchmark problems of different characteristics were used to investigate the effectiveness of the proposed algorithm. Comparing with the other existing techniques, the proposed algorithm was found better. |