Corpus ID: 237492244

A Scalable Last-Mile Delivery Service: From Simulation to Scaled Experiment

  title={A Scalable Last-Mile Delivery Service: From Simulation to Scaled Experiment},
  author={Meera Ratnagiri and Clare O'Dwyer and Logan E. Beaver and Heeseung Bang and Behdad Chalaki and Andreas A. Malikopoulos},
In this paper, we investigate the problem of a last-mile delivery service that selects up to N available vehicles to deliver M packages from a centralized depot to M delivery locations. The objective of the last-mile delivery service is to jointly maximize customer satisfaction (minimize delivery time) and minimize operating cost (minimize total travel time) by selecting the optimal number of vehicles to perform the deliveries. We model this as an assignment (vehicles to packages) and path… Expand

Figures from this paper


Multi-Objective Optimization of Bike Routes for Last-Mile Package Delivery with Drop-Offs
Conclusions drawn from this study show that MOCell is the best method for the proposed problem, reaching routes that balance the considered three objectives in a more Pareto-optimal fashion than the rest of counterparts in the benchmark. Expand
Towards enhancing the last-mile delivery: An effective crowd-tasking model with scalable solutions
In urban logistics, the last-mile delivery from the warehouse to the consumer’s home has become more and more challenging with the continuous growth of E-commerce. It requires elaborate planning andExpand
The Multi-objective Dynamic Traveling Salesman Problem: Last Mile Delivery with Unmanned Aerial Vehicles Assistance
An approach to optimizing the last-mile delivery route of a truck using coordination with unmanned aerial vehicles (UAVs) is presented, and a genetic algorithm is used to solve these problems. Expand
Identifying the Optimal Packing and Routing to Improve Last-Mile Delivery Using Cargo Bicycles
Methods developed in order to solve a combination of problems for cargo bicycle logistics, including efficient packing, routing and load-dependent speed constraints, are described. Expand
FL-MTSP: a fuzzy logic approach to solve the multi-objective multiple traveling salesman problem for multi-robot systems
Extensive simulations show that the proposed fuzzy logic approach, FL-MTSP, outperforms an existing centralized Genetic Algorithm in terms of providing a good trade-off of the two performance metrics of interest. Expand
The multiple traveling salesman problem: an overview of formulations and solution procedures
The multiple traveling salesman problem (mTSP) is a generalization of the well-known traveling salesman problem (TSP), where more than one salesman is allowed to be used in the solution. Moreover,Expand
Research on MTSP Problem based on Simulated Annealing
This paper focuses on a kind of MTSP that takes time as only optimal objective to build the model, and it is solved by using Simulated Annealing Algorithm (SA). Expand
A Location Based Heuristic for General Routing Problems
This work presents a general framework for modeling routing problems based on formulating them as a traditional location problem called the capacitated concentrator location problem and shows that the heuristic performs well for both problems and outperforms all published heuristics on a set of standard test problems. Expand
Ant Colony Optimization With an Improved Pheromone Model for Solving MTSP With Capacity and Time Window Constraint
This paper designs a novel hybrid algorithm by combining the minimum spanning 1-tree with ACO to find the optimal solution, and improves the pheromone update rules to increase the search efficiency of ACO algorithm. Expand
Car4Pac: Last Mile Parcel Delivery Through Intelligent Car Trip Sharing
Car4Pac, an intelligent last mile parcel delivery system to address the major challenges in how to accurately estimate the parcel delivery trip cost and assign proper tasks to suitable car trips to maximize the overall performance is developed. Expand