Operations Research 09E: Traveling Salesman Problem

Operations Research 09E: Traveling Salesman Problem - Integer Programming

Рет қаралды 34,471

Күн бұрын

Пікірлер: 14

@YongWang 5 жыл бұрын

Hi Guys, please comment and let me know what you think about this Operations Research Open Course. Your feedback is really appreciated. If you enjoy the video, please subscribe and share. All my replies here are only related to the content in my own videos. I am afraid I won't be able to answer other questions. Thanks for your understanding.

@spencerw6747 5 жыл бұрын

Sir, how about solving a TSP using a simulated annealing method? Is it possible that a video of this topic be included? :)

@TheSkankoo 5 жыл бұрын

TY for your video, its nice. Can you work with OpenSolver too? I would like to make some model this way..

@Poster_pre Жыл бұрын

This is a really useful video for me to understand the TSP model. I have a question, if the travleller don't return to the initial city, how to list the constaint?

@miaoqi8076 3 жыл бұрын

SOooo good. Clear and simple

@camilohernandezruiz2776 5 жыл бұрын

What would be the values of Ui and Uj in the situation you mentioned of Traveling until city 3 and then return to 1? Why the inecuation is not right?

@Sandeep33 4 жыл бұрын

Nicely explained. Thank you Sir 😀

@maravilhasdobrasil4498 5 жыл бұрын

Do you have any ideas about how can I get the compute the distance traveled until salesman reach each city? I mean, in a new variable d[n] | n in N.

@zabrinanuramalia4693 3 жыл бұрын

sorry if this has been explained before... can anyone tell me how to the constraints of " visit each of these cities exactly once and come back to the city starts"?

@RaviKant-ll6ck 2 жыл бұрын

How can you say it is an ILP when you are using binary variable xij in the problem? You cannot solve it using ILP model if you try to solve it using GAMS and you write binary variable anywhere in the code.