Shortest route calculation (ID:3330)
Project Creator: |
chab
FC Member For 6609 Days
Credits 20 Completed Proj. Num. 0 / 2 Total payment USD Avg Daily Online 0.00 h (From 21/5/2007) Available on MSN/Skype No Last Login 10/29/2007 Peers Rating 0.00% ![]() ![]() ![]() |
---|---|
Budget: | Not Sure/Confidential |
Created: | 10/26/2007 8:10:48 AM EST |
Bidding Ends: | 12/25/2007 8:10:48 AM EST ( Expired ) |
Development Cycle: | 100 Days |
Bid Count: | 15
|
Average Bid: | 4,226.73 |
Project Description:
We are looking for a software developer to continue the development of our "journey planner application". It is an Internet service which may resemble the one developed by Google Transit Labs. The goal of the product is not only to find the shortest path from one point to another but to find the shortest path between two points under a set of specified conditions. For instance, we wish to know the shortest path between A and B using rail transportation compared to using a car, or using a combination of rail and car, etc. Our company has developed an algorithm which is a variant of the A-star algorithm that allows for a specified set of constraints to be taken into account. First, some java classes of the util package are delivered. Those are general purpose classes to solve classical mathematical or algorithmic problems. The rest is a set of Java classes. The input file is a tab separated export available from a mapping application. The import is run by the testBuild method of the GraphBuilderTest class. An extensive number of tests have been written for the classes. Those are JUnit tests. However, some of the tests have been using nodes unique identifiers. Unfortunately, successive versions of the databases have modified those identifiers. Such tests are very easy to spot in the code. We would like to underline that testing is important, given the very high number of cases and the sensibility of the results to some of the parameters. In this project, the only database used is mysql, with always the same user. As a final word, one key to the performances of the application is to load all data in memory. Indeed, the database for a large city and its extended suburbs is still small enough to fit into a couple hundred megabytes of Java objects. That is why each of the applications developed by our company start by loading the entire database in a stateless repository. It is important to remember that this repository should be kept stateless such that it can be used by concurrent users. The application will be based on the geographical data which our company compiles for various countries and cities in the world. We would work over the Internet as we are based in Copenhagen, based on the specs and files that I will send you. Are you interested and what is your fee ? |
|
Job Type | Java, JSP |
Attached Files: | N/A |