Can pareto optimality be used to solve the travelling salesman problem?
2 次查看(过去 30 天)
显示 更早的评论
A city's co-ordinates are given by x (latitude) and y (longitude) and the shortest travel distance between many cities is given by the travelling salesman algorithm (FEX). How to find the route between different cities such that we get maximum x and minimum y?
2 个评论
Alan Weiss
2018-12-18
Sorry, I don't understand your question. Can you write a formula to say what you mean, or else try to explain in different words? In particular, I do not understand what it means to find a route "between different cities such that we get maximum x and minimum y."
采纳的回答
Bruno Luong
2018-12-18
编辑:Bruno Luong
2018-12-18
Just change the definition "distance" between 2 cities to, for example
d = sqrt((1/dx)^2 + dy^2)
and feet it TSP algo.
Note that the classical eucidian distance is
d = sqrt(dx^2 + dy^2)
1 个评论
更多回答(0 个)
另请参阅
类别
在 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!