Can pareto optimality be used to solve the travelling salesman problem?
2 views (last 30 days)
Show older comments
Venky Suriyanarayanan
on 18 Dec 2018
Edited: Venky Suriyanarayanan
on 19 Dec 2018
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 Comments
Alan Weiss
on 18 Dec 2018
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."
Accepted Answer
Bruno Luong
on 18 Dec 2018
Edited: Bruno Luong
on 18 Dec 2018
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 Comment
Venky Suriyanarayanan
on 19 Dec 2018
Edited: Venky Suriyanarayanan
on 19 Dec 2018
More Answers (0)
See Also
Categories
Find more on Genetic Algorithm in Help Center and File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!