routing problem optimization code
显示 更早的评论
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
回答（1 个）
Torsten
2023-1-1
0 个投票
3 个评论
Mostafa
2023-1-1
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.
类别
在 帮助中心 和 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 
