Multi-modal cargo logistics distribution problem: Decomposition of the stochastic risk-averse models

2021 ◽  
Vol 131 ◽  
pp. 105280
Author(s):  
Mahsa Mohammadi ◽  
Shahrooz Shahparvari ◽  
Hamed Soleimani
Keyword(s):  
Problem Decomposition ◽  
Risk Averse ◽  
Distribution Problem ◽  
Logistics Distribution ◽  
Stochastic Risk

Study of the Logistics Transportation Vehicle Terminal Path Optimization and Algorithm Based on GIS

2014 ◽  
Vol 644-650 ◽  
pp. 2249-2252 ◽  
Author(s):  
Yan Liu ◽  
Ying Ju Li ◽  
Yan Xiao Zhang
Keyword(s):  
Choice Model ◽  
Route Choice ◽  
Dijkstra Algorithm ◽  
Distribution Centers ◽  
Distribution Problem ◽  
Logistics Distribution ◽  
Operation Speed ◽  
Set Up ◽  
Transportation Vehicle ◽  
Vehicle Terminal

Based on feasibility and rationality, the path of the distribution centers, cargo terminal and receiving point as the optimized object.Using the Dijkstra algorithm and to improve it,set up customer logistics cost minimum as the target of route choice model;Using the improved Dijkstra algorithm greatly improves the operation speed,especially in the cross area for the shortest path,division graph method has very big enhancement to the time complexity of the algorithm ,enable the customer logistics total cost minimum.Therefore, route choice model can accurately describe the logistics distribution problem.

scholarly journals Proposing an Algorithm to Solve the Forward and Reverse Logistics Distribution Problem with One Door Container

2019 ◽  
Vol 21 (1) ◽  
pp. 1-14
Author(s):  
Stephen Sanjaya Budi ◽  
Paulina Kus Ariningsih ◽  
Titi Iswari
Keyword(s):  
Reverse Logistics ◽  
Packing Problem ◽  
Future Research ◽  
Distribution Problem ◽  
Logistics Distribution ◽  
Loading Process ◽  
Loading And Unloading ◽  
The Cost

Forward and reverse logistics are two types of distribution methods that shall be synergized in practices. Two problems in synergizing the two distributions type are (1) how to route vehicles and (2) how to pack the goods inside the vehicle. A truck with only one door for loading and unloading process could create numerous problems of item packing activities. An item picked up from a customer could occasionally block other goods which need to be delivered; hence, the courier shall unload other items before the loading process. This condition will increase the probability of item damage, longer on-loading/off-loading (lo/lo) time, and higher lo/lo cost because of the rapid item movement. Therefore, this article aims to propose an algorithm to solve the problem by creating an algorithm hybrid of routing and packing to find the solution for routing and packing problem, sequentially, with a metaheuristic approach. The proposed method calculates the cost from routing procedure and sum of item movement in every loading and unloading process. Based on the trial on 25 cases, this algorithm generates 59.64% of the containers have zero goods repacking. Several potential future research avenues are also proposed in this article.

A stochastic risk-averse framework for blood donation appointment scheduling under uncertain donor arrivals

2020 ◽  
Vol 23 (4) ◽  
pp. 535-555
Author(s):  
Semih Yalçındağ ◽  
Seda Baş Güre ◽  
Giuliana Carello ◽  
Ettore Lanzarone
Keyword(s):  
Blood Donation ◽  
Appointment Scheduling ◽  
Risk Averse ◽  
Stochastic Risk

scholarly journals Reliability-Constrained Power System Expansion Planning: A Stochastic Risk-Averse Optimization Approach

2021 ◽  
Vol 36 (1) ◽  
pp. 97-106
Author(s):  
Luiz Carlos da Costa ◽  
Fernanda Souza Thome ◽  
Joaquim Dias Garcia ◽  
Mario V. F. Pereira
Keyword(s):  
Power System ◽  
System Expansion ◽  
Optimization Approach ◽  
Risk Averse ◽  
Expansion Planning ◽  
Stochastic Risk
Sign in / Sign up

Export Citation Format

Share Document