| Product |
Performance |
| Computation time to solve problem with 50 routes, 1,000 stops, two-hour hard-time windows (specify platform for calculations and any other assumptions): |
What types of algorithms are employed (open-ended)? |
| ArcLogistics |
< 5 Minutes |
Proprietary |
| Descartes Routing, Mobile & Telematics Suite |
less than 1 minute |
Proprietary |
| DISC |
A few seconds typically |
|
| IBM ILOG Transportation Analyst |
Between 2-120 minutes |
Heuristics and Constraint Programmi |
| JOpt.AAS |
5 Minutes |
Construction, SA, GA |
| JOpt.SDK |
5 Minutes |
Construction, SA, GA |
| Optrak vehicle routing software |
5+ minutes for a standard PC |
Various heuristics |
| Paragon Routing and Scheduling Optimizer |
Around 2 minutes |
Cost saved & improvement algorithms |
| Roadnet Transportation Suite |
<30 seconds |
Heuristic algorithms are employed |
| StreetSync Basic |
< 10 Minutes |
Proprietary |
| StreetSync Desktop |
< 10 Minutes |
Proprietary |
| StreetSync Pro |
< 10 Minutes |
Proprietary |
| TMW Appian Direct Route |
<3 minutres |
proprietary |
| TruckStops VRS |
User settable, min 1-5 minutes |
Proprietary heuristics |
| WebSTARS 5.4 |
1 - 3 minutes on a PC |
local serach, integer programming |