Darp : Dial-a-Ride problem instances solve pickup and drop-off scheduling and trip assignment problem. This approach follows a tabu heuristic search algorithm to find the sub-optimal solution. This is an efficient of solving the problem considering the original MIP problem becomes increasingly difficult to solve under all scenarios.
-
Notifications
You must be signed in to change notification settings - Fork 0
lavkeshg/DARP
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published