2016
DOI: 10.5267/j.uscm.2016.3.001
|View full text |Cite
|
Sign up to set email alerts
|

Vehicle routing problem with considering multi-middle depots for perishable food delivery

Abstract: Today, distributing high quality perishable foods is one of the challenging issues in food industry. This paper introduces a deterministic vehicle routing problem model with multiple middle depots and proposes the freshness of perishable foods as a new concept to obtain optimal delivery routes. For the proposed mathematical model, profit maximization of delivering the product, minimization of the transportation costs and vehicle traveling time, and maximum level of delivered product perishability (loss of fres… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
25
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 25 publications
(25 citation statements)
references
References 18 publications
0
25
0
Order By: Relevance
“…Hsu et al [11] considered the randomness of the perishable food delivery process with time windows to obtain optimal delivery routes, loads, fleet dispatching, and departure times for the delivery of perishable food products. Rabbani et al [12] established a VRP model that considered minimization of transportation costs and a minimum freshness level to improve profit in the context of different numbers of depots. ey considered different scenarios and described the routing problem based on the traditional transportation method.…”
Section: Literature About Perishable Product Distributionmentioning
confidence: 99%
See 2 more Smart Citations
“…Hsu et al [11] considered the randomness of the perishable food delivery process with time windows to obtain optimal delivery routes, loads, fleet dispatching, and departure times for the delivery of perishable food products. Rabbani et al [12] established a VRP model that considered minimization of transportation costs and a minimum freshness level to improve profit in the context of different numbers of depots. ey considered different scenarios and described the routing problem based on the traditional transportation method.…”
Section: Literature About Perishable Product Distributionmentioning
confidence: 99%
“…e binary variable Z i is equal to 1 when community node i is delivered, and binary variable y k ij is equal to 1 when vehicle k visits node j immediately after node i. Binary variable O k is equal to 1 when vehicle k is used. s b represents the total packaging and refrigerant costs, which is calculated by equation (12). c k ij denotes the fuel cost of transportation from i to j by vehicle k, and it is calculated by equation (13).…”
Section: Objective Function and Constraintsmentioning
confidence: 99%
See 1 more Smart Citation
“…Morim et al [5] considered the constraints of multiple time windows and vehicle models and built a vehicle distribution path optimization model. Rabbani et al [6] studied the deterministic vehicle routing problem under multiple intermediate warehouses and proposed the concept of perishable food freshness to obtain the optimal distribution path. Zhang et al [7] designed a mathematical model of a cold chain logistic vehicle path with multiple vehicle fields and models and solved it by using the genetic algorithm and elite selection method.…”
Section: Introductionmentioning
confidence: 99%
“…Wang et al (2016) solved a multi-objective VRP with time windows and perishability considerations using a two-phase heuristic method based on a variable neighbourhood search and a genetic algorithm. Rabbani et al (2016) considered the use of multiple middle depots and incorporated several aspects, such as product freshness and profit maximisation into the objective function. They developed a genetic algorithm for the solution of large instances.…”
Section: Literature Reviewmentioning
confidence: 99%