The FedEx problem

DOI10.4169/074683410X488719MaRDI QIDQ2999695zbMATH OpenFDO

Authors Kent E. Morrison

Publication date 16 May 2011

Published in The College Mathematics Journal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1410.6723

zbMATH Keywords

arithmetic meanmathematical applicationsmedianminimization of distancesoptimization

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Operations research, economics (aspects of mathematics education) (97M40)

Abstract: The original shipping strategy of FedEx is to fly all packages to a hub location during the afternoon and evening, sort them there, and then fly them to their destinations during the night for delivery the next day. This leads to interesting mathematical questions: Given a population represented by points in Euclidean space or on a sphere, what is the location of the point of the hub that minimizes the total distance to all the points? Is such a point unique? Then using census data from 2000 we examine how close the FedEx hub in Memphis is to the hub for the U.S. population.

Recommendations

• ON THE AIRLINE HUB PROBLEM : THE CONTINUOUS MODEL
• Spatial analysis of single allocation hub location problems
• Hub Location and the p-Hub Median Problem
• Median problems in networks
• A hub covering model for cargo delivery systems

Cited in

(2)

• The concrete delivery problem
• On the location of the minimum point in the Euclidean distance sum problem

This page was built for publication: The FedEx problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999695)