A travelling salesman adaptation implemented in C#. This projects solves the travelling salesman problem in two ways; heuristic (approximation)and Genatic Algorithm.
-
Download the repository or Fork the repository.
-
Navigate to the repository folder.
-
Open commandline in current folder and navigate to FlyingPostMan/bin/Release directory.
-
Call the FlyingPostMan.exe as following:
flying-postman.exe mail.txt boeing-spec.txt 23:00 –o output_itinerary_file_name.txtwhere mail.txt is the location points and boeing-spec.txt are plane specifications and -o is output flag