Automated location visit schedule optimization
US12335051B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Sep 7, 2022 |
| Grant date | Jun 17, 2025 |
| Priority date | — |
| Expiry date | Dec 21, 2043 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04W84/12
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A schedule data structure includes a schedule of visits to a plurality of destinations over a plurality of weeks, the visits being associated with respective rider/vehicle identification (RVID) parameters corresponding to one of the plurality of riders/vehicles. The schedule may be optimized for multiple parameters but non-optimized for mirroring. The schedule data structure may be broken into a first part and a second part. A permutation of the first part may be determined and appended with the second part. A mirroring-improved schedule data structure may be determined in response to iterated permutation and appending.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.