检索结果-内蒙古大学图书馆

An improved tabu search algorithm for solving heterogeneous fixed fleet open vehicle routing problem with time windows

引用

ALEXANDRIA ENGINEERING JOURNAL 2023年 64卷 349-363页

作者： Ahmed, Zakir Hussain Yousefikhoshbakht, Majid Imam Mohammad Ibn Saud Islamic Univ IMSIU Coll Sci Dept Math & Stat Riyadh Saudi Arabia Bu Ali Sina Univ Fac Sci Dept Math Hamadan Iran

The heterogeneous fixed fleet open vehicle routing problem with time windows is a very significant type of the vehicle routing problem (VRP) that aims to find the minimum fixed and vari-able cost of transportation for a heterogeneous fleet with a fixed number in which the capacity of every vehicle and usage of the vehicles should not be ignored. Also, in this problem, each customer has a special time window for servicing and each vehicle starts its route from the warehouse and ends up in one of the customers. We propose a mixed integer linear programming model of this problem. Since this problem, as well as open VRP and VRP with fixed heterogeneous fleet are hard NP problem, an improved tabu search algorithm is proposed to solve the problem. Our proposed algorithm uses a modified sweep algorithm to generate some initial solutions. Besides, a variable tabu list and some new mechanisms for intensification and diversification mechanisms are used. Numerical results are presented to show the correctness of our model and finally, the efficiency of the proposed algorithm is compared with an exact algorithm, classic tabu search and simulated annealing. The obtained results prove the efficiency of the proposed algorithm.(c) 2022 THE AUTHORS. Published by Elsevier BV on behalf of Faculty of Engineering, Alexandria University. This is an open access article under the CC BY license (http://***/licenses/by/ 4.0/).

关键词： Open Vehicle Routing Prob-lem with Time Window Fixed fleet Heterogeneous tabu search algorithm Mixed Integer Linear Programming

来源：评论

学校读者我要写书评

暂无评论

A Memory-Reinforced tabu search algorithm With Critical Path Awareness for HW/SW Partitioning on Reconfigurable MPSoCs

引用

IEEE ACCESS 2019年 7卷 112448-112458页

作者： Guo, Zhongfu Zhang, Xingming Zhao, Bo China Natl Digital Switching Syst Engn & Technol Zhengzhou 450002 Henan Peoples R China

Hardware/software (HW/SW) partitioning and scheduling are the crucial steps in HW/SW co-design. They have a strong effect on performance, area, power and the system itself. In this paper, a memory-reinforced tabu search algorithm with critical path awareness (MTSP) is proposed for solving the HW/SW partitioning problem. First, the critical path (CP) algorithm can locate the critical task queues and output a reduced task graph. Second, the solution to a heuristic algorithm (HA) is used as the initial solution. Third, by introducing hash technology, adding dual memory tables improves the search strength and effectiveness of the tabu search, and the experiment is completed by priority scheduling. MTSP especially has good performance in large task graphs, while it can greatly improve system performance, especially in the case of generating a large communication penalty. The experimental results show that the average improvement over the latest efficient hybrid algorithm is up to 5%. The improvement in algorithm searching time is 66% in comparison to the popular algorithms cited in this paper.

关键词： Hardware/software partitioning task graph heuristic method tabu search algorithm MPSoC

来源：评论

学校读者我要写书评

暂无评论

A new genetic-based tabu search algorithm for unit commitment problem

引用

ELECTRIC POWER SYSTEMS REsearch 1999年第2期49卷 71-78页

作者： Mantawy, AH Abdel-Magid, YL Selim, SZ King Fahd Univ Petr & Minerals Dept Elect Engn Dhahran 31261 Saudi Arabia

This paper presents a new algorithm based on integrating the use of genetic algorithms and tabu search methods to solve the unit commitment problem. The proposed algorithm, which is mainly based on genetic algorithms incorporates tabu search method to generate new population members in the reproduction phase of the genetic algorithm. In the proposed algorithm, genetic algorithm solution is coded as a mix between binary and decimal representation. A fitness function is constructed from the total operating cost of the generating units without penalty terms. In the tabu search part of the algorithm, a simple short term memory procedure is used to counter the danger of entrapment at a local optimum by preventing cycling of solutions, and the premature convergence of the genetic algorithm. A significant improvement of the proposed algorithm results, over those obtained by either genetic algorithm or tabu search, has been achieved. Numerical examples also showed the superiority of the proposed algorithm compared with two classical methods in the literature. (C) 1999 Elsevier Science S.A. All rights reserved.

关键词： tabu search algorithm unit commitment problem genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Protein structure prediction with local adjust tabu search algorithm

引用

BMC BIOINFORMATICS 2014年第15期15卷 1-11页

作者： Lin, Xiaoli Zhang, Xiaolong Zhou, Fengli Wuhan Univ Sci & Technol Sch Comp Sci & Technol Hubei Key Lab Intelligent Informat Proc & Real Ti Wuhan 430065 Peoples R China Wuhan Univ Sci & Technol City Coll Informat & Engn Dept Wuhan 430065 Peoples R China

Background: Protein folding structure prediction is one of the most challenging problems in the bioinformatics domain. Because of the complexity of the realistic protein structure, the simplified structure model and the computational method should be adopted in the research. The AB off-lattice model is one of the simplification models, which only considers two classes of amino acids, hydrophobic (A) residues and hydrophilic (B) residues. Results: The main work of this paper is to discuss how to optimize the lowest energy configurations in 2D off-lattice model and 3D off-lattice model by using Fibonacci sequences and real protein sequences. In order to avoid falling into local minimum and faster convergence to the global minimum, we introduce a novel method (SATS) to the protein structure problem, which combines simulated annealing algorithm and tabu search algorithm. Various strategies, such as the new encoding strategy, the adaptive neighborhood generation strategy and the local adjustment strategy, are adopted successfully for high-speed searching the optimal conformation corresponds to the lowest energy of the protein sequences. Experimental results show that some of the results obtained by the improved SATS are better than those reported in previous literatures, and we can sure that the lowest energy folding state for short Fibonacci sequences have been found. Conclusions: Although the off-lattice models is not very realistic, they can reflect some important characteristics of the realistic protein. It can be found that 3D off-lattice model is more like native folding structure of the realistic protein than 2D off-lattice model. In addition, compared with some previous researches, the proposed hybrid algorithm can more effectively and more quickly search the spatial folding structure of a protein chain.

关键词： tabu search Bovine Spongiform Encephalopathy tabu List tabu search algorithm Fibonacci Sequence

来源：评论

学校读者我要写书评

暂无评论

Eigenvalue assignments in multimachine power systems using tabu search algorithm

引用

COMPUTERS & ELECTRICAL ENGINEERING 2002年第6期28卷 527-545页

作者： Abido, MA Abdel-Magid, YL King Fahd Univ Petr & Minerals Dept Elect Engn Dhahran 31261 Saudi Arabia

Applying tabu search (TS) optimization technique to multimachine power system stabilizer (PSS) design is presented in this paper. The proposed approach employs TS to search for optimal or near optimal settings of PSS parameters that shift the system eigenvalues associated with the electromechanical modes to the left of a vertical line in the s-plane. Incorporation of TS algorithm in PSS design significantly reduces the computational burden. One of the main advantages of the proposed approach is its robustness to the initial guess. The performance of the proposed PSS under different disturbances and loading conditions is investigated for multimachine power systems. The eigenvalue analysis and the nonlinear simulation results show the effectiveness of the proposed PSSs to damp out the local as well as the interarea modes of oscillations and work effectively over a wide range of loading conditions and system configurations. (C) 2002 Elsevier Science Ltd. All rights reserved.

关键词： power system stabilizer tabu search algorithm dynamic stability

来源：评论

学校读者我要写书评

暂无评论

Robust design of multimachine power system stabilisers using tabu search algorithm

引用

IEE PROCEEDINGS-GENERATION TRANSMISSION AND DISTRIBUTION 2000年第6期147卷 387-394页

作者： Abido, MA Abdel-Magid, YL King Fahd Univ Petr & Minerals Dept Elect Engn Dhahran 31261 Saudi Arabia

Robust design of multimachine power system stabilisers (PSSs) using the tabu search (TS) optimisation technique is presented. The proposed approach employs TS for optimal parameter settings of a widely used conventional fu;ed-structure lead-lag PSS (CPSS). The parameters of the proposed stabilisers are selected using TS in order to shift the system poorly damped electromechanical modes at several loading conditions and system configurations simultaneously to a prescribed zone in the left hand side of the s-plane. Incorporation of TS as a derivative-free optimisation technique in PSS design significantly reduces the computational burden. In addition, the quality of the optimal solution does not rely on the initial guess. The performance of the proposed PSSs under different disturbances and loading conditions is investigated for multimachine power systems. The eigenvalue analysis and the nonlinear simulation results show the effectiveness of the proposed PSSs in damping out the local, as well as the interarea, modes and enhance greatly the system stability over a wide range of loading conditions and system configurations.

关键词： damping Power system control multimachine power system stabilisers loading conditions derivative-free optimisation Optimisation techniques Linear algebra (numerical analysis) eigenvalue analysis optimal parameter settings eigenvalues and eigenfunctions poorly damped electromechanical modes search problems tabu search algorithm computational burden reduction nonlinear simulation fixed-structure lead-lag PSS robust design power system stability

来源：评论

学校读者我要写书评

暂无评论

Evaluation performance of genetic algorithm and tabu search algorithm for solving the Max-RWA problem in all-optical networks

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2015年第4期30卷 1042-1061页

作者： Kharroubi, Fouad He, Jing Tang, Jin Chen, Ming Chen, Lin Hunan Univ Sch Informat Sci & Engn Key Lab Micro Nano Optoelect Devices Minist Educ Changsha 410082 Hunan Peoples R China

In this paper, we deal with the static Routing and Wavelength Assignment (RWA) problem in networks with no wavelength converters, and where a given static set of connection demands is prearranged. Our objective is to maximize the number of optical connection-requests that can be established for a given number of wavelengths. A mathematical formulation for Max-RWA was presented. In this article, we implement and compare the performance of two random search algorithms namely: the genetic algorithm and the tabu search algorithm. Using these metaheuristics we solved approximately the wavelength assignment problem for Max-RWA while we computed its routing by a deterministic method which is the backtracking. Therefore we conducted many extensive experiments under different circumstances. Diagrams and representative numerical examples indicate the accuracy of our algorithms.

关键词： Routing and wavelength assignment tabu search algorithm Genetic algorithm Backtracking Metaheuristics Static lightpath demands Random search algorithms

来源：评论

学校读者我要写书评

暂无评论

A comparison of optimization techniques for Loney's solenoids design: An alternative tabu search algorithm

引用

IEEE TRANSACTIONS ON MAGNETICS 2000年第4期36卷 1153-1157页

作者： Cogotti, E Fanni, A Pilo, F Univ Cagliari Dept Elect & Elect Engn I-09124 Cagliari Italy

A global optimization procedure based on tabu search metaheuristic is applied to solve electromagnetic inverse problems. In particular, some benchmark problems have been considered consisting of designing systems of Loney's solenoids. The results obtained implementing different tabu search strategies are compared to those presented in the literature. The comparison shows that the optimality of the solutions can be noticeably improved without increasing the computational effort. However, the importance of using hybrid heuristics has been highlighted in the case of difficult problems.

关键词： magnetic fields meta-heuristic methods optimization methods solenoids tabu search algorithm

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithm and tabu search algorithm for solving the static manycast RWA problem in optical networks

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2017年第2期33卷 726-741页

作者： Zakouni, Amiyne Luo, Jiawei Kharroubi, Fouad Hunan Univ Sch Comp Sci & Elect Engn Changsha 410082 Hunan Peoples R China Yichun Univ Sch Math & Comp Sci Yichun 336000 Jiangxi Peoples R China

The static routing and wavelength assignment (RWA) problem in Optical Networks is a combinatorial optimization problem fit to iterative search methods. In this paper we deal with the static manycast RWA problem in optical networks and solve it by maximizing the number of manycast request established for a given number of wavelengths. In this article, we implement and compare the performance of two metaheuristics namely the GA "Genetic algorithm" and the TSA "tabu search algorithm". The proposed algorithms solve, approximately, the wavelength assignment problem and a backtracking approach is used to solve the routing problem. We first introduce our algorithms. We then evaluate and compare their performance. We corroborate our theoretical findings through extensive simulations. Representative empirical results show the accuracy of our GA and TSA.

关键词： Manycast Routing and wavelength assignment Metaheuristics Genetic algorithm tabu search algorithm Optical networks

来源：评论

学校读者我要写书评

暂无评论

An Adaptive tabu search algorithm for the Open Vehicle Routing Problem with Split Deliveries by Order

引用

WIRELESS PERSONAL COMMUNICATIONS 2018年第1期103卷 595-609页

作者： Xia, Yangkun Fu, Zhuo Cent S Univ Sch Traff & Transportat Engn Changsha 410075 Hunan Peoples R China

In order to reduce the cost of logistics distribution, a capacitated open vehicle routing problem with split deliveries by order is studied. According to the actual situation of split deliveries by order in the practice of logistics distribution, the condition of non-split in the traditional open vehicle routing problem is relaxed, and a new form of discrete split deliveries by order is designed. Based on the classical model of open vehicle routing problem, a corresponding double objective mathematical model with split deliveries by order is established, and an adaptive tabu search algorithm is designed to solve the problem. In order to improve the optimization performance, an adaptive penalty mechanism is designed, a multiple neighborhood structure is constructed, and the tabu list is reinitialized. The comparison with other methods in the literature shows the effectiveness of the algorithm.

关键词： Logistics distribution Open vehicle routing problem Split Split deliveries by order tabu search algorithm Adaptive penalty mechanism Reinitialization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：