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!