| CPC H04L 1/1854 (2013.01) [H04L 49/3009 (2013.01); H04W 84/12 (2013.01)] | 21 Claims |

|
1. A method of optimizing scheduling and dispatching of a plurality of riders/vehicles to visit a plurality of destinations, the method comprising:
storing in a computer-readable memory medium a schedule data structure including a schedule of visits to the plurality of destinations over a plurality of weeks, the visits being associated with respective rider/vehicle identification (RVID) parameters each corresponding to one of the plurality of riders/vehicles, the schedule of visits being optimized for one or more parameters but non-optimized for mirroring;
breaking the schedule data structure into a first part and a second part, the first part including only visits associated with a particular one of the RVID parameters, the second part including only visits not associated with the particular one of the RVID parameters;
determining a modified first part, the modified first part being modified according to a permutation of unique days/week of the first part;
appending the modified first part with the second part to provide a modified schedule data structure;
repeating the breaking, the determining and the appending for each of the RVID parameters to provide a plurality of modified schedule data structures, the plurality including the modified schedule data structure;
determining from the plurality of modified schedule data structures a mirroring-improved schedule data structure; and
providing the mirroring-improved schedule data structure to control dispatch of the plurality of riders/vehicles.
|