X/Y coordinate algorithm

Public Clarification Board

• 
  Contest Holder

  • 12 years ago

  Thanks all who submitted their proposals, very smart guys! Thanks.

  • 12 years ago
• 

  Istehsanimtenan

  • 12 years ago

  How could I enter bid for

  • 12 years ago
• 
  Contest Holder

  • 12 years ago

  Dear Freelancers, thanks for your submissions so far. I prepared a sample data file, which can be used as the input data for the algorithm, see: https://www.dropbox.com/s/jktgu79xppcxxvu/sample_data_uusimaaProvince.txt. Let's say the amount of jumps would be 40 for example, so by using this as the source, the outcome would be 26 solution files, each having 40 jumps sequence in them and each would start with a different starting node. That should be the name of of the output file as well, so "askola.txt", "hanko.txt" etc... - Thanks again, I will be awarding to job within couple of days.

  • 12 years ago
• 
  Contest Holder

  • 12 years ago

  One further requirement:the program should iterate through the datafile as many times as there are nodes available: on each iteration it should automatically set the next node as the start node and generate output file. So, for example: if the source data contains 8 nodes, it should generate 8 output files; one for each starting node.

  • 12 years ago
  1. 

     ArmanEngineer

     • 12 years ago

     Thank you for your feedback.
     Actually, TSP itself is not very useful but is instead a model for many closely related optimization problems. All these problems have different constraints, just like yours. However, they can all be solved using the same techniques in TSP. Depending on how exactly your problem is formulated (like number of vertices exceeding the number of edges) and how you want the program to generate the outputs (like 8 solution for 8 nodes) the program can produce needed results.
     These are all minor adjustments in the algorithm.

     • 12 years ago