An effective evolutionary approach for bicriteria shortest path routing problems (特集:進化技術とその応用) An Effective Evolutionary Approach for Bicriteria Shortest Path Routing Problems
Access this Article
Search this Article
Routing problem is one of the important research issues in communication network fields. In this paper, we consider a bicriteria shortest path routing (bSPR) model dedicated to calculating nondominated paths for (1) the minimum total cost and (2) the minimum transmission delay. To solve this bSPR problem, we propose a new multiobjective genetic algorithm (moGA): (1) an efficient chromosome representation using the priority-based encoding method; (2) a new operator of GA parameters auto-tuning, which is adaptively regulation of exploration and exploitation based on the change of the average fitness of parents and offspring which is occurred at each generation; and (3) an interactive adaptive-weight fitness assignment mechanism is implemented that assigns weights to each objective and combines the weighted objectives into a single objective function. Numerical experiments with various scales of network design problems show the effectiveness and the efficiency of our approach by comparing with the recent researches.
- IEEJ Transactions on Electronics, Information and Systems
IEEJ Transactions on Electronics, Information and Systems 128(3), 416-423, 2008-03-01
The Institute of Electrical Engineers of Japan