Efficient same day package return routing with distributed fleet

A method comprising:

• receiving, by a server computer, data relating to a first plurality of delivery orders for perishable food items from first service providers to first end users, and data relating to a second plurality of delivery orders from second end users to second service providers, wherein the first service providers are restaurants, wherein the data relating to the first plurality of delivery orders is received from delivery applications installed on one or more end user devices or a website accessed by the one or more end user devices over a communications network, wherein the first plurality of delivery orders comprise food delivery orders from the restaurants, and wherein the second plurality of delivery orders comprise return orders comprising non-perishable items;
• determining, by the server computer, a first plurality of routes corresponding to the first plurality of delivery orders from the first service providers to the first end users;
• determining, by the server computer, a second plurality of routes corresponding to the second end users to the second service providers;
• generating, by the server computer, a plurality of order bundles comprising combinations of the first plurality of routes and the second plurality of routes;
• scoring, by the server computer, each of the combinations of the routes using a composite scoring algorithm that determines a plurality of scores based on a first lateness score modified by a first force multiplier and a first delivery time score for a first route in the first plurality of routes, and a second lateness score modified by a second force multiplier and a second delivery time score for a second route in the second plurality of routes, wherein the first force multiplier is greater than the second force multiplier, wherein the first force multiplier is based on the an item being perishable and the second force multiplier is based on an item being non-perishable, and the first delivery time score is equal to a difference between a first calculated drop-off time at a first drop-off location and an estimated time that a transporter will arrive at the first drop-off location, and the first lateness score is equal to the first time delivery score multiplied by the first force multiplier, and the second delivery time score is equal to a difference between a second calculated drop-off time at a second drop-off location and an estimated time that the transporter will arrive at the second drop-off location, and the second lateness score is equal to the second delivery time score multiplied by the second force multiplier;
• determining, by the server computer, a set of optimal route plans by selecting the combinations of the routes with the lowest scores;
• receiving, by the server computer, acceptances from one or more transporters that will execute the set of optimal route plans;
• routing, by the server computer, the transporters according to the set of optimal route plans, wherein the transporters are autonomous vehicles;
• and
• moving, by the autonomous vehicles, according to the routing according to the set of optimal route plans.