Hybrid PSO-TS-CHR Algorithm Applied to the Vehicle Routing Problem for Multiple Perishable Products Delivery

Noguera, Jesus David Galarcio; Riaño, Helman Enrique Hernández; Pereira, Jorge Mario López

doi:10.1007/978-3-030-00353-1_6

Cited by 3 publications

(4 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Figure 3a is for Equation (21), and Figure 3b is for Equation (30). 27, 28, 26, 12, 3, 33, 9, 30, 20, 32, 10, 0] [0, 40, 21, 4, 23, 39, 25, 24, 29, 34, 35, 50, 1, 31, 0] [0, 13,6,48,47,36,49,19,11,7,18,8,45,17, 0] [0, 5,16,44,14,38,37,42,43,15,22,2,41,46, 0] (30) 3335.5…”

Section: Validity Analysis Of the Modelmentioning

confidence: 99%

“…[0, 27,31,10,32,30,20,9,33,1,50,3,12, 0] [0, 28,26,21,22,23,4,39,25,24,29,34,35, 0] [0, 5,16,44,14,38,37,42,43,15,41,2,40,13,6,0] [0, 18,48,47,36,49,19,11,7,8,45,17,46, 0] Table 5 shows that Equation ( 30) is effective and can be used to reduce the total distribution cost of the enterprise significantly. According to Figure 3, for the two different models, vehicle route...…”

Section: Validity Analysis Of the Modelmentioning

confidence: 99%

“…Galarcio-Noguera et al [18] established a mathematical model to minimize the loss of freshness by multiplying perishable products and enhancing the customers' satisfaction in the delivery process. They proposed a hybrid PSO-TS-CHR algorithm to solve the model.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Optimization Research on Vehicle Routing for Fresh Agricultural Products Based on the Investment of Freshness-Keeping Cost in the Distribution Process

Zhu

2021

Sustainability

View full text Add to dashboard Cite

In cold chain logistics, fresh agricultural products are susceptible to deteriorate due to the passage of time in the distribution process. To reduce the loss of cargo, this research integrates the traditional refrigeration cost into the freshness-keeping cost invested in the process of transportation and unloading goods. We rely on the investment of freshness-keeping cost to reduce the cargo damage cost caused by the distribution process and then propose a new vehicle routing problem (VRP). According to all relevant costs, this research builds a mathematical model with the goal of minimizing the total distribution cost. A hybrid ant colony optimization is designed to solve the problem, and the effectiveness of the model and algorithm are verified through two sets of comparative experiments. To determine which products should be invested in freshness-keeping cost to reduce the total distribution cost, we perform numerical analysis on the relevant parameters in the model. Results provide decision-making references for cold chain logistics distribution enterprises in the design of distribution routes.

show abstract

Section: Validity Analysis Of the Modelmentioning

confidence: 99%

Section: Validity Analysis Of the Modelmentioning

confidence: 99%

See 1 more Smart Citation

Optimization Research on Vehicle Routing for Fresh Agricultural Products Based on the Investment of Freshness-Keeping Cost in the Distribution Process

Zhu

2021

Sustainability

View full text Add to dashboard Cite

show abstract

“…Greedy Randomized Adaptive Search Procedure (GRASP) algorithm-neighborhood search developed by Lacomme et al (2018) was exemplified for minimizing the total cost distribution. In addition, Noguera et al (2018) engineered the PSO-TS algorithm to maximize the freshness state of the delivered products, while recently, Lin et al (2019) integrated GA-TS to minimize the total cost distribution. Meanwhile, Adarme-Jaimes and Orjuela-Castro (2015) were the only researchers who proposed the Monte Carlo simulation to minimize the total cost distribution.…”

Section: Hybridizations and Simulationmentioning

confidence: 99%

The vehicle routing problem for perishable goods: A systematic review

et al. 2020

View full text Add to dashboard Cite

Vehicle Routing Problem (VRP) is the problem for finding optimal routes in the distribution system, and this problem needs attention because it can improve distribution performance. One of the problems in VRP is the Vehicle Routing Problem for Perishable Goods (VRPfPG). This issue addresses VRP for products that are rapidly losing quality and perishable. This paper attempts to review the Vehicle Routing Problem for Perishable Goods (VRPfPG). A systematic review has been carried out on fifty-nine (59) published papers from 2001 to March 2020. The optimization methods in this review were classified into single and multi-objective problems. In addition, the review was also conducted based on the objective function. The results show the metaheuristic algorithm to be a popular optimization method for solving single and multi-objective problems. Further, the results also show that minimizing the total cost distribution to be the objective function that was often used by researchers. Finally, future studies are suggested to explore a more comprehensive investigation in the VRPfPG.

show abstract

Research on Urban Cold Chain Logistics Path Optimization Considering Multi-Center and Time-Varying Road Networks

Yang,

Jiang

2024

IEEE Access

View full text Add to dashboard Cite

This paper aims to address the time-dependent multi-depot vehicle routing problem with time windows (MDVRPTW) in urban cold chain logistics under a dynamic road network. The study considers the impact of carbon emissions and traffic congestion on urban cold chain logistics distribution activities. It proposes a cross-period road segment travel time calculation method, constructs a multi-objective optimization model that minimizes total costs encompassing comprehensive transportation costs, carbon emission costs, time penalty costs, cargo damage costs, and refrigeration costs. An adaptive large neighborhood search ant colony optimization algorithm (ALNS_ACO) is designed, which combines the exploration capability of ant colony optimization algorithm (ACO) with the local search capability of adaptive large neighborhood search algorithm (ALNS) to optimize and solve the model. Finally, the model is optimized and solved through simulation using six sets of C-type, R-type, and RC-type instances from the Solomon test database. The results show: 1) The planned vehicle routes can reasonably avoid peak congestion periods in the morning and evening, and multiple depots compared to single depot scenarios achieve better solutions in terms of total costs, carbon emissions, and total travel time for urban cold chain logistics distribution; 2) The exacerbation of traffic congestion leads to increased costs, and different optimization objectives have a significant impact on the model solutions; 3) Finally, through multidimensional comparisons of simulation performance with ACO and GA algorithms, the effectiveness of the proposed optimization algorithm is validated.INDEX TERMS Multi-depot,time-varying speeds,urban cold chain logistics,multi-objective optimization,ALNS_ACO algorithm.

show abstract

Hybrid PSO-TS-CHR Algorithm Applied to the Vehicle Routing Problem for Multiple Perishable Products Delivery

Cited by 3 publications

References 17 publications

Optimization Research on Vehicle Routing for Fresh Agricultural Products Based on the Investment of Freshness-Keeping Cost in the Distribution Process

Optimization Research on Vehicle Routing for Fresh Agricultural Products Based on the Investment of Freshness-Keeping Cost in the Distribution Process

The vehicle routing problem for perishable goods: A systematic review

Research on Urban Cold Chain Logistics Path Optimization Considering Multi-Center and Time-Varying Road Networks

Contact Info

Product

Resources

About