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!
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.
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!
Thanks for the correction
Keep it up auctux
Thanks for watching the video ✌️
What name of background music at 4:00?
well done @Auctux
Merci prof
How to implement multiple traveling salesman problem using NSGA-2 in python.
How to use the code, now I have a little confuse.
When intro rolled, I felt like Superman :)
😉 Man of steel
What name of background music at 4:00?
How to solve multiple traveling salesman problem using NSGA-2 in python? Help me brother 🙏🙏🙏
I'll try it and let you know .
@@Auctux Did you succeed?
Can you make a script for taxiway route in airport??
Can you explain a little bit more ?
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.
I'm a littlebit confuse in fitness function too.