Back to results
US 11,386,362 B1Granted
System and method for optimizing waste / recycling collection and delivery routes for service vehicles
AssigneeWm Intellectual Property Holdings, L.L.C.
InventorsSeongbae Kim, Hemachandra Pillutla
Life of this patent
Estimating the term…
Abstract
A system and method for optimizing waste or recycling routes for one or more service vehicles are disclosed. Service providers can determine optimal sets of routes for a fleet of vehicles to traverse in order to service customers more quickly and efficiently. Unique route shapes can be utilized to minimize route overlapping and route balancing can be utilized to produce routes with more manageable daily workloads.
Claims13
A method of optimizing delivery of waste or recycling services to customers using a waste or recycling service vehicle, the method comprising:
- developing, via a computing device, a sequence of two or more census tracts containing customer stops using United States census tract data, wherein developing the sequence of two or more census tracts comprises determining a representing customer stop for each census tract, wherein the representing stop comprises a customer location that is at or near the centroid of the census tract and sequencing the census tracts using the representing stops of each census tract to determine an optimal tract sequence list;
- developing, via the computing device, a travel route for the waste or recycling service vehicle using the sequence of two or more census tracts and a plurality of unrouted customer stops associated with the two or more census tracts;
- communicating the travel route to the waste or recycling service vehicle;
- and
- delivering waste or recycling services to customers along the travel route with the waste or recycling service vehicle,
- wherein developing the travel route for the waste or recycling service vehicle comprises:
- (i) adding all unrouted customer stops from each census tract into the travel route, starting from the first census tract of the optimal tract sequence list, until the travel route has met a defined primary fullness criteria;
- (ii) removing all the added customer stops from the last census tract in (i) where the primary fullness criteria of the travel route has been met;
- (iii) adding all the unrouted customer stops from each census block group belonging to the last census tract in (i) into the travel route, starting from the first block group of the census tract in (i) that is closest to the last census tract in (i) that fulfills the primary fullness criteria, until the travel route has met a defined secondary fullness criteria;
- (iv) removing all the added customer stops from the last census block group in (iii) where the secondary fullness criteria of the travel route has been met;
- (v) adding all the unrouted customer stops from each census block belonging to the last census block group in (iii) into the travel route, starting from the first block of the census block group in (iii) that is closest to the census block group in (iii) that fulfills the primary fullness criteria, until the travel route has met a defined tertiary fullness criteria;
- (vi) determining an optimal sequence of customer stops for the travel route;
- and
- (vii) repeating steps (i)-(vi) starting for the next route starting with the next census block in (v) or next census block group in (iii) or next census tract in (i) depending on which step the fullness criteria is met, until the customer stops are optimally sequenced for the travel route;
- and
- (viii) repeating steps (i)-(vii) until all desired unrouted customer stops in each census tract are routed.
13 more elements
A system for optimizing delivery of waste or recycling services to customers, the system comprising:
- a waste or recycling service vehicle;
- a memory storage area;
- and
- a processor in communication with the memory storage area and configured to:
- develop a sequence of two or more census tracts containing customer stops using United States census tract data, wherein developing the sequence of two or more census tracts comprises determining a representing customer stop for each census tract, wherein the representing stop comprises a customer location that is at or near the centroid of the census tract and sequencing the census tracts using the representing stops of each census tract to determine an optimal tract sequence list,
- develop a travel route for the waste or recycling service vehicle using the sequence of two or more census tracts and a plurality of unrouted customer stops associated with the two or more census tracts, and
- communicate the travel route to the waste or recycling service vehicle;
- wherein the processor is further configured to
- (i) add all unrouted customer stops from each census tract into the travel route, starting from the first census tract of the optimal tract sequence list, until the travel route has met a defined primary fullness criteria;
- (ii) remove all the added customer stops from the last census tract in (i) where the primary fullness criteria of the travel route has been met;
- (iii) add all the unrouted customer stops from each census block group belonging to the last census tract in (i) into the travel route, starting from the first block group of the census tract in (i) that is closest to the last census tract in (i) that fulfills the primary fullness criteria, until the travel route has met a defined secondary fullness criteria;
- (iv) remove all the added customer stops from the last census block group in (iii) where the secondary fullness criteria of the travel route has been met;
- (v) add all the unrouted customer stops from each census block belonging to the last census block group in (iii) into the travel route, starting from the first block of the census block group in (iii) that is closest to the census block group in (iii) that fulfills the primary fullness criteria, until the travel route has met a defined tertiary fullness criteria;
- (vi) determine an optimal sequence of customer stops for the travel route;
- (vii) repeat steps (i)-(vi) starting for the next route starting with the next census block in (v) or next census block group in (iii) or next census tract in (i) depending on which step the fullness criteria is met, until the customer stops are optimally sequenced for the travel route;
- and
- (viii) repeat steps (i)-(vii) until all desired unrouted customer stops in each census tract are routed.
14 more elements
Dependencies are inferred from the claim text.