Core area territory planning for optimizing driver familiarity and route flexibility
First Claim
1. A computer system comprising one or more memory storage areas and one or more processors, the one or more processors configured to:
- (a) electronically select a new driver from a pool of unassigned drivers;
(b) electronically identify a plurality of cells, wherein each of the plurality of cells comprises (i) a portion of a service territory and (ii) a group of one or more stops;
(c) electronically classify one or more of said plurality of cells as core cells in response to a known service volume for each of said core cells exceeding a minimum service volume;
(d) electronically establish one or more core areas, wherein each of said one or more core areas comprises a localized cluster of said one or more core cells;
(e) electronically select a new core area from said one or more core areas based upon a known driver visit frequency by said new driver to each of said one or more core areas;
(f) electronically assign said new driver to service said new core area after selecting said new core area; and
(g) electronically classify said new driver as an assigned driver after assigning said new driver to service said new core area.
0 Assignments
0 Petitions
Accused Products
Abstract
Route planning methods for use by a package delivery service provider are disclosed that satisfy a stochastic daily demand while taking advantage of drivers'"'"' route familiarity over time. A model for estimating the value of driver familiarity is disclosed along with both an empirical and a mathematical model for estimating the value of route consistency, along with a Core Area Route Design which involves the concepts of combinatorial optimization, meta-heuristic algorithms, tabu search heuristics, network formulation modeling, and multi-stage graph modeling. In one embodiment, a service territory is divided into unassigned cells associated with a grid segment involving prior driver delivery stops, and a driver from a pool of unassigned drivers is assigned to a route based on examining each driver'"'"'s grid segment visiting frequency limit with respect to a minimum limit so as to optimize driver selection based on of each driver'"'"'s familiarity with the route.
40 Citations
9 Claims
-
1. A computer system comprising one or more memory storage areas and one or more processors, the one or more processors configured to:
-
(a) electronically select a new driver from a pool of unassigned drivers; (b) electronically identify a plurality of cells, wherein each of the plurality of cells comprises (i) a portion of a service territory and (ii) a group of one or more stops; (c) electronically classify one or more of said plurality of cells as core cells in response to a known service volume for each of said core cells exceeding a minimum service volume; (d) electronically establish one or more core areas, wherein each of said one or more core areas comprises a localized cluster of said one or more core cells; (e) electronically select a new core area from said one or more core areas based upon a known driver visit frequency by said new driver to each of said one or more core areas; (f) electronically assign said new driver to service said new core area after selecting said new core area; and (g) electronically classify said new driver as an assigned driver after assigning said new driver to service said new core area. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
Specification