Traveling Salesman Optimization Problem

3 次查看（过去 30 天）
Imane hammou ouali
Imane hammou ouali 2020-2-27
回答： Alan Weiss 2020-2-27
Hello expert ,
Have a problem to optimize i am looking for a solution, my problem looks similar to the Traveling Salesman.
I have 5 cities, let as defined S a vector that reflect the satisfaction of the traveler to visit such city S=[0.5 1 0.8 0 1] . We also define vector cost that reflects the expenses of the visitor in each city C=[100$ 50$ 100$ 0$ 150$]. If we suppose that the traveller have just 200$ . I have to find the optimal solution for visiting the maximum cities that would yield to maximum satisfaction at the predefined budget.
I would like to solve that propbelm using Genetic Algorithm.
I would be very grateful if you can help me implement that with Matlab code .
Relying on your information sharing and your help, please accept my sincere respect.
Best regards .

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

采纳的回答

Alan Weiss
Alan Weiss 2020-2-27
You can look at this example.
But it is much better to use mixed-integer linear programming, as in this example.
Alan Weiss
MATLAB mathematical toolbox documentation

更多回答（0 个）

类别

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

标签

Community Treasure Hunt

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

Start Hunting!

Translated by