检索结果-南通市图书馆

GNN Representation Learning and Multi-Objective variable neighborhood search Algorithm for Wind Farm Layout Optimization

引用

Energy Engineering 2024年第4期121卷 1049-1065页

作者： Yingchao Li JianbinWang HaibinWang China Electric Power Research Institute State Grid Inner Mongolia Eastern Electric Power Co.Ltd.Hohhot010010China School of Software Nanjing University of Information Science and TechnologyNanjing210044China

With the increasing demand for electrical services,wind farm layout optimization has been one of the biggest challenges that we have to deal *** the promising performance of the heuristic algorithm on the route network design problem,the expressive capability and search performance of the algorithm on multi-objective problems remain *** this paper,the wind farm layout optimization problem is ***,a multi-objective algorithm based on Graph Neural Network(GNN)and variable neighborhood search(VNS)algorithm is *** provides the basis representations for the following search algorithm so that the expressiveness and search accuracy of the algorithm can be *** multi-objective VNS algorithm is put forward by combining it with the multi-objective optimization algorithm to solve the problem with multiple *** proposed algorithm is applied to the 18-node simulation example to evaluate the feasibility and practicality of the developed optimization *** experiment on the simulation example shows that the proposed algorithm yields a reduction of 6.1% in Point of Common Coupling(PCC)over the current state-of-the-art algorithm,which means that the proposed algorithm designs a layout that improves the quality of the power supply by 6.1%at the same *** ablation experiments show that the proposed algorithm improves the power quality by more than 8.6% and 7.8% compared to both the original VNS algorithm and the multi-objective VNS algorithm.

关键词： GNN representation learning variable neighborhood search multi-objective optimization wind farm layout point of common coupling

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Particle swarm optimization with variable neighborhood search for multiobjective flexible job shop scheduling problem

引用

International Journal of Modeling, Simulation, and Scientific Computing 2016年第3期7卷 199-215页

作者： Song Huang Na Tian Zhicheng Ji School of Internet of Things Engineering Jiangnan University 1800 Lihu Avenue WuxiJiangsu Province214122P.R.China Key Laboratory of Advanced Process Control for Light Industry Ministry of Education Jiangnan University Wuxi214122P.R.China

The simulation on benchmarks is a very simple and efficient method to evaluate the performance of the algorithm for solving flexible job shop scheduling *** to the assignment and scheduling decisions,flexible job shop scheduling problem(FJSP)becomes extremely hard to solve for production management.A discrete multi-objective particle swarm optimization(PSO)and simulated annealing(SA)algorithm with variable neighborhood search is developed for FJSP with three criteria:the makespan,the total workload and the critical machine ***,a discrete PSO is designed and then SA algorithm performs variable neighborhood search integrating two neighborhoods on public critical block to enhance the search ***,the selection strategy of the personal-best individual and global-best individual from the external archive is developed in multi-objective *** the experimental simulation on matlab,the tests on Kacem instances,Brdata instances and BCdata instances show that the modified discrete multi-objective PSO algorithm is a promising and valid method for optimizing FJSP with three criteria.

关键词： variable neighborhood search particle swarm optimization flexible job shop scheduling

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Effective Hybrid Teaching-learning-based Optimization Algorithm for Balancing Two-sided Assembly Lines with Multiple Constraints

引用

Chinese Journal of Mechanical Engineering 2015年第5期28卷 1067-1079页

作者： TANG Qiuhua LI Zixiang ZHANG Liping FLOUDAS C A CAO Xiaojun Industrial Engineering Department Wuhan University of Science and Technology Texas A&M Energy Institute Texas A&M University College Station Technique Center of Dongfeng Peugeot Citroen Automobile Company

Due to the NP-hardness of the two-sided assembly line balancing （TALB） problem, multiple constraints existing in real applications are less studied, especially when one task is involved with several constraints. In this paper, an effective hybrid algorithm is proposed to address the TALB problem with multiple constraints （TALB-MC）. Considering the discrete attribute of TALB-MC and the continuous attribute of the standard teaching-learning-based optimization （TLBO） algorithm, the random-keys method is hired in task permutation representation, for the purpose of bridging the gap between them. Subsequently, a special mechanism for handling multiple constraints is developed. In the mechanism, the directions constraint of each task is ensured by the direction check and adjustment. The zoning constraints and the synchronism constraints are satisfied by teasing out the hidden correlations among constraints. The positional constraint is allowed to be violated to some extent in decoding and punished in cost fimction. Finally, with the TLBO seeking for the global optimum, the variable neighborhood search （VNS） is further hybridized to extend the local search space. The experimental results show that the proposed hybrid algorithm outperforms the late acceptance hill-climbing algorithm （LAHC） for TALB-MC in most cases, especially for large-size problems with multiple constraints, and demonstrates well balance between the exploration and the exploitation. This research proposes an effective and efficient algorithm for solving TALB-MC problem by hybridizing the TLBO and VNS.

关键词： two-sided assembly line balancing teaching-learning-based optimization algorithm variable neighborhood search positional constraints zoning constraints synchronism constraints

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Optimization of fixed aviation support resource station configuration for aircraft carrier based on aircraft dispatch mission scheduling

引用

Chinese Journal of Aeronautics 2023年第2期36卷 127-138页

作者： Yujie LIU Wei HAN Xichao SU Rongwei CUI Aeronautical Foundation College Naval Aviation UniversityYantai 264001China Aeronautical Operations College Naval Aviation UniversityYantai 264001China

Before the dispatch of the carrier-based aircraft,a series of pre-flight preparation operations need to be completed on the flight *** deck fixed aviation support resource station configuration has an important impact on operation efficiency and sortie ***,the resource station configuration is determined during the aircraft carrier design phase and is rarely modified as required,which may not be suitable for some pre-flight preparation *** order to solve the above defects,the joint optimization of flight deck resource station configuration and aircraft carrier pre-flight preparation scheduling is studied in this paper,which is formulated as a two-tier optimization decision-making *** improved variable neighborhood search algorithm with four original neighborhood structures is *** mission experiment and algorithm performance comparison experiment are carried out in the computational experiment *** correlation between the pre-flight preparation time(makespan)and flight deck cabin occupancy percentage is given,and advantages of the proposed algorithm in solving the mathematical model are verified.

关键词： Carrier-based aircraft Multi-objective optimization Resource configuration Scheduling variable neighborhood search

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

An improved artificial bee colony algorithm for steelmaking–refining–continuous casting scheduling problem

引用

Chinese Journal of Chemical Engineering 2018年第8期26卷 1727-1735页

作者： Kunkun Peng Quanke Pan Biao Zhang State Key Laboratory of Digital Manufacturing Equipment and Technology Huazhong University of Science and Technology

Steelmaking–refining–Continuous Casting(SCC) scheduling is a worldwide problem, which is NP-hard. Effective SCC scheduling algorithms can help to enhance productivity, and thus make significant monetary savings. This paper develops an Improved Artificial Bee Colony(IABC) algorithm for the SCC scheduling. In the proposed IABC, charge permutation is employed to represent the solutions. In the population initialization, several solutions with certain quality are produced by a heuristic while others are generated randomly. Two variable neighborhood search neighborhood operators are devised to generate new high-quality solutions for the employed bee and onlooker bee phases, respectively. Meanwhile, in order to enhance the exploitation ability, a control parameter is introduced to conduct the search of onlooker bee phase. Moreover, to enhance the exploration ability,the new generated solutions are accepted with a control acceptance criterion. In the scout bee phase, the solution corresponding to a scout bee is updated by performing three swap operators and three insert operators with equal probability. Computational comparisons against several recent algorithms and a state-of-the-art SCC scheduling algorithm have demonstrated the strength and superiority of the IABC.

关键词： Artificial bee colony Steelmaking–refining–continuous casting Hybrid flowshop scheduling variable neighborhood search

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A Hybrid Heuristic Algorithm for Solving COVID-19’s Social Distancing at Universities Campus

引用

Computer Systems Science & Engineering 2022年第6期41卷 933-944页

作者： Hassan Al-Tarawneh Khalid Al-Kaabneh Aysh Alhroob Hazem Migdady Issam Alhadid Department of Data sciences and Artificial Intelligence Al-Ahlyyia Amman UniversityAmmanJordan Department of Software Engineering Isra UniversityAmmanJordan Department of CSMIS Oman college of management and technologyMuscatOman Faculty of Information Technology and Systems University of JordanAqabaJordan

Social distancing during COVID-19 has become one of the most important measures in reducing the risks of the spread of the virus. Implementing thesemeasures at universities is crucial and directly related to the physical attendance ofthe populations of students, professors, employees, and other members on campus. This research proposes an automated scheduling approach that can help universities and schools comply with the social distancing regulations by providingassistance in avoiding huge assemblages of people. Furthermore, this paper proposes a novel course timetable-scheduling scheme based on four main ***, a distance of two meters must be maintained between each student inside theclassroom. Second, no classrooms should contain more than 20% of their regularcapacity. Third, there would be no back-to-back classes. Lastly, no lectures shouldbe held simultaneously in adjacent classrooms. The proposed approach wasimplemented using a variable neighborhood search (VNS) approach with an adaptive neighborhood structure (AD-NS) to resolve the problem of scheduling coursetimetables at Al-Ahlyyia Amman University. However, the experimental resultsshow that the proposed techniques outperformed the standard VNS tested on university course timetabling benchmark dataset ITC2007-Track3. Meanwhile, theapproach was tested using datasets collected from the faculty of information technology at Al-Ahlyyia Amman University (Jordan). Where the results showed that,the proposed technique could help educational institutes to resume their regularoperations while complying with the social distancing guidelines.

关键词： COVID-19 social distance variable neighborhood search adaptive neighborhood structure university course timetable

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Vehicle flow formulation for two-echelon time-constrained vehicle routing problem

引用

Journal of Management Science and Engineering 2019年第2期4卷 75-90页

作者： Hongqi Li Ming Bai Yibin Zhao Changzhi Dai School of Transportation Science and Engineering Beihang UniversityBeijing100191China

Two-echelon routing problems,including variants such as the two-echelon vehicle routing problem(2E-VRP)and the two-echelon location routing problem(2E-LRP),involve assignment and location ***,the two-echelon time-constrained vehicle routing problem(2E-TVRP)that caters to from-linehaul-to-delivery practices does not involve assignment *** routing problem variant for networks with two eche-lons has not yet attracted enough research *** or long-distance services suffer from the lack of the assignment decisions between satellites and ***,the 2E-TVRP,rather than using assignment decisions,adopts time constraints to decide the routes on each of the two interacting echelons:large-capacity vehicles trans-port cargoes among satellites on the first echelon,and small-capacity vehicles deliver cargoes from satellites to customers on the second *** study introduces a mixed integer linear programming model for the 2E-TVRP and proposes a heuristic algorithm that incorporates the savings algorithm followed by a variable neighborhood search *** examples are used to test the mathematical formulation and the heuristic and a case study is used to demonstrate that the heuristic can effectively solve realistic-size instances of the 2E-TVRP.

关键词： Vehicle routing Two-echelon Time constraints Mixed integer linear programming variable neighborhood search

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

An Effective Method for the Single Mode Rolling Planning Problem of Direct Hot Charge Rolling

An Effective Method for the Single Mode Rolling Planning Pro...

引用

第36届中国控制会议

作者： Xin-fu Pang Ying-chun Jiang Nai-wei Tu Hai-bo Li Yong-gang Wang Xue-fei Xv School of Automation Shenyang Institute of Engineering State Key Laboratory of Digital Manufacturing Equipment Technology Huazhong University of Science and Technology College of Engineering Shenyang Agricultural University Faculty of Electrical and Control Engineering Liaoning Technical University

ISBN: (纸本)9781538629185

The quality of rolling unit planning affects production cost,product quality and *** existing research methods are not apphed in practice because the surface quality requirement of the hot rolling coil and the integrated production with two-strand caster and hot rolling machine are neglected,and the width of each waiting produced slab（dummy slab） of is pre-determined when it is casted on *** present,the average length of hot rolling plan units is smaller by manual *** slab position limited in rolling unit because of the surface quality requirement,the integrated production with two-strand caster and hot rolling machine,and the selectable width of each waiting produced slab,a model for the single mode rolling unit planning problem of direct hot charge rolling（DHCR） is *** a method based on a hybrid of variable neighborhood search and ant colony optimization is *** experiment with industrial slab data shows that the results are better than those obtained by artificial methods.

关键词： hot rolling single mode rolling unit of DHCR ant colony optimization variable neighborhood search

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

A Dynamic Colored Traveling Salesman Problem and Its Solution

A Dynamic Colored Traveling Salesman Problem and Its Solutio...

引用

第36届中国控制会议

作者： Xianghu Meng Jun Li Xianzhong Dai Ministry of Education Key Laboratory of Measurement and Control of Complex Engineering Systems Southeast University

ISBN: (纸本)9781538629185

The colored traveling salesman problem（CTSP） is a generalization of the well-known multiple traveling salesman problem（MTSP）. In CTSP, each city has one to multiple colors, allowing a salesman in the same color to visit exactly once. This work presents a dynamic CTSP（DCTSP） in which the weights of edges among the cities change over time. To solve the DCTSP, we propose a variable neighborhood search（VNS） algorithm with a direct-route encoding and random initialization. The VNS is initialized by greedy operations at two stages and an appropriate population immigrant scheme is used in it to perform the population search in the dynamic environment. Extensive experiments are conducted to test the effectiveness of the greedy initialization and the immigrant scheme with the best population. The results show that the enhanced VNS can track the environment changes of DCTSP more rapidly and effectively.

关键词： Dynamic colored traveling salesman problem variable neighborhood search Dynamic optimization problem

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

碳交易机制下多中心混合车队配送路径和速度优化研究

引用

管理科学 2024年第4期

作者：陈婉茹徐光明张得志曹健

为助力物流企业实现“低污染、低排放、低能耗”的绿色配送，基于限额碳交易机制，考虑由传统燃油车和电动车构成的混合动力车队，研究多配送中心车辆路径-速度联合优化问题。引入综合距离、载重和速度等因素的实际能耗模型，以固定成... 详细信息

为助力物流企业实现“低污染、低排放、低能耗”的绿色配送，基于限额碳交易机制，考虑由传统燃油车和电动车构成的混合动力车队，研究多配送中心车辆路径-速度联合优化问题。引入综合距离、载重和速度等因素的实际能耗模型，以固定成本、能耗成本和碳交易成本之和最小化为优化目标，构建混合整数规划模型。根据问题特征，设计考虑速度优化的并行改进变邻域搜索算法，以集成路由和速度决策；应用大邻域搜索的全局破坏-修复算子和并行局部搜索策略改进算法的搜索深度和寻优效率。基准算例和仿真算例的实验结果验证了算法的有效性，并揭示了车队配置、碳交易机制和速度优化对配送方案的影响。研究成果在丰富车辆路径问题相关研究的同时，能够为物流企业降本增效及政府引导市场行为提供理论参考。

关键词：绿色物流碳交易机制混合车队车辆路径速度优化变邻域搜索 green logistics carbon trading mechanism mixed fleet vehicle routing speed optimization variable neighborhood search

来源：人大复印报刊资料评论

在线全文

人大复印报刊资料

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：