4.7 Article

Accelerating Two-Phase Multiobjective Evolutionary Algorithm for Electric Location-Routing Problems

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TITS.2023.3266807

关键词

Routing; Search problems; Optimization; Heuristic algorithms; Evolutionary computation; Batteries; Signal processing algorithms; Electric location-routing problem; multiobjective optimization; evolutionary algorithm; interpolation; surrogate

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

The electric location-routing problem involves optimizing electric vehicle routing and charging facility location. Existing algorithms often use a two-phase search strategy to optimize routing and location alternately, but they are criticized for inefficiency as problem size increases. To improve search efficiency, we propose an accelerating two-phase multiobjective evolutionary algorithm that uses a learning method to extract useful information from historical searches and generate high-quality routing and location solutions.
Electric location-routing problem is a challenging problem consisting of the optimization of electric vehicle routing and charging facility location, simultaneously. Existing algorithms generally adopt the two-phase search strategy to alternately optimize the routing and the location. However, they are usually criticized for the inefficiency as the problem scale increases. In order to improve the search efficiency in each phase, we propose an accelerating two-phase multiobjective evolutionary algorithm, where the learning method is used to mine the useful information from the historical search process to generate the high-quality routing and location offspring. To be specific, in the routing optimization phase, an interpolation method is developed to extract the frequent visiting orders existing in the historical best solutions. These frequent visiting orders are used to create potential routing offspring that can accelerate the convergence toward the optimal solutions. In the location optimization phase, a surrogate model is used to approximatively represent the relationship from routing to location, which can directly output a promising location scheme for a given routing offspring and thus reduce the optimization time. Experimental results on different scales of test instances demonstrate the competitiveness of the proposed algorithm in comparison with several state of-the-art algorithms, including four widely used heuristic algorithms and two multiobjective evolutionary algorithms.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

暂无数据
暂无数据