Create Neo4j database of airline routes and airports. Implement Dijkstra algorithm to find shortest path for flights with available seats.
$30-250 USD
Closed
Posted over 9 years ago
$30-250 USD
Paid on delivery
Hello Freelancers,
Important: please reply only if you have experience with graph databases, I don’t want to waste your or my time for automatic bids.
I’m looking for a freelancer with Neo4j/graph database experience to create Neo4j database of airports, airlines and routes connected together. Basically a big traversable graph which I can search.
List of airports, airlines and routes will be provided.
You will need to implement Deikstra algorithm for the shortest path search of available flights with couple of filters (sort by shortest travel time, airline rating, alliance).Please keep in mind there is min/max connection time for each airport. As far as I know shortest path algorithms (deijkstra and A*) are already packaged into Neo4j, so you it should be pretty easy to call.
Final product will have simple console where I can enter origin/destination airport, date and click search. Results will include shortest path routing (I believe you can use Gephi to visualize it).
Here are couple of similar projects that I've found
[login to view URL]
[login to view URL]
[login to view URL]
Now, database content
Nodes- airports
Attributes:
AirportID Unique identifier for this airport
Long name- (ex. London Heathrow international airport)
IATA name - LHR (3 digit airport code)
City
Country
Timezone – Hours offset from UTC. Fractional hours are expressed as decimals, eg. India is 5.5.
Latitude
Longitude
DST Daylight savings time. One of E (Europe), A (US/Canada), S (South America), O (Australia), Z (New Zealand), N (None) or U (Unknown)
Minimum connection time: default 2 hours
Airlines
Airline ID Unique identifier for this airline
Name Name of the airline
Airline code 2 letter IATA code
Airline rating: 1-5 stars, could contain decimals
Country –country where airline incorporated
Active Y if airline still operational N if defunct
Alliance: SkyTeam, Star Alliance, One world, other
Edges- Routes
Attributes:
Airline ID Unique identifier for airline
AirlineCode: UA
Flight number: UA520 BA1355
Source airport SFO
Source airport ID Unique identifier for source airport
Destination airport : LHR
Destination airport ID Unique identifier for destination airport
Dep time 18:20 dec 1 2013
Arrival time 7:00 Dec 2 2013
Duration 10 hours 20 mins
Distance 7.000 miles
Date range: today +355 dates ahead
Equipment B747
First class availability FS3+
Business class availability CS2+
Economy YS9+
Search method: Star alliance, Skyteam , OneWorld
Time last updated
Thanks for reading this!
Cheers,
Dennis
Hi, i read your requirements, i am so interested in your project. you check my completed projects and my profile. i have experience in java and database design. i am sure, i can solve your requirements. I would like to discuss with you about the project. Thanks you! Taytayvn
Hi.
I have not created a graph database before, but I know the theory behind them. Also I have great experience with other NoSQL database: MongoDB document database. I know I can make this project for you for sure. I am very interested in it!
Also I am a computer scientist graduated at University of Havana and have wide knowledge in algorithms including finding shortest paths.
Best regards.