Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs

Faisal Alkaabneh, Ali Diabat, Huaizhu Oliver Gao

Research output: Contribution to journalArticle

Abstract

We consider the problem of inventory routing in the context of perishable products and find near-optimal replenishment scheduling and vehicle routes when the objective is to maximize the supplier's profit and minimize the costs due to fuel consumption, inventory holding, and greenhouse gas emissions. Greenhouse gas emissions are calculated as a function of fuel consumed, and fuel consumption levels are accurately calculated as a function of vehicle speed, load and traveled distance. To solve the problem efficiently, we develop an exact method based on Benders decomposition to find high-quality solutions in reasonable time. To enhance the convergence rate of the Benders decomposition algorithm, we present several acceleration strategies, such as addition of valid inequalities to the master problem and warm-up start. The warm-up start acceleration strategy itself is a meta-heuristic based on the greedy random adaptive search procedure (GRASP) and mathematical programming formulations. We present computational results which illustrate the superior performance of the proposed solution methodology in solving large-scale instances with 60 customers and 6 planning periods with 4 vehicles using Benders decomposition. Additionally, we show that utilizing a more comprehensive model to calculate the fuel cost results in fuel savings of 2 to 11% on the tested instances compared to traditional models that assume that the fuel cost is solely a function of the distance traveled during delivery.

Original languageEnglish (US)
Article number104751
JournalComputers and Operations Research
Volume113
DOIs
StatePublished - Jan 1 2020

Fingerprint

Benders Decomposition
Vehicle routing
Vehicle Routing Problem
Decomposition
Costs
Gas emissions
Greenhouse gases
Fuel consumption
Greenhouse Gases
Mathematical programming
Profitability
Optimal Scheduling
Valid Inequalities
Exact Method
Scheduling
Decomposition Algorithm
Mathematical Programming
Metaheuristics
Planning
Profit

Keywords

  • Benders decomposition
  • Food/agriculture supply chain
  • GRASP meta-heuristic
  • Inventory-routing
  • Last mile logistics
  • Perishable products

ASJC Scopus subject areas

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research

Cite this

Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs. / Alkaabneh, Faisal; Diabat, Ali; Gao, Huaizhu Oliver.

In: Computers and Operations Research, Vol. 113, 104751, 01.01.2020.

Research output: Contribution to journalArticle

@article{e4cb77ee4a074379b95c9518eb02c773,
title = "Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs",
abstract = "We consider the problem of inventory routing in the context of perishable products and find near-optimal replenishment scheduling and vehicle routes when the objective is to maximize the supplier's profit and minimize the costs due to fuel consumption, inventory holding, and greenhouse gas emissions. Greenhouse gas emissions are calculated as a function of fuel consumed, and fuel consumption levels are accurately calculated as a function of vehicle speed, load and traveled distance. To solve the problem efficiently, we develop an exact method based on Benders decomposition to find high-quality solutions in reasonable time. To enhance the convergence rate of the Benders decomposition algorithm, we present several acceleration strategies, such as addition of valid inequalities to the master problem and warm-up start. The warm-up start acceleration strategy itself is a meta-heuristic based on the greedy random adaptive search procedure (GRASP) and mathematical programming formulations. We present computational results which illustrate the superior performance of the proposed solution methodology in solving large-scale instances with 60 customers and 6 planning periods with 4 vehicles using Benders decomposition. Additionally, we show that utilizing a more comprehensive model to calculate the fuel cost results in fuel savings of 2 to 11{\%} on the tested instances compared to traditional models that assume that the fuel cost is solely a function of the distance traveled during delivery.",
keywords = "Benders decomposition, Food/agriculture supply chain, GRASP meta-heuristic, Inventory-routing, Last mile logistics, Perishable products",
author = "Faisal Alkaabneh and Ali Diabat and Gao, {Huaizhu Oliver}",
year = "2020",
month = "1",
day = "1",
doi = "10.1016/j.cor.2019.07.009",
language = "English (US)",
volume = "113",
journal = "Surveys in Operations Research and Management Science",
issn = "0305-0548",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs

AU - Alkaabneh, Faisal

AU - Diabat, Ali

AU - Gao, Huaizhu Oliver

PY - 2020/1/1

Y1 - 2020/1/1

N2 - We consider the problem of inventory routing in the context of perishable products and find near-optimal replenishment scheduling and vehicle routes when the objective is to maximize the supplier's profit and minimize the costs due to fuel consumption, inventory holding, and greenhouse gas emissions. Greenhouse gas emissions are calculated as a function of fuel consumed, and fuel consumption levels are accurately calculated as a function of vehicle speed, load and traveled distance. To solve the problem efficiently, we develop an exact method based on Benders decomposition to find high-quality solutions in reasonable time. To enhance the convergence rate of the Benders decomposition algorithm, we present several acceleration strategies, such as addition of valid inequalities to the master problem and warm-up start. The warm-up start acceleration strategy itself is a meta-heuristic based on the greedy random adaptive search procedure (GRASP) and mathematical programming formulations. We present computational results which illustrate the superior performance of the proposed solution methodology in solving large-scale instances with 60 customers and 6 planning periods with 4 vehicles using Benders decomposition. Additionally, we show that utilizing a more comprehensive model to calculate the fuel cost results in fuel savings of 2 to 11% on the tested instances compared to traditional models that assume that the fuel cost is solely a function of the distance traveled during delivery.

AB - We consider the problem of inventory routing in the context of perishable products and find near-optimal replenishment scheduling and vehicle routes when the objective is to maximize the supplier's profit and minimize the costs due to fuel consumption, inventory holding, and greenhouse gas emissions. Greenhouse gas emissions are calculated as a function of fuel consumed, and fuel consumption levels are accurately calculated as a function of vehicle speed, load and traveled distance. To solve the problem efficiently, we develop an exact method based on Benders decomposition to find high-quality solutions in reasonable time. To enhance the convergence rate of the Benders decomposition algorithm, we present several acceleration strategies, such as addition of valid inequalities to the master problem and warm-up start. The warm-up start acceleration strategy itself is a meta-heuristic based on the greedy random adaptive search procedure (GRASP) and mathematical programming formulations. We present computational results which illustrate the superior performance of the proposed solution methodology in solving large-scale instances with 60 customers and 6 planning periods with 4 vehicles using Benders decomposition. Additionally, we show that utilizing a more comprehensive model to calculate the fuel cost results in fuel savings of 2 to 11% on the tested instances compared to traditional models that assume that the fuel cost is solely a function of the distance traveled during delivery.

KW - Benders decomposition

KW - Food/agriculture supply chain

KW - GRASP meta-heuristic

KW - Inventory-routing

KW - Last mile logistics

KW - Perishable products

UR - http://www.scopus.com/inward/record.url?scp=85072185477&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85072185477&partnerID=8YFLogxK

U2 - 10.1016/j.cor.2019.07.009

DO - 10.1016/j.cor.2019.07.009

M3 - Article

AN - SCOPUS:85072185477

VL - 113

JO - Surveys in Operations Research and Management Science

JF - Surveys in Operations Research and Management Science

SN - 0305-0548

M1 - 104751

ER -