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

2016 2nd International Conference on Electronics,Network and Computer Engineering(ICENCE 2016)

作者： Tao Wang Network Information Center Tonghua Normal University

In this paper, vehicle routing problem as the background, the traditional tabu search algorithm is proposed based on a set of methods to build the initial solution and its integration to achieve the dual tabu search algorithm for vehicle routing problem. A new algorithm to avoid the shortcomings of the traditional tabu search algorithm is too dependent on the initial solution, the simulation tests to verify the feasibility and effectiveness of the algorithm.

关键词： Vehicle Routing Problem tabu search algorithm Double tabu search algorithm

来源：评论

学校读者我要写书评

暂无评论

Improved Genetic-tabu search algorithm in Bus Scheduling Study

Improved Genetic-Tabu Search Algorithm in Bus Scheduling Stu...

引用

2010 3rd International Conference on Computer and Electrical Engineering(ICCEE 2010)

作者： WANG Qing-rong ZHU Chang-sheng HUANG Hong-yong YUAN Yuan WANG Qing- rong School of Computer and Communication Lanzhou University of Technology School of Electronic and Information Engineering Lanzhou Jiaotong University

Because the existence of defects in the traditional genetic algorithm,we use the improved the genetic-tabu search algorithm(GA-TS) in this paper for the optimization of bus scheduling model,then got over the traditional genetic algorithm's problem such as slow-evolution,premature,local optimal solution and other issues,simulation results show that:GA-TS optimize performance superior to the traditional genetic algorithm.

关键词： public transit genetic algorithm tabu search algorithm Improved genetic-tabu search algorithm

来源：评论

学校读者我要写书评

暂无评论

A CORROSION DIAGNOSIS APPROACH FOR GROUNDING GRIDS BASED ON tabu search algorithm

A CORROSION DIAGNOSIS APPROACH FOR GROUNDING GRIDS BASED ON ...

引用

2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)

作者： JIAN-XIN WANG JIAN LIU SEN WANG Electrical and Control Engineering College Xi'an University of Science & Technology Xi'an 710054 Shaanxi Electric Power Research Institute Xi'an 710054 China

In order to detect the corrosion of grounding grids, a corrosion diagnosis approach based on tabu search (TS)algorithm is put forward. A grounding grid is excited between couples of touchable nodes by a current source. Some voltages of touchable nodes are measured in each *** the energy of the error between testing voltages and evaluation voltages is used as the index. The designed values of branches are used as the initial values. A tabu list is formed for the branches. In each step of iteration, the resistance of each branch is increased and decreased with a certain value, respectively, forming a set of neighborhood. The aspiration criterion and stop criterion are adopted. An experimental grounding grid with sixty branches is used as an example to show the feasibility of the proposed approach. It is also shown that the proposed approach has the advantage of less sensitivity to testing errors.

关键词： Grounding grids corrosion diagnosis tabu search algorithm

来源：评论

学校读者我要写书评

暂无评论

A tabu search algorithm for Routing and Spectrum Allocation in Elastic Optical Networks

A Tabu Search Algorithm for Routing and Spectrum Allocation ...

引用

International Conference on Transparent Optical Networks

作者： Roza Goscien Miroslaw Klinkowski Krzysztof Walkowiak National Institute of Telecommunications Szachowa 1 00-894 Warsaw Poland Wroclaw University of Technology Wybrzeze Wyspianskiego 27 50-370 Wroclaw Poland

ISBN: (纸本)9781479956029

In this paper we present a tabu search-based algorithm, which is dedicated to solving the routing and spectrum allocation problem in elastic optical networks. To evaluate performance of the proposed method, we carry a number of experiments on realistic network topologies. We compare our method with both optimal results yielded by the CPLEX solver and results obtained by heuristic algorithms that were proposed in the literature for the same optimization problem. The findings of our investigation show that the proposed tabu search method provides the solutions close to optimal ones and it significantly outperforms the reference methods.

关键词： elastic optical networks routing and spectrum allocation tabu search algorithm optimization

来源：评论

学校读者我要写书评

暂无评论

A tabu search-Based Memetic algorithm for Hardware/Software Partitioning

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2014年第1期2014卷 1-15页

作者： Lin, Geng Zhu, Wenxing Ali, M. Montaz Minjiang Univ Dept Math Fuzhou 350108 Peoples R China Fuzhou Univ Ctr Discrete Math & Theoret Comp Sci Fuzhou 350108 Peoples R China Univ Witwatersrand Fac Sci Sch Computat & Appl Math ZA-2050 Johannesburg South Africa Univ Witwatersrand Fac Engn & Build Environm TCSE ZA-2050 Johannesburg South Africa

Hardware/software (HW/SW) partitioning is to determine which components of a system are implemented on hardware and which ones on software. It is one of the most important steps in the design of embedded systems. The HW/SW partitioning problem is an NP-hard constrained binary optimization problem. In this paper, we propose a tabu search-based memetic algorithm to solve the HW/SW partitioning problem. First, we convert the constrained binary HW/SW problem into an unconstrained binary problem using an adaptive penalty function that has no parameters in it. A memetic algorithm is then suggested for solving this unconstrained problem. The algorithm uses a tabu search as its local search procedure. This tabu search has a special feature with respect to solution generation, and it uses a feedback mechanism for updating the tabu tenure. In addition, the algorithm integrates a path relinking procedure for exploitation of newly found solutions. Computational results are presented using a number of test instances from the literature. The algorithm proves its robustness when its results are compared with those of two other algorithms. The effectiveness of the proposed parameter-free adaptive penalty function is also shown.

关键词： tabu search algorithm algorithmS COMPUTER input-output equipment COMPUTER software PARALLEL algorithms PROBLEM solving

来源：评论

学校读者我要写书评

暂无评论

A Biogeography-Based Optimization algorithm Hybridized with tabu search for the Quadratic Assignment Problem

引用

COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE 2016年第1期2016卷 1-13页

作者： Lim, Wee Loon Wibowo, Antoni Desa, Mohammad Ishak Haron, Habibollah UTM Fac Comp Johor Baharu 81310 Johor Malaysia Univ Utara Malaysia UUM Coll Arts & Sci Sch Quantitat Sci Sintok 06010 Kedah Malaysia Univ Teknikal Malaysia Melaka Fac Informat & Commun Technol Durian Tunggal 76100 Melaka Malaysia

The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par with other optimization methods. A classical BBO algorithm employs the mutation operator as its diversification strategy. However, this process will often ruin the quality of solutions in QAP. In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure. Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times. Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them.

关键词： BIOGEOGRAPHY tabu search algorithm QUADRATIC assignment problem MATHEMATICAL optimization MUTATIONS (Algebra) HYBRID systems

来源：评论

学校读者我要写书评

暂无评论

WSN Clustering Routing algorithm Based on Hybrid Genetic tabu search

引用

WIRELESS PERSONAL COMMUNICATIONS 2022年第4期124卷 3485-3506页

作者： Yu Xiuwu Ying, Li Yong, Liu Hao, Yu Univ South China Changsha 421001 Hunan Peoples R China

In order to effectively prolong the lifetime of wireless sensor network and balance network energy consumption, a WSN clustering routing algorithm based on hybrid genetic tabu search (CRGT) is proposed. Firstly, in the stage of cluster head election, two parameters, the residual energy of nodes and the distance from nodes to Sink node, are introduced to optimize the threshold function to make the cluster head election more reasonable. Secondly, in the stage of clustering, ordinary nodes join the cluster with the lowest cost according to the cost function to balance the node energy. Finally, a hybrid genetic tabu search algorithm is introduced to select the optimal path with the least energy consumption during data transmission. The simulation results show that, compared with the other two clustering routing algorithms, CRGT algorithm effectively prolongs the network lifetime, and the energy consumption is more balanced.

关键词： Wireless sensor network Routing Clustering Genetic algorithm tabu search algorithm

来源：评论

学校读者我要写书评

暂无评论

EOS lumping optimization using a genetic algorithm and a tabu search

引用

JOURNAL OF PETROLEUM SCIENCE AND ENGINEERING 2019年 174卷 495-513页

作者： Hoffmann, A. Tieto Paris France

To reduce CPU time in compositional petroleum simulation models (e.g. compositional reservoir simulations), a minimum number of components should be used in the equation of state (EOS) to describe the fluid phase and volumetric behavior. A "detailed" EOS model often contains from 20 to 40 components, with the first 10 components representing pure compounds and the remaining components represent a split of the heavier C-6(+) material in single-carbon-number (SCN) fractions. A "pseudoized" (or lumped) EOS model might contain only 6-9 lumped components. The selection of which components to lump together is difficult because of the huge number of possible combinations. This paper describes an automated method to find the best pseudoized EOS model based on an initial detailed SCN EOS model. The method is based on (1) a fitness function quantifying the quality of match between a pseudoized EOS model and the detailed SCN EOS model from which it is derived, (2) a genetic algorithm used to obtain a first initial solution and (3) a tabu search to refine this initial solution and find the optimal lumping scheme. The method allows for a set of constraints to be imposed on the lumping of components, such as (1) not lumping certain components (e.g. CO2), (2) forcing lumping of some components (e.g. i- C-4 and n- C-4). The proposed procedure was successfully able to find the optimal lumped EOS from a detailed SCN EOS with 34 components for three scenarios with different number of components in the lumped EOS (15, 9 and 6). The runtime is ranging from 10 to 45 min.

关键词： Equation of state Lumping Genetic algorithm tabu search algorithm Optimization

来源：评论

学校读者我要写书评

暂无评论

A Hybrid algorithm of Particle Swarm Optimization and tabu search for Distribution Network Reconfiguration

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2016年第1期2016卷 1-7页

作者： Fang, Sidun Zhang, Xiaochen Shanghai Jiao Tong Univ Sch Elect Informat & Elect Engn Shanghai 200240 Peoples R China Georgia Inst Technol Dept Comp Sci & Elect Engn Atlanta GA 30314 USA

This paper deals with the distribution network reconfiguration problem. A hybrid algorithm of particle swarm optimization (PSO) and tabu search (TS) is proposed as the searching algorithm. The new algorithm shares the advantages of PSO and TS, which has a fast computation speed and a strong ability to avoid local optimal solution. After a thorough comparison, network random key (NRK) is introduced as the corresponding coding strategy among various tree representation strategies. NRK could completely avoid the generation of infeasible solutions during the searching process and has a good locality property, which allows the new hybrid algorithm to perform to its fullest potential. The proposed algorithm has been validated through an IEEE 33 bus test case. Compared with other algorithms, the proposed method is both accurate and computationally efficient. Furthermore, a test to solve another problem also proves the robustness of the proposed algorithm for a different problem.

关键词： COMPUTER bus testing search algorithms tabu search algorithm PARTICLE swarm optimization ROBUST statistics

来源：评论

学校读者我要写书评

暂无评论

The multi-route location-routing problem and zone price decision-making using a tabu and variable neighborhood search algorithm

引用

JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING 2018年第5期35卷 277-297页

作者： Setak, Mostafa Sadeghi-Dastaki, Mohsen Karimi, Hossein KN Toosi Univ Technol Fac Ind Engn Tehran Iran Univ Bojnord Dept Ind Engn Bojnurd Iran

Zone pricing is one of the most important pricing policies that are prevalently used by very companies. This paper considers integrating zone pricing and location-routing problems for profit maximization. Hence, a node-based model is proposed as mixed integer nonlinear programming to solve the problem. In order to handle the nonlinearity elements and change the model to a mixed integer linear programming, a piecewise linearization method is employed to approximate the problem. Moreover, we introduce a new heuristic variable neighborhood search (VNS) and tabu search algorithm for large-scale problems. The proposed algorithms consist of four intra-tour and seven inter-tour operators in its local search. Finally, some test instances with 20, 200, 400, and 600 nodes are solved and the results of them confirm the efficiency of the proposed algorithms and comparative superiority of the VNS algorithm over the tabu search algorithm.

关键词： Location-routing problem pricing zone pricing variable neighborhood search algorithm tabu search algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：