4.7 Article

A performance-driven multi-algorithm selection strategy for energy consumption optimization of sea-rail intermodal transportation

期刊

SWARM AND EVOLUTIONARY COMPUTATION
卷 44, 期 -, 页码 1-17

出版社

ELSEVIER
DOI: 10.1016/j.swevo.2018.11.007

关键词

Differential evolution; Multi-algorithm selection; Sea-rail intermodal transportation; Energy consumption optimization

资金

  1. National Key Research and development Program of China [2016YFC0800200]
  2. National Nature Science Foundation of china [61603244]
  3. Shanghai Pujiang Program [16PJ1403800]

向作者/读者索取更多资源

Various powerful differential evolution (DE) algorithms have been developed in the past years, although none of them can consistently perform well on all types of problems. However, it is not straightforward to choose an appropriate algorithm for solving a real-world problem, as the properties of the problem are usually not well understood beforehand. Therefore, how to automatically select an appropriate DE variant for solving a particular problem at hand is an important and challenging task. In the present work, a performance-driven multi-algorithm selection strategy (PMSS) is proposed to alleviate the above mentioned problems for single objective optimization. In PMSS, a learning-forgetting mechanism is introduced to update the selection probability of each algorithm from a pool of DE variants to make sure that the best performing one is chosen during the search process. The effectiveness of PMSS is carefully examined on two suites of widely used test problems and the results indicate that the PMSS is highly effective and computationally efficient. Finally, the proposed algorithm is employed to optimize the energy consumption of sea-rail intermodal transportation. Our simulation results demonstrate that the proposed algorithm is successful achieving satisfactory solution that are able to provide insights into the problem and the algorithm is promising to be applied for solving real sea-rail intermodal and other multimodal transportation planning problems.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Computer Science, Artificial Intelligence

A practical tutorial on solving optimization problems via PlatEMO

Ye Tian, Weijian Zhu, Xingyi Zhang, Yaochu Jin

Summary: PlatEMO is an open-source platform that solves complex optimization problems with a variety of metaheuristics. It has been widely used in the computational intelligence community and can tackle various difficulties regardless of the problem's field.

NEUROCOMPUTING (2023)

Editorial Material Computer Science, Artificial Intelligence

Machine Learning Assisted Evolutionary Multi-Objective Optimization

Xingyi Zhang, Ran Cheng, Liang Feng, Yaochu Jin

Summary: Optimization and learning are two main paradigms of artificial intelligence, frequently enhanced by each other in addressing complex real-world problems. Evolutionary multi-objective optimization algorithms are widely used but face challenges in solving complex problems. Machine learning techniques have been applied to enhance these algorithms.

IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE (2023)

Editorial Material Computer Science, Artificial Intelligence

Guest Editorial Special Issue on Large-Scale Evolutionary Multiobjective Optimization and Its Practical Applications

Xingyi Zhang, Ran Cheng, Yaochu Jin, Bernhard Sendhoff

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2023)

Article Computer Science, Artificial Intelligence

Cooperative Coevolutionary CMA-ES With Landscape-Aware Grouping in Noisy Environments

Yapei Wu, Xingguang Peng, Handing Wang, Yaochu Jin, Demin Xu

Summary: Many real-world optimization tasks suffer from noise, but current research on noise-tolerant algorithms is limited to low-dimensional problems. This article proposes a landscape-aware grouping method for cooperative coevolutionary algorithms to solve high-dimensional problems under noisy environments. Experimental results show that the proposed method is able to effectively identify interactive decision variables in the presence of noise.

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2023)

Article Computer Science, Information Systems

Design and analysis of helper-problem-assisted evolutionary algorithm for constrained multiobjective optimization

Yajie Zhang, Ye Tian, Hao Jiang, Xingyi Zhang, Yaochu Jin

Summary: In recent years, solving constrained multiobjective optimization problems by introducing simple helper problems has become popular. This study provides a comprehensive overview of existing constrained multiobjective evolutionary algorithms and proposes a novel helper-problem-assisted CMOEA, which has shown competitive performance in experiments.

INFORMATION SCIENCES (2023)

Article Automation & Control Systems

Performance Indicator-Based Adaptive Model Selection for Offline Data-Driven Multiobjective Evolutionary Optimization

Zhening Liu, Handing Wang, Yaochu Jin

Summary: Offline data-driven multiobjective optimization problems are common in practice. To address the issue of error accumulation when using surrogate models for optimization, a new surrogate-assisted indicator-based evolutionary algorithm is proposed. This algorithm can select the appropriate type of surrogate models based on the error, and it performs well in practical problems.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

Article Automation & Control Systems

Evolutionary Large-Scale Dynamic Optimization Using Bilevel Variable Grouping

Hui Bai, Ran Cheng, Danial Yazdani, Kay Chen Tan, Yaochu Jin

Summary: This paper proposes a bilevel variable grouping (BLVG)-based framework to address the issue of variable grouping in large-scale dynamic optimization when cooperating with multipopulation strategies. The framework outperforms several state-of-the-art frameworks for large-scale dynamic optimization, as shown by empirical studies.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

Article Automation & Control Systems

A Surrogate-Assisted Evolutionary Framework With Regions of Interests-Based Data Selection for Expensive Constrained Optimization

Zhenshou Song, Handing Wang, Yaochu Jin

Summary: Expensive constrained optimization problems can be solved by evolutionary algorithms in conjunction with computationally cheap surrogates. However, existing methods neglect the differences between different surrogate models, resulting in unsatisfactory performance.

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS (2023)

Article Computer Science, Artificial Intelligence

Fedlabx: a practical and privacy-preserving framework for federated learning

Yuping Yan, Mohammed B. M. Kamel, Marcell Zoltay, Marcell Gal, Roland Hollos, Yaochu Jin, Ligeti Peter, Akos Tenyi

Summary: This paper presents a practical privacy-preserving scheme combining cryptographic techniques and communication networking solutions to address the security vulnerabilities and communication inefficiencies in federated learning. The proposed approach utilizes Kafka for message distribution, the Diffie-Hellman scheme for secure server aggregation, and gradient differential privacy for interference attack prevention.

COMPLEX & INTELLIGENT SYSTEMS (2023)

Article Computer Science, Artificial Intelligence

Deep Reinforcement Learning Based Adaptive Operator Selection for Evolutionary Multi-Objective Optimization

Ye Tian, Xiaopeng Li, Haiping Ma, Xingyi Zhang, Kay Chen Tan, Yaochu Jin

Summary: This paper proposes a novel operator selection method based on reinforcement learning, which uses deep neural networks to learn a policy that determines the best operator for each parent, addressing the exploration-exploitation dilemma in operator selection.

IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE (2023)

Article Computer Science, Artificial Intelligence

DRL-Searcher: A Unified Approach to Multirobot Efficient Search for a Moving Target

Hongliang Guo, Qihang Peng, Zhiguang Cao, Yaochu Jin

Summary: This article proposes a unified algorithm named DRL-Searcher for the multirobot efficient search (MuRES) problem in a nonadversarial moving target scenario. DRL-Searcher utilizes distributional reinforcement learning (DRL) to evaluate and improve the search policy's return distribution for both minimizing capture time and maximizing capture probability objectives. The algorithm is further adapted for target search without real-time location information, and a recency reward is introduced for implicit coordination among multiple robots. Comparative simulations and real-world experiments demonstrate the superior performance of DRL-Searcher.

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS (2023)

Article Computer Science, Artificial Intelligence

A Generic Self-Supervised Framework of Learning Invariant Discriminative Features

Foivos Ntelemis, Yaochu Jin, Spencer A. Thomas

Summary: Self-supervised learning (SSL) has become popular for generating invariant representations without human annotations. However, the desired representations are achieved by using prior online transformations on the input data, making each SSL framework customized for specific data types and requiring modifications for other types.

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS (2023)

Article Geochemistry & Geophysics

Ultralightweight Spatial-Spectral Feature Cooperation Network for Change Detection in Remote Sensing Images

Tao Lei, Xinzhe Geng, Hailong Ning, Zhiyong Lv, Maoguo Gong, Yaochu Jin, Asoke K. K. Nandis

Summary: In this article, an efficient ultralightweight spatial-spectral feature cooperation network (USSFC-Net) is proposed for remote sensing image change detection. The USSFC-Net addresses the high computational costs, high memory usage, and lack of cooperation between spatial and spectral features in existing methods. It achieves better performance in change detection with lower computational costs and fewer parameters compared to other CNNs-based methods.

IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING (2023)

Article Mathematics, Interdisciplinary Applications

Knowledge Transfer Based on Particle Filters for Multi-Objective Optimization

Xilu Wang, Yaochu Jin

Summary: This study incorporates transfer learning capabilities into the optimizer by using particle filters, and proposes a particle-filter-based multi-objective optimization algorithm. By simulating a sequence of target distributions to balance multiple objectives, the Pareto optimal solutions can be approximated. Experimental results demonstrate that the proposed algorithm achieves competitive performance compared to state-of-the-art multi-objective evolutionary algorithms on most test instances.

MATHEMATICAL AND COMPUTATIONAL APPLICATIONS (2023)

Article Engineering, Electrical & Electronic

Principled Design of Translation, Scale, and Rotation Invariant Variation Operators for Metaheuristics

Ye Tian, Xingyi Zhang, Cheng He, Kay Chen Tan, Yaochu Jin

Summary: A large number of metaheuristics have been proposed and shown high performance in solving complex optimization problems. While most variation operators in existing metaheuristics are empirically designed, new operators are automatically designed in this work, which are expected to be search space independent and thus exhibit robust performance on different problems.

CHINESE JOURNAL OF ELECTRONICS (2023)

Article Computer Science, Artificial Intelligence

Energy-efficient flexible job shop scheduling problem considering discrete operation sequence flexibility

Guiliang Gong, Jiuqiang Tang, Dan Huang, Qiang Luo, Kaikai Zhu, Ningtao Peng

Summary: This paper proposes a flexible job shop scheduling problem with discrete operation sequence flexibility and designs an improved memetic algorithm to solve it. Experimental results show that the algorithm outperforms other algorithms in terms of performance. The proposed model and algorithm can help production managers obtain optimal scheduling schemes considering operations with or without sequence constraints.

SWARM AND EVOLUTIONARY COMPUTATION (2024)

Article Computer Science, Artificial Intelligence

A differential evolution algorithm for solving mixed-integer nonlinear programming problems

Daniel Molina-Perez, Efren Mezura-Montes, Edgar Alfredo Portilla-Flores, Eduardo Vega-Alvarado, Barbara Calva-Yanez

Summary: This paper presents a new proposal based on two fundamental strategies to improve the performance of the differential evolution algorithm when solving MINLP problems. The proposal considers a set of good fitness-infeasible solutions to explore promising regions and introduces a composite trial vector generation method to enhance combinatorial exploration and convergence capacity.

SWARM AND EVOLUTIONARY COMPUTATION (2024)