Multi-objective optimization for multimodal transportation routing problem with stochastic transportation time based on data-driven approaches

Peng, Yong; Gao, Shu Han; Yu, Dennis; Xiao, Yitian; Luo, Yupeng

doi:10.1051/ro/2023090

Cited by 3 publications

(1 citation statement)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…NSGA-II has also been used in port management [147,148]. Moreover, NSGA-II is also commonly used to solve transportation and routing problems [149][150][151]. NSGA-II is also an important tool in overcoming sustainability problems in the supply chain [152][153][154].…”

Section: Keyword Analysesmentioning

confidence: 99%

A Bibliometric Analysis of a Genetic Algorithm for Supply Chain Agility

Lam,

Lee

2024

Mathematics

View full text Add to dashboard Cite

As a famous population-based metaheuristic algorithm, a genetic algorithm can be used to overcome optimization complexities. A genetic algorithm adopts probabilistic transition rules and is suitable for parallelism, which makes this algorithm attractive in many areas, including the logistics and supply chain sector. To obtain a comprehensive understanding of the development in this area, this paper presents a bibliometric analysis on the application of a genetic algorithm in logistics and supply chains using data from 1991 to 2024 from the Web of Science database. The authors found a growing trend in the number of publications and citations over the years. This paper serves as an important reference to researchers by highlighting important research areas, such as multi-objective optimization, metaheuristics, sustainability issues in logistics, and machine learning integration. This bibliometric analysis also underlines the importance of Non-Dominated Sorting Genetic Algorithm II (NSGA-II), sustainability, machine learning, and variable neighborhood search in the application of a genetic algorithm in logistics and supply chains in the near future. The integration of a genetic algorithm with machine learning is also a potential research gap to be filled to overcome the limitations of genetic algorithms, such as the long computational time, difficulties in obtaining optimal solutions, and convergence issues for application in logistics and supply chains.

show abstract

Section: Keyword Analysesmentioning

confidence: 99%

A Bibliometric Analysis of a Genetic Algorithm for Supply Chain Agility

Lam,

Lee

2024

Mathematics

View full text Add to dashboard Cite

show abstract

Simple population-based algorithms for solving optimization problems

Baskar

2024

RAIRO-Oper. Res.

View full text Add to dashboard Cite

Heuristic algorithms are simple yet powerful tools that are capable of yielding acceptable results in a reasonable execution time. Hence, they are being extensively used for solving optimization problems by researchers nowadays. Due to the quantum of computing power and hardware available today, a large number of dimensions and objectives are considered and analyzed effectively. This paper proposes new population-based metaheuristic algorithms that are capable of combining different strategies. The new strategies help in fast converging as well as trying to avoid local optima. The proposed algorithms could be used as single-phase as well as two-phase algorithms with different combinations and tuning parameters. “Best”, “Mean” and “Standard Deviation” are computed for thirty trials in each case. The results are compared with many efficient optimization algorithms available in the literature. Sixty-one popular un-constrained benchmark problems with dimensions varying from two to thousand and fifteen constrained real-world engineering problems are used for the analyses. The results show that the new algorithms perform better for several test cases. The suitability of the new algorithms for solving multi-objective optimization problems is also studied using five numbers of two-objective ZDT problems. Pure Diversity, Spacing, Spread and Hypervolume are the metrics used for the evaluation.

show abstract

Optimization of Multimodal Paths for Oversize and Heavyweight Cargo under Different Carbon Pricing Policies

Wu,

Zhang,

Xiao

et al. 2024

Sustainability

View full text Add to dashboard Cite

With the increasing global concern over climate change, reducing greenhouse gas emissions has become a universal goal for governments and enterprises. For oversize and heavyweight cargo (OHC) transportation, multimodal transportation has become widely adopted. However, this mode inevitably generates carbon emissions, making research into effective emission reduction strategies essential for achieving low-carbon economic development. This study investigates the optimization of multimodal transportation paths for OHC (OMTP-OHC), considering various direct carbon pricing policies and develops models for these paths under the ordinary scenario—defined as scenarios without any carbon pricing policies—and two carbon pricing policy scenarios, namely the emission trading scheme (ETS) policy and the carbon tax policy, to identify the most cost-effective solutions. An enhanced genetic algorithm incorporating elite strategy and catastrophe theory is employed to solve the models under the three scenarios. Subsequently, we examine the impact of ETS policy price fluctuations, carbon quota factors, and different carbon tax levels on decision-making through a case study, confirming the feasibility of the proposed model and algorithm. The findings indicate that the proposed algorithm effectively addresses this problem. Moreover, the algorithm demonstrates a small impact of ETS policy price fluctuations on outcomes and a slightly low sensitivity to carbon quota factors. This may be attributed to the relatively low ETS policy prices and the characteristics of OHC, where transportation and modification costs are significantly higher than carbon emission costs. Additionally, a comparative analysis of the two carbon pricing policies demonstrates the varying intensities of emission reductions in multimodal transportation, with the ranking of carbon emission reduction intensity as follows: upper-intermediate level of carbon tax > intermediate level of carbon tax > lower-intermediate level of carbon tax = ETS policy > the ordinary scenario. The emission reduction at the lower-intermediate carbon tax level (USD 8.40/t) matches that of the ETS policy at 30%, with a 49.59% greater reduction at the intermediate level (USD 50.48/t) compared to the ordinary scenario, and a 70.07% reduction at the upper-intermediate level (USD 91.14/t). The model and algorithm proposed in this study can provide scientific and technical support to realize the low-carbonization of the multimodal transportation for OHC. The findings of this study also provide scientific evidence for understanding the situation of multimodal transportation for OHC under China’s ETS policy and its performance under different carbon tax levels in China and other regions. This also contributes to achieving the goal of low-carbon economic development.

show abstract

Multi-objective optimization for multimodal transportation routing problem with stochastic transportation time based on data-driven approaches

Cited by 3 publications

References 38 publications

A Bibliometric Analysis of a Genetic Algorithm for Supply Chain Agility

A Bibliometric Analysis of a Genetic Algorithm for Supply Chain Agility

Simple population-based algorithms for solving optimization problems

Optimization of Multimodal Paths for Oversize and Heavyweight Cargo under Different Carbon Pricing Policies

Contact Info

Product

Resources

About