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

Two phase heuristic algorithm for the multiple-travelling salesman problem

SOFT COMPUTING 2018年第19期22卷 6567-6581页

作者： Xu, Xiaolong Yuan, Hao Liptrott, Mark Trovati, Marcello Nanjing Univ Posts & Telecommun Dept Comp Sci Nanjing Jiangsu Peoples R China Chinese Acad Sci State Key Lab Informat Secur Beijing Peoples R China Edge Hill Univ Dept Comp Sci Ormskirk England

The multiple-travelling salesman problem (MTSP) is a computationally complex combinatorial optimisation problem, with several theoretical and real-world applications. However, many state-of-the-art heuristic approaches intended to specifically solve MTSP, do not obtain satisfactory solutions when considering an optimised workload balance. In this article, we propose a method specifically addressing workload balance, whilst minimising the overall travelling salesman's distance. More specifically, we introduce the two phase heuristic algorithm (TPHA) for MTSP, which includes an improved version of the K-means algorithm by grouping the visited cities based on their locations based on specific capacity constraints. Secondly, a route planning algorithm is designed to assess the ideal route for each above sets. This is achieved via the genetic algorithm (GA), combined with the roulette wheel method with the elitist strategy in the design of the selection process. As part of the validation process, a mobile guide system for tourists based on the Baidu electronic map is discussed. In particular, the evaluation results demonstrate that TPHA achieves a better workload balance whilst minimising of the overall travelling distance, as well as a better performance in solving MTSP compared to the route planning algorithm solely based on GA.

关键词： Multiple-travelling salesman problem Route planning heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

The harmony search heuristic algorithm for discrete structural optimization

引用

ENGINEERING OPTIMIZATION 2005年第7期37卷 663-684页

作者： Lee, KS Geem, ZW Lee, SH Bae, KW Hanyang Univ Adv Struct Res Stn STRESS Seoul 133791 South Korea Univ Maryland Dept Civil & Environm Engn College Pk MD 20742 USA Pusan Natl Univ Dept Architectural Engn Pusan 609735 South Korea Korea Inst Construct Technol Bldg Struct & Mat Engn Grp Kyonggi Do 411712 South Korea

Many methods have been developed and are in use for structural size optimization problems, in which the cross-sectional areas or sizing variables are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. This paper proposes an efficient optimization method for structures with discrete-sized variables based on the harmony search (HS) heuristic algorithm. The recently developed HS algorithm was conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. In this article, a discrete search strategy using the HS algorithm is presented in detail and its effectiveness and robustness, as compared to current discrete optimization methods, are demonstrated through several standard truss examples. The numerical results reveal that the proposed method is a powerful search and design optimization tool for structures with discrete-sized members, and may yield better solutions than those obtained using current methods.

关键词： structural optimization discrete-sized members harmony search heuristic algorithm truss structures stochastic random search

来源：评论

学校读者我要写书评

暂无评论

An improved heuristic algorithm for 2D rectangle packing area minimization problems with central rectangles

引用

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE 2017年 66卷 1-16页

作者： Wu, Lei Tian, Xue Zhang, Jixu Liu, Qi Xiao, Wensheng Yang, Yaowen China Univ Petr Coll Mech & Elect Engn Qingdao 266580 Peoples R China Nanyang Technol Univ Maritime Inst NTU Sch Civil & Environm Engn Singapore 639798 Singapore Marine Design & Res Inst China Shanghai 200011 Peoples R China CNOOC Safety Technol Serv Co Ltd Tianjin 300456 Peoples R China

Be different with traditional 2D rectangle packing area minimization problem (RPAMP), a specific RPAMP named CR-RPAMP includes one or more central rectangles, which must be located in the center of the final layout. Besides, for CR-RPAMP, the length and width of the final layout are not fixed, but can be changed within a reasonable length width ratio scope. In this paper, based on HACR (heuristic algorithm for CR-RPAMP), an improved heuristic algorithm called IHACR is proposed in order to improve the performance of HACR, especially to decrease the computational complexity of HACR. Compared with HACR, IHACR includes three more rectangle placement mechanisms, which are strategy of combining rectangles, strategy of leaving biggest inner space and strategy of eliminating unnecessary comparisons. Then, a set of schematic descriptions is used to describe the difference between HACR and IHACR. Simulation results based on 34 benchmark instances show that computing time obtained by IHACR is much shorter than that obtained by HACR when solving CR-RPAMP, and the filling rate of final layout obtained by IHACR is bigger than that obtained by HACR while the number of rectangles of the instance is appropriate large. It means that IHACR is more effective and efficient than HACR. Finally, HACR and IHACR are used for solving the equipment layout problem of oil gas water treating system of semi-submersible production platform, and the results show that the performance of IHACR is better than that of HACR. The wonderful final layout obtained by IHACR satisfies the requirements of semi-submersible production platform and verifies the practicality and high-efficiency of IHACR. (C) 2017 Elsevier Ltd. All rights reserved.

关键词： Two-dimensional rectangle packing heuristic algorithm Central rectangle Layout optimization Equipment layout Semi-submersible production platform

来源：评论

学校读者我要写书评

暂无评论

A heuristic algorithm for the allocation of airport runway system capacity

引用

TRANSPORTATION PLANNING AND TECHNOLOGY 2007年第5期30卷 501-520页

作者： Janic, Milan Delft Univ Technol OTB Res Inst NL-2628 BX Delft Netherlands

This paper develops a heuristic algorithm for the allocation of airport runway capacity to minimise the cost of arrival and departure aircraft/flight delays. The algorithm is developed as a potential alternative to optimisation models based on linear and integer programming. The algorithm is based on heuristic (` greedy') criteria that closely reflect the ` rules of thumb' used by air traffic controllers. Using inputs such as arrival and departure demand, airport runway system capacity envelopes and cost of aircraft/flight delays, the main output minimises the cost of arrival and departure delays as well as the corresponding interdependent airport runway system arrival and departure capacity allocation. The algorithm is applied to traffic scenarios at three busy US airports. The results are used to validate the performance of the proposed heuristic algorithm against results from selected benchmarking optimisation models.

关键词： air transportation airports capacity allocation heuristic algorithm delays costs

来源：评论

学校读者我要写书评

暂无评论

A new heuristic algorithm for mix design of high-performance concrete

引用

KSCE JOURNAL OF CIVIL ENGINEERING 2012年第6期16卷 974-979页

作者： Lee, Joo-Ha Yoon, Young-Soo Kim, Joong-Hoon Korea Univ Sch Civil Environm & Architectural Engn Seoul 136713 South Korea Samsung C&T Corp Construct Technol Ctr Seoul 137956 South Korea

Based on the latest developments in concrete technology, High-Performance Concrete (HPC) is characterized by superior properties such as strength, workability, and durability. The modeling and precise proportioning of the concrete mixture are important for expanding the application of HPC. There have been many efforts to develop an expert system for HPC mix proportioning, but the systems developed from these efforts are still somewhat complicated, time-consuming, and have uncertain tasks. In this paper, to provide a tool for the convenient design of HPC mixtures, mix proportioning programs using a new meta-heuristic algorithm called "Harmony Search", which was conceptualized based on a musical process of searching for a perfect harmony, is devised. The mix design programs developed by using harmony search algorithm were compared to other mix design approaches such as neural networks and genetic algorithm. The results showed that the harmony search algorithm can be a potentially strong tool for HPC mix proportioning.

关键词： high-performance concrete mixture proportioning compressive strength workability heuristic algorithm harmony search

来源：评论

学校读者我要写书评

暂无评论

A heuristic algorithm for container loading of pallets with infill boxes

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2016年第3期252卷 728-736页

作者： Liu Sheng Zhao Hongxia Dong Xisong Cheng Changjian Chinese Acad Sci Inst Automat State Key Lab Management & Control Complex Syst Beijing 100190 Peoples R China Qingdao Acad Intelligent Ind Qingdao 266000 Peoples R China

We consider the container loading problem that occurs at many furniture factories where product boxes are arranged on product pallets and the product pallets are arranged in a container for shipments. The volume of products in the container should be maximized, and the bottom of each pallet must be fully supported by the container floor or by the top of a single pallet to simplify the unloading process. To improve the filling rate of the container, the narrow spaces at the tops and sides of the pallets in the container should be filled with product boxes. However, it must be ensured that all of the infill product boxes can be entirely palletized into complete pallets after being shipped to the destination. To solve this problem, we propose a heuristic algorithm consisting of a tree search sub-algorithm and a greedy sub algorithm. The tree search sub -algorithm is employed to arrange the pallets in the container. Then, the greedy sub -algorithm is applied to fill the narrow spaces with product boxes. The computational results on BR1-BR15 show that our algorithm is competitive. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Packing Container loading heuristic algorithm Tree search Greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

A three-phase heuristic algorithm for fixed-charge capacitated material flow network design with input/output points location

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2008年第18期46卷 4963-4980页

作者： Kim, Jae-Gon Kim, Taeho Univ Incheon Dept Ind & Management Engn Dowha Dong 402749 Incheon South Korea Univ Incheon Dept Management Dowha Dong 402749 Incheon South Korea

In this paper, we consider the material flow network design problem in which locations of input and output points of departments and flow paths are determined concurrently on a given block layout. The objective of the problem is to minimize the sum of transportation cost, flow paths construction cost and penalty cost for non-smooth material flows, i.e., flows with turns. A mixed integer programming model is given for the problem and a three-phase heuristic algorithm is developed to solve the problem. In the suggested algorithm, we generate an initial flow network by determining locations of input/output points and flow paths sequentially in the first and second phases, respectively, and then improve it by changing locations of input/output points and flow paths iteratively in the third phase. To evaluate the performance of the suggested algorithms, a series of computational experiments are performed on well-known problem instances as well as randomly generated test problems. Results of computational experiments show that the suggested algorithm gives good solutions in a short computation time.

关键词： material flow network design mixed integer program heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

A novel temporal protein complexes identification framework based on density-distance and heuristic algorithm

引用

NEURAL COMPUTING & APPLICATIONS 2019年第9期31卷 4693-4701页

作者： Xie, Dan Yi, Yang Zhou, Jin Li, Xiaodong Wu, Huikun Hubei Univ Chinese Med Coll Informat Engn Wuhan Hubei Peoples R China Cent China Normal Univ Sch Comp Wuhan Hubei Peoples R China Hubei Prov Hosp Tradit Chinese Med Wuhan Hubei Peoples R China

The construction of dynamic protein-protein interaction networks is affected by cell tissue and its biological function, and the identification of protein complexes is important for understanding biological functions. This paper presents a new method named density-distance and heuristic for identifying temporal protein complexes. First, the gene expression data of time course are integrated into the static protein interaction data and a set of time-ordered networks are obtained. Then, the network is integrated with the gene information to calculate the distance between proteins in the protein-protein interaction network. Based on this distance, we have formed a number of clusters and selected the furthest cluster from the other cluster centers as the initial cluster to ensure that nodes with clusters are closest to each other. Finally, a heuristic algorithm is introduced, and the initial cluster is updated in two ways. The experimental results show that the proposed method has better performance compared with the commonly used algorithms;meanwhile, this method has a strong biological significance.

关键词： Protein complexes Dynamic protein-protein interaction networks heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

Proposing a novel heuristic algorithm for university course timetabling problem with the quality of courses rendered approach;a case study

引用

ALEXANDRIA ENGINEERING JOURNAL 2020年第5期59卷 3355-3367页

作者： Tavakoli, Mohammad Mehdi Shirouyehzad, Hadi Lotfi, Farhad Hosseinzadeh Najafi, Sayed Esmaeil Islamic Azad Univ Sci & Res Branch Dept Ind Engn Tehran Iran Islamic Azad Univ Najafabad Branch Dept Ind Engn Esfahan Iran Islamic Azad Univ Sci & Res Branch Dept Math Tehran Iran

University course timetabling problem has been and id being considered as an operational issue by researchers. The purpose of University Course Timetabling Problem is to allocate academic courses to the lecturers, time slots and classrooms which must be executed in such a manner to promote to quality of education. In this context, a three-stage heuristic algorithm consisting of lecturers, time slots and classes is proposed. By applying the Days of lecturers' attendance to total days of planning ratio, Lecturer quality level in planning context, Offering the simultaneous prerequisite and main courses to the all course ratio, Courses presented in the last time-slot to total courses ratio, Surplus classroom capacity to classroom capacity ratio, Full-time lecturer to total lecturers ratio and Number of classrooms assigned to each lecturer to total available classroom ratio indexes, the planning obtained through this newly proposed algorithm is assessed and the response quality is determined. The available data of the subject university's industrial engineering department is fed in MATLAB software through this algorithm with the objective to have the University Course Timetabling Problem as the output. At its experimental stage, the output is measured through the same indexes revealing that course presentation by the lecturers is 96% of the possible optimum. (C) 2020 The Authors. Published by Elsevier B.V. on behalf of Faculty of Engineering, Alexandria University.

关键词： University course timetabling heuristic algorithm Educational quality Educational planning

来源：评论

学校读者我要写书评

暂无评论

A Novel Dictionary-Based Method for Test Data Compression Using heuristic algorithm

引用

IEICE TRANSACTIONS ON ELECTRONICS 2016年第6期E99C卷 730-733页

作者： Wu, Diancheng Li, Jiarui Wang, Leiou Wang, Donghui Hao, Chengpeng Chinese Acad Sci Inst Acoust Beijing 100190 Peoples R China

This paper presents a novel data compression method for testing integrated circuits within the selective dictionary coding framework. Due to the inverse value of dictionary indices made use of for the compatibility analysis with the heuristic algorithm utilized to solve the maximum clique problem, the method can obtain a higher compression ratio than existing ones.

关键词： automatic test equipment test data compression heuristic algorithm maximum clique problem dictionary-based compression

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：