CODEWITHSUNDEEP
algorithmgraph
pk8382
pk8382

Reputation: 21

Algorithms suited for Traversing locations for optimized path

I am developing an Application which will allocate Cabs to the Employees.The pickup location will be office location for everyone and Drop Location can be any location in the City.Which algorithm like BFS, DFS can i use which will give me the optimized path which will help me to optimize the cost Expenditure. Any Suggestion is Welcome and highly appreciated

Upvotes: 0

Views: 43

Answers (1)

Tryer
Tryer

Reputation: 4050

Problem, as stated, is too short of details to be given a specific answer. Some general pointers follow that may be helpful.

There is a class of problems within Vehicle Routing Problem literature that deals with pickup and delivery problems.

Within these problems, there are problems further classified based on whether or not there exist time windows for pickup and/or delivery.

None of the simple algorithms you have in mind BFS/DFS can give you an optimized solution since the Vehicle Routing Problem is rather difficult to solve practically. It is NP-Hard. The Travelling Salesman Problem is a special case of the Vehicle Routing Problem.

Upvotes: 1

Related Questions