학술논문

A Machine Learning Approach for Energy-Efficient Intelligent Transportation Scheduling Problem in a Real-World Dynamic Circumstances
Document Type
Periodical
Source
IEEE Transactions on Intelligent Transportation Systems IEEE Trans. Intell. Transport. Syst. Intelligent Transportation Systems, IEEE Transactions on. 24(12):15527-15539 Dec, 2023
Subject
Transportation
Aerospace
Communication, Networking and Broadcast Technologies
Computing and Processing
Robotics and Control Systems
Signal Processing and Analysis
Job shop scheduling
Heuristic algorithms
Energy consumption
Statistics
Sociology
Dynamic scheduling
Genetic algorithms
Inverse scheduling
machine learning
energy-efficient
real-life application
fuzzy random chance-constrained programming
Language
ISSN
1524-9050
1558-0016
Abstract
This paper provides a novel intelligent scheduling strategy for a real-world transportation dynamic scheduling case from an engine workshop of general motor company (GMEW), which is a key production line throughout the manufacturing process. In order to reduce the carbon emission in the scheduling process and make up for ignoring the energy consumption of each part in the scheduling when optimizing the carbon emission of the workshop and the factory. This paper first formulates a fuzzy random chance-constrained programming model of inverse scheduling problem (ISP) with energy consumption. A multi-strategy parallel genetic algorithm based on machine learning (RL-MSPGA) is proposed, which uses machine learning to improve the genetic algorithm. First, the parallel idea is developed to accelerate the process of evolution of genetic algorithm, and the initial population is divided into clusters by $k$ -means clustering algorithm. Second, similar individuals are evenly distributed to different sub-populations to ensure the diversity and uniformity of sub-populations. Third, in the process of evolution, the sub-populations communicate with each other, and extend the excellent individuals to replace the poor ones in other populations, so as to improve the overall quality of the population. Fourth, the self-learning of the crossover probability is realized by the self-learning of the self-sensing environment, which makes the crossover probability adapt to the evolutionary process according to experience. Finally, the real instance is used to validate the different algorithms. It can effectively adjust the completion time and the proportion of energy consumption, thus providing the possibility for the production of energy-saving enterprises. This implies that the suggested model is reasonable and the provided algorithm can effectively solve the inverse shop scheduling problem.