LIRP optimization of cold chain logistics in satellite warehouse mode of supermarket chains

2021 ◽  
pp. 1-15
Author(s):  
Bo Shu ◽  
Fanghua Pei ◽  
Kaifu Zheng ◽  
Mengxia Yu
Keyword(s):  
Time Windows ◽  
Home Delivery ◽  
Cold Chain ◽  
Inventory Routing ◽  
Logistics System ◽  
Routing Problem ◽  
Penalty Cost ◽  
Location Allocation ◽  
Soft Time Windows ◽  
Fresh Products

Aiming at the problem of high cost in cold chain logistics of fresh products home-delivery in supermarket chain in the new retail era, the paper constructs the model of Location Inventory Routing Problem (LIRP) optimization in Satellite Warehouse mode in view of customer satisfaction with the broken line soft time windows. The model minimizes the total cost of the cold chain logistics system of supermarket chain through the location allocation, inventory optimization, the determination of distribution service relationship between Satellite Warehouse and customer, and the constraint of time penalty cost. Then, the paper designed an improved ant colony optimization to solve the LIRP model of supermarket chain. Finally, the simulation in MATLAB verifies and analyzes the validity of the model and algorithm. Therefore, LIRP optimization model in Satellite Warehouse mode can effectively improve the operational efficiency of fresh products home-delivery in the supermarket chain and thus reduce the logistics cost.

scholarly journals Urban Transportation Network Design for Fresh Fruit and Vegetables Using GIS–The Case of Bangkok

2019 ◽  
Vol 9 (23) ◽  
pp. 5048 ◽  
Author(s):  
Suraraksa ◽  
Shin
Keyword(s):  
Urban Areas ◽  
Transportation Network ◽  
Time Windows ◽  
Operating Cost ◽  
Distribution Networks ◽  
Cold Chain ◽  
Problem Analysis ◽  
Distribution Centers ◽  
Routing Problem ◽  
Fresh Products

A cold chain for perishable fresh products aims to preserve the quality of the products under the control of a predefined temperature range. To satisfy the delivery conditions within appropriate time windows, the most critical operations in cold chain management is the transportation and distribution of fresh products. Due to rapid population growth and increasing demand for high-quality fresh foods, it becomes critical to develop advanced transportation and distribution networks for fresh products, particularly in urban areas. This research aims to design different scenarios based on mathematical models for fresh products transportation and distribution network in the Bangkok metropolitan area using Geographic Information system (GIS). The proposed methodology integrates location–allocation and vehicle routing problem analysis. The performance of all possible scenarios is evaluated and compared by considering the number of required distribution centers and trucks, total travel time, total travel distance, as well as fairness among drivers. The results of the scenario analysis highlight that the alternative scenarios show a better performance as compared to the current network. In addition, the administrator can make a different decision among several alternatives by considering different aspects, such as investment cost, operating cost, and balance of using available resources. Therefore, it may help a public officer to design the fresh products logistics network considering actual demand and traffic conditions in Bangkok.

scholarly journals Bi-Objective Optimization for Vehicle Routing Problems with a Mixed Fleet of Conventional and Electric Vehicles and Soft Time Windows

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Peixin Zhao ◽  
Fanfan Liu ◽  
Yuanyuan Guo ◽  
Xiaoyang Duan ◽  
Yunshu Zhang
Keyword(s):  
Vehicle Routing ◽  
Electric Vehicles ◽  
Programming Model ◽  
Time Windows ◽  
Nsga Ii ◽  
Weighting Method ◽  
Routing Problem ◽  
Penalty Cost ◽  
Soft Time Windows ◽  
The Impact

With the growing interest in environmental protection and congestion, electric vehicles are increasingly becoming the important transportation means. However, electric vehicles currently face several adoption barriers including high purchasing price and limited travelling range, so the fleets where electric vehicles and conventional vehicles coexist are closer to the current fleet management status. Considering the impact of charging facilities and carbon emission, this paper proposes a vehicle routing problem with a mixed fleet of conventional and electric vehicles and soft time windows. A bi-objective programming model is established to minimize total operational cost and time penalty cost. Finally, the nondominated sorting genetic algorithm II (NSGA-II) is employed to deal with this problem. Furthermore, single-objective optimization is carried out for the two objectives, respectively, and the linear weighting method is also used to solve the problem. Through the contrast of these results and the NSGA-II results, the effectiveness of the algorithm in this paper is further verified. The results indicate that two objectives are contradictory to some extent and decision-makers need a trade-off between two objectives.

scholarly journals A Heuristics-Based Parthenogenetic Algorithm for the VRP with Potential Demands and Time Windows

2016 ◽  
Vol 2016 ◽  
pp. 1-12
Author(s):  
Chenghua Shi ◽  
Tonglei Li ◽  
Yu Bai ◽  
Fei Zhao
Keyword(s):  
Genetic Algorithm ◽  
Time Windows ◽  
Computation Time ◽  
Routing Problem ◽  
Split Delivery ◽  
Soft Time Windows ◽  
Comparison Results ◽  
Potential Demand ◽  
The Cost

We present the vehicle routing problem with potential demands and time windows (VRP-PDTW), which is a variation of the classical VRP. A homogenous fleet of vehicles originated in a central depot serves customers with soft time windows and deliveries from/to their locations, and split delivery is considered. Also, besides the initial demand in the order contract, the potential demand caused by conformity consuming behavior is also integrated and modeled in our problem. The objective of minimizing the cost traveled by the vehicles and penalized cost due to violating time windows is then constructed. We propose a heuristics-based parthenogenetic algorithm (HPGA) for successfully solving optimal solutions to the problem, in which heuristics is introduced to generate the initial solution. Computational experiments are reported for instances and the proposed algorithm is compared with genetic algorithm (GA) and heuristics-based genetic algorithm (HGA) from the literature. The comparison results show that our algorithm is quite competitive by considering the quality of solutions and computation time.

scholarly journals Maritime inventory routing problem with multiple time windows

2017 ◽  
Vol 13 (5) ◽  
pp. 1-27
Author(s):  
Nurhadi Siswanto ◽  
◽  
Stefanus Eko Wiratno ◽  
Ahmad Rusdiansyah ◽  
Ruhul Sarker ◽  
...  
Keyword(s):  
Time Windows ◽  
Multiple Time ◽  
Inventory Routing ◽  
Routing Problem ◽  
Inventory Routing Problem ◽  
Multiple Time Windows ◽  
Maritime Inventory Routing
Sign in / Sign up

Export Citation Format

Share Document