UPS Optimizes Delivery Routes

@article{Holland2017UPSOD,
  title={UPS Optimizes Delivery Routes},
  author={Chuck Holland and Jack Levis and Ranganath Nuggehalli and Bob Santilli and Jeffery Winters},
  journal={Interfaces},
  year={2017},
  volume={47},
  pages={8-23}
}
UPS, the leading logistics provider in the world, and long known for its penchant for efficiency, embarked on a journey to streamline and modernize its pickup and delivery operations in 2003. This journey resulted in a suite of systems, including a meta-heuristic optimization system, which it called "On Road Integrated Optimization and Navigation" ORION. Every day, ORION provides an optimized route for each of UPS' 55,000 U.S. drivers based on the packages to be picked up and delivered on that… Expand

Figures and Tables from this paper

Designing a drone delivery network with automated battery swapping machines
TLDR
This study proposes a drone delivery network design using automated battery swapping machines (ABSMs) to extend ranges, and builds a mixed-integer nonlinear program that captures the nonlinear waiting time of drones at ABSMs. Expand
Last-Mile Shared Delivery: A Discrete Sequential Packing Approach
We propose a model for optimizing the last-mile delivery of n packages, from a distribution center to their final recipients, using a strategy that combines the use of ride-sharing platforms (e.g.,Expand
Individually Optimized Commercial Road Transport: A Decision Support System for Customizable Routing Problems
The Vehicle Routing Problem (VRP) in its manifold variants is widely discussed in scientific literature. We investigate related optimization models and solution methods to determine the state ofExpand
Finding robust and consistent space-time delivery paths for multi-day vehicle routing problem*
TLDR
A multi-commodity network flow-based optimization model is proposed to minimize generalized transportation costs and the daily deviation of day-dependent space-time paths among demand analysis zones and Lagrange relaxation methods and alternating direction method of multipliers are used to handle complex side constraints. Expand
An Optimization Approach to the Ordering Phase of an Attended Home Delivery Service
TLDR
This work considers an AHD system that runs the online grocery shopping service of an international grocery retailer and proposes a solution approach that allows to (non-stochastically) determine which delivery time windows can be offered to potential customers. Expand
Districting for parcel delivery services – A two-Stage solution approach and a real-World case study
TLDR
A novel two-stage districting approach is proposed, which establishes delivery districts in the first stage and adapts them to the daily demand realizations in the second stage, and highlights the differences between the three first stage models. Expand
Integrated scheduling of m-truck, m-drone, and m-depot constrained by time-window, drop-pickup, and m-visit using constraint programming
TLDR
This study extends the parallel drone scheduling traveling salesman problem by considering two different types of drone tasks: drop and pickup, and proposes a constraint programming approach that gives a framework to effectively consider those operational challenges. Expand
Simulation-Based Optimization Tool for Field Service Planning
TLDR
This work provides a simulation-based optimization tool to support decision makers in tackling the challenge of evaluating different design choices, related to staffing decisions, technician scheduling strategies, and technological improvements to make the system more efficient. Expand
SIMULATION-BASED OPTIMIZATION TOOL FOR FIELD SERVICE PLANNING
Many companies that deliver units to customer premises need to provide periodical maintenance and services on request by their field service technicians. A common challenge is to evaluate differentExpand
Minimizing energy and cost in range-limited drone deliveries with speed optimization
TLDR
The paper presents a nonlinear model for the ERDDP, which minimizes the total operational cost including an explicit calculation of the energy consumption of the drone as a function of the Drone speed. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 19 REFERENCES
The Consistent Vehicle Routing Problem
TLDR
This paper forms the problem as a mixed- integer program and develops an algorithm to solve the consistent VRP that is based on the record-to-record travel algorithm, and compares the performance of the algorithm to the optimal mixed-integer program solutions for a set of small problems. Expand
A Model and Algorithm for the Courier Delivery Problem with Uncertainty
TLDR
An insertion-based solution heuristic, called master and daily scheduler (MADS), and a tabu search improvement procedure are developed and computational results show that the heuristic improves the similarity of routes and the lateness penalty at the expense of increased total time spent when compared to a solution of independently scheduling each day. Expand
Vehicle routing problems in which consistency considerations are important: A survey
TLDR
This article surveys literature that addresses service consistency in vehicle routing according to three consistency features: arrival time consistency, person-oriented consistency, and delivery consistency and examines the increase in cost of improving service consistency. Expand
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows
TLDR
This paper presents a heuristic for the pickup and delivery problem based on an extension of the large neighborhood search heuristic previously suggested for solving the vehicle routing problem with time windows that is very robust and is able to adapt to various instance characteristics. Expand
Probabilistic Traveling Salesman Problem with Deadlines
TLDR
The PTSPD is an extension of the well-known probabilistic traveling salesman problem (PTSP) in which, in addition to stochastic presence, customers must also be visited before a known deadline. Expand
A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows
TLDR
An extended formulation for the traveling salesman problem with time windows based on partitioning the time windows into subwindows that the authors call buckets is presented and the LP relaxation of this formulation yields strong lower bounds for the TSPTW and provides a good starting point for the branch-and-cut algorithm. Expand
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric traveling-salesman problem. The procedure is based on a generalExpand
Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods
TLDR
A review with some limited of exacts, heuristics and metaheuristics methods for the vehicle routing problem time windows (VRPTW), which has model character in many branches of mathematics, computer science, and operations research. Expand
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School, Schloß Dagstuhl, Germany, 15-19 May 2000]
TLDR
This paper discusses branch-and-Cut Algorithms for Combinatorial Optimization and their Implementation in ABACUS, and TSP Cuts Which Do Not Conform to the Template Paradigm. Expand
Simulated annealing: Practice versus theory
TLDR
Using the author's Adaptive Simulated Annealing (ASA) code, some examples are given which demonstrate how SQ can be much faster than SA without sacrificing accuracy. Expand
...
1
2
...