Optimization of two-stage location–routing–inventory problem with time-windows in food distribution network

Chao Chen, Zhihui Tian, Yao Baozhen (Corresponding author)

Research output: Contribution to journalArticleAcademicpeer-review

8 Citations (Scopus)

Abstract

High transportation cost and low service quality are common weaknesses in different logistics networks, especially in food delivery. Due to its perishable features, the quality of the food will deteriorate during the while delivery process. In this paper, a two-stage location–routing–inventory problem with time windows (2S-LRITW) for food products is proposed. The first stage corresponds to a location–routing–inventory problem with time windows and the second stage is the transportation problem with vehicle capacity constraints. The problem is formulated as a mixed integer-programming model. Then a hybrid heuristic is proposed, in which distance-based clustering approach, mutation operation and the relocate exchange method are introduced to improve performance of algorithm. At last, the hybrid heuristic was tested using several cases, including some small instances and a real-life case. The results show that the distance-based clustering approach can efficiently improve the convergence speed. And the IACO and the relocate exchange method can enlarge the search space. As a result, the hybrid heuristic is suitable for solving practical larger scale problem. Furthermore, the results also indicate that customer sequence has great effect on the object due to the energy cost considered.
Original languageEnglish
Pages (from-to)111-134
Number of pages24
JournalAnnals of Operations Research
Volume273
Issue number1-2
DOIs
Publication statusPublished - 15 May 2017
Externally publishedYes

Fingerprint

Heuristics
Time windows
Distribution network
Food
Clustering
Service quality
Convergence speed
Transportation problem
Mixed integer programming
Capacity constraints
Energy cost
Logistics
Transportation costs
Food products
Mutation

Keywords

  • Location–routing–inventory problem with time-windows (LRITW) Food distribution IACO Clustering
  • Food distribution
  • IACO

Cite this

@article{422c894dd2cd4eac9c1c589beed575ba,
title = "Optimization of two-stage location–routing–inventory problem with time-windows in food distribution network",
abstract = "High transportation cost and low service quality are common weaknesses in different logistics networks, especially in food delivery. Due to its perishable features, the quality of the food will deteriorate during the while delivery process. In this paper, a two-stage location–routing–inventory problem with time windows (2S-LRITW) for food products is proposed. The first stage corresponds to a location–routing–inventory problem with time windows and the second stage is the transportation problem with vehicle capacity constraints. The problem is formulated as a mixed integer-programming model. Then a hybrid heuristic is proposed, in which distance-based clustering approach, mutation operation and the relocate exchange method are introduced to improve performance of algorithm. At last, the hybrid heuristic was tested using several cases, including some small instances and a real-life case. The results show that the distance-based clustering approach can efficiently improve the convergence speed. And the IACO and the relocate exchange method can enlarge the search space. As a result, the hybrid heuristic is suitable for solving practical larger scale problem. Furthermore, the results also indicate that customer sequence has great effect on the object due to the energy cost considered.",
keywords = "Location–routing–inventory problem with time-windows (LRITW) Food distribution IACO Clustering, Food distribution, IACO",
author = "Chao Chen and Zhihui Tian and Yao Baozhen",
year = "2017",
month = "5",
day = "15",
doi = "10.1007/s10479-017-2514-3",
language = "English",
volume = "273",
pages = "111--134",
journal = "Annals of Operations Research",
issn = "0254-5330",
publisher = "Springer",
number = "1-2",

}

Optimization of two-stage location–routing–inventory problem with time-windows in food distribution network. / Chen, Chao; Tian, Zhihui; Baozhen, Yao (Corresponding author).

In: Annals of Operations Research, Vol. 273, No. 1-2, 15.05.2017, p. 111-134.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Optimization of two-stage location–routing–inventory problem with time-windows in food distribution network

AU - Chen, Chao

AU - Tian, Zhihui

AU - Baozhen, Yao

PY - 2017/5/15

Y1 - 2017/5/15

N2 - High transportation cost and low service quality are common weaknesses in different logistics networks, especially in food delivery. Due to its perishable features, the quality of the food will deteriorate during the while delivery process. In this paper, a two-stage location–routing–inventory problem with time windows (2S-LRITW) for food products is proposed. The first stage corresponds to a location–routing–inventory problem with time windows and the second stage is the transportation problem with vehicle capacity constraints. The problem is formulated as a mixed integer-programming model. Then a hybrid heuristic is proposed, in which distance-based clustering approach, mutation operation and the relocate exchange method are introduced to improve performance of algorithm. At last, the hybrid heuristic was tested using several cases, including some small instances and a real-life case. The results show that the distance-based clustering approach can efficiently improve the convergence speed. And the IACO and the relocate exchange method can enlarge the search space. As a result, the hybrid heuristic is suitable for solving practical larger scale problem. Furthermore, the results also indicate that customer sequence has great effect on the object due to the energy cost considered.

AB - High transportation cost and low service quality are common weaknesses in different logistics networks, especially in food delivery. Due to its perishable features, the quality of the food will deteriorate during the while delivery process. In this paper, a two-stage location–routing–inventory problem with time windows (2S-LRITW) for food products is proposed. The first stage corresponds to a location–routing–inventory problem with time windows and the second stage is the transportation problem with vehicle capacity constraints. The problem is formulated as a mixed integer-programming model. Then a hybrid heuristic is proposed, in which distance-based clustering approach, mutation operation and the relocate exchange method are introduced to improve performance of algorithm. At last, the hybrid heuristic was tested using several cases, including some small instances and a real-life case. The results show that the distance-based clustering approach can efficiently improve the convergence speed. And the IACO and the relocate exchange method can enlarge the search space. As a result, the hybrid heuristic is suitable for solving practical larger scale problem. Furthermore, the results also indicate that customer sequence has great effect on the object due to the energy cost considered.

KW - Location–routing–inventory problem with time-windows (LRITW) Food distribution IACO Clustering

KW - Food distribution

KW - IACO

U2 - 10.1007/s10479-017-2514-3

DO - 10.1007/s10479-017-2514-3

M3 - Article

VL - 273

SP - 111

EP - 134

JO - Annals of Operations Research

JF - Annals of Operations Research

SN - 0254-5330

IS - 1-2

ER -