Scholarlink

In this paper, we propose a distributed algorithm to solve the bi-objective shortest path (BOSP) problem. The proposed algorithm can obtain all the Pareto optimal solutions for such a multi-objective combination optimization problem. Moreover, rapid comparison and pruning techniques are designed to alleviate the space/message complexity burden common in multi-objective optimization problems. Simulation results show the validity of the proposed algorithm, as well as rapid comparison and pruning techniques.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A Distributed Bi-objective Shortest Path Algorithm with Pruning Techniques

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Shulei Zhou,
  • Yuanqiu Mo,
  • Jian Qin,
  • Wenwu Yu

摘要

In this paper, we propose a distributed algorithm to solve the bi-objective shortest path (BOSP) problem. The proposed algorithm can obtain all the Pareto optimal solutions for such a multi-objective combination optimization problem. Moreover, rapid comparison and pruning techniques are designed to alleviate the space/message complexity burden common in multi-objective optimization problems. Simulation results show the validity of the proposed algorithm, as well as rapid comparison and pruning techniques.