Grant: Discovery Grants Program - Individual
The University of British Columbia
$43,000.00
Transportation optimization planning for large networks
EF 2024-25
Résumé
In this research program, we aim to study the question of Transportation Planning for Large Networks (TPLN). TPLN answers the question of how to plan the capacity for fulfillment networks (FN) for large e-commerce retailers.
Amidst the covid-19 pandemic, many shoppers have shifted from traditional brick-and-mortar stores to online options. As a result, there has been a large increase in the popularity of e-commerce retail. This shift has changed the way retailers operate.
One of the biggest opportunities that this change in the retail world has provided retailers is the chance to reach a larger customer pool. For example, these platforms enable a seller in BC to sell her products to customers all over Canada much more easily.
Nonetheless, this increase in the size of the customer pool has led to an increase in the size of the FN, as well as an increase in the volume of shipments that are being shipped through the network.
The increase in popularity of online shopping also pushed e-commerce retailers to offer customers shorter delivery time windows, some even offer same-day deliveries. Retailers are left facing the challenge of making quick fulfillment decisions for large volumes of products.
A very important aspect in making these decisions is the impact on the environment due to supply chain structure and fulfillment decisions. Large transportation networks may have long shipping routes that have a high carbon footprint.
We address these challenges through the following research agenda
We propose a new approach to FN capacity planning. The main challenge in planning aanFN capacity comes from the complexity of the problem. Finding an optimal FN capacity that minimizes the monetary costs while restricting the carbon footprint, as well as obeying a set of business restrictions is a hard problem to solve (NP-hard). The first goal of this research is to devise a polynomial time approximation approach that can find a network capacity that is feasible and with near-optimal costs.
We propose an online algorithm for the shipment fulfillment problem. Once customers place their orders, the e-commerce retailer must decide how to fulfill the order through the FC. These decisions must be made within seconds, without any knowledge of future orders. In this research, we aim to design an online algorithm that will minimize the gap between the cost of the online fulfillment plan and the cost of an optimal plan had we known all orders in advance.
We provide a holistic view of the TPLN problem. Thinking of the FN capacity planning and the online assignment problems together, we aim to show the impact of the holistic view of the TPLN problem. Capturing the added value in accounting for the online assignment rule while designing the network can help challenge the traditional separation between the two problems. We borrow the concept of the "cost of anarchy" to capture the costs of considering the two problems separately and aim to estimate them.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
RGPIN-2023-04322
Name nom
Cohen-Hillel, Tamar
Department département
Sauder
Organization id
2
Institution établissement
The University of British Columbia
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2024
Competition year année de concours
2023
Award amount
43000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1509
Committee name en
Civil, Industrial and Systems Engineering
Committee name fr
Génie civil, industriel et des systèmes
Area of application code
520
Area of application group en
Manufacturing processes and products
Area of application group fr
Procédés et produits industriels
Area of application en
Production and operations management
Area of application fr
Production et gestion des opérations
Research subject code
1601
Research subject group en
Industrial engineering
Research subject group fr
Génie industriel
Research subject en
Operations research and management science
Research subject fr
Recherche opérationnelle et science de la gestion
Field of research list names en
Not available
Field of research list names fr
Non disponible
Socioeconomic objective list names en
Not available
Socioeconomic objective list names fr
Non disponible
Application title
Transportation optimization planning for large networks
Keywords
retail logistics; retail optimization; network design; inventory control; online fulfillment
Application summary
In this research program, we aim to study the question of Transportation Planning for Large Networks (TPLN). TPLN answers the question of how to plan the capacity for fulfillment networks (FN) for large e-commerce retailers.
Amidst the covid-19 pandemic, many shoppers have shifted from traditional brick-and-mortar stores to online options. As a result, there has been a large increase in the popularity of e-commerce retail. This shift has changed the way retailers operate.
One of the biggest opportunities that this change in the retail world has provided retailers is the chance to reach a larger customer pool. For example, these platforms enable a seller in BC to sell her products to customers all over Canada much more easily.
Nonetheless, this increase in the size of the customer pool has led to an increase in the size of the FN, as well as an increase in the volume of shipments that are being shipped through the network.
The increase in popularity of online shopping also pushed e-commerce retailers to offer customers shorter delivery time windows, some even offer same-day deliveries. Retailers are left facing the challenge of making quick fulfillment decisions for large volumes of products.
A very important aspect in making these decisions is the impact on the environment due to supply chain structure and fulfillment decisions. Large transportation networks may have long shipping routes that have a high carbon footprint.
We address these challenges through the following research agenda
We propose a new approach to FN capacity planning. The main challenge in planning aanFN capacity comes from the complexity of the problem. Finding an optimal FN capacity that minimizes the monetary costs while restricting the carbon footprint, as well as obeying a set of business restrictions is a hard problem to solve (NP-hard). The first goal of this research is to devise a polynomial time approximation approach that can find a network capacity that is feasible and with near-optimal costs.
We propose an online algorithm for the shipment fulfillment problem. Once customers place their orders, the e-commerce retailer must decide how to fulfill the order through the FC. These decisions must be made within seconds, without any knowledge of future orders. In this research, we aim to design an online algorithm that will minimize the gap between the cost of the online fulfillment plan and the cost of an optimal plan had we known all orders in advance.
We provide a holistic view of the TPLN problem. Thinking of the FN capacity planning and the online assignment problems together, we aim to show the impact of the holistic view of the TPLN problem. Capturing the added value in accounting for the online assignment rule while designing the network can help challenge the traditional separation between the two problems. We borrow the concept of the "cost of anarchy" to capture the costs of considering the two problems separately and aim to estimate them.