Minor correction here 0:49. Only the decision version (i.e. is there a tour with cost less than c) is NP-Complete. The general problem of finding the cheapest tour is NP-Hard, but not NP-complete. Great video regardless!
@Auctux Жыл бұрын
Thanks for the correction
@Auctux3 жыл бұрын
Thanks for watching the video ✌️
@tvybert73292 жыл бұрын
What name of background music at 4:00?
@jujeep32042 жыл бұрын
How to use the code, now I have a little confuse.
@theWorldOfIss Жыл бұрын
How to implement multiple traveling salesman problem using NSGA-2 in python.
@tvybert73292 жыл бұрын
What name of background music at 4:00?
@suzanne43003 жыл бұрын
When intro rolled, I felt like Superman :)
@Auctux3 жыл бұрын
😉 Man of steel
@theWorldOfIss Жыл бұрын
How to solve multiple traveling salesman problem using NSGA-2 in python? Help me brother 🙏🙏🙏
@Auctux Жыл бұрын
I'll try it and let you know .
@patrikpaunovic3130 Жыл бұрын
@@Auctux Did you succeed?
@brigasazura55753 жыл бұрын
Can you make a script for taxiway route in airport??
@Auctux3 жыл бұрын
Can you explain a little bit more ?
@brigasazura55753 жыл бұрын
I have a case. . Taxiway is very important in the airport. Taxiway connected from runaway to Appron. In the airport usually using sistem first come first served. but sometimes it's not efficient and make flights schedule delay. . I want to using genetic algorithm to choose a new efficient trajectory for taxiway, without make a collision in the intersection of taxiway.