Open Access Paper
12 November 2024 Research on multimodal transport path optimisation with time windows under uncertainty conditions
Yanming Sun, Chengjuan Chen, Fenglian Liu, Guangzhen Zhang, Ziwei Jiao
Author Affiliations +
Proceedings Volume 13395, International Conference on Optics, Electronics, and Communication Engineering (OECE 2024) ; 133951O (2024) https://doi.org/10.1117/12.3048463
Event: International Conference on Optics, Electronics, and Communication Engineering, 2024, Wuhan, China
Abstract
Considering the uncertainty of demand and transport time in the actual transport process, a fuzzy nonlinear planning model for multimodal transport considering hybrid time window constraints is established with the optimisation objective of the integrated operating cost of transport cost, transit cost, time penalty cost and carbon emission cost. The optimisation model containing uncertain variables is transformed into a mathematical model of deterministic form through the fuzzy opportunity constraint theory, and the hybrid simulated annealing algorithm combining genetic algorithm and simulated annealing algorithm is used for the solution, and the validity of the model and algorithm, as well as the effect of time window on the results, are verified by changing the time window constraints.
© (2024) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yanming Sun, Chengjuan Chen, Fenglian Liu, Guangzhen Zhang, and Ziwei Jiao "Research on multimodal transport path optimisation with time windows under uncertainty conditions", Proc. SPIE 13395, International Conference on Optics, Electronics, and Communication Engineering (OECE 2024) , 133951O (12 November 2024); https://doi.org/10.1117/12.3048463
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Fuzzy logic

Carbon

Mathematical modeling

Algorithms

Roads

Genetic algorithms

Mathematical optimization

Back to Top