routing problem optimization code

5 次查看（过去 30 天）
Mostafa
Mostafa 2023-1-1
评论： Torsten 2023-1-2
i have a graph with nodes and links and each link have two weights ( number of people and time) and i want to find a circular route start and end at specified node the circular route should have max number of people and don't exceed a specifed time limit
  2 个评论
Torsten
Torsten 2023-1-1
编辑：Torsten 2023-1-1
What about conditions on the route ? Each node must be visited ? Each node on the route can only be visited once ?
Mostafa
Mostafa 2023-1-1
编辑：Mostafa 2023-1-1
it is not necessary to visit each node and each node can be visited only one time

请先登录，再进行评论。

请先登录，再回答此问题。

回答（1 个）

Torsten
Torsten 2023-1-1
  3 个评论
显示 1更早的评论
Torsten
Torsten 2023-1-2
If you can't implement the dynamic programming approach, use a linear optimization tool (e.g. linprog).
If you can't implement the problem in linprog, generate all cycles starting and ending in your specified node and choose the optimal one.
If you can't generate all cycles starting and ending in your specified node, well, then it's time to study a book on the subject.

请先登录，再进行评论。

类别

在 Help Center 和 File Exchange 中查找有关 Genetic Algorithm 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by