Get Help:Ask a Question in our Forums|Report a Bug|More Help Resources
Last post Feb 03, 2013 06:34 AM by mohan089
Feb 03, 2013 06:34 AM|LINK
I am really mess up with all the algorithms related to vehicle routing.
I looked in to Dijkstra's algorithm,TSP(Traveling sales Problem), Multi Vehicle Routing Problem and some others.
I quite unaware which one is better suits for me.
Let me explain my requirements.
1.It's all about vehicle transportation system. 2.We have all the trips with Pickup locations and drop up locations and pickup times and drop up times. 3.We have the vehicles with their start location and start time. 4.Agency assign the vehicles to the trips.
5.We need to write a algorithm for assigning best fit trips to that vehicle by considering the vehicle locations and trip locations vehicle start time Basically agency choose a vehicle.The system should run the algorithm and display the trips which could be
assigned to that vehicle.
While displaying the trips we should consider the following aspects -> Display the trips whose trips pickup location is vehicle location or near by locations. and also the trips starts at the same time vehicle starts. ->While grouping the trips the driver
should able to reach the next pickup location with in the time of next pickup time as reserved. ->consider the vehicle capacity
I am really thank full to you if somebody provides the open source code in c# similar to this kind requirements.Because i am not good at data structures.