PATH-RELINKING

作品数：6被引量：21H指数：2
导出分析报告
相关领域：自动化与计算机技术更多>>
相关作者：朱文兴詹青青更多>>
相关机构：福州大学大连理工大学更多>>
相关期刊：《Journal of Systems Engineering and Electronics》《Journal of Computer Science & Technology》《Journal of Beijing Institute of Technology》《Chinese Journal of Electronics》更多>>
相关基金：国家自然科学基金福建省自然科学基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-6
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Greedy Randomized Adaptive Search Procedure with Path-Relinking for the Vertex p-Center Problem被引量：1
《Journal of Computer Science & Technology》2017年第6期1319-1334,共16页Ai-Hua Yin Tao-Qing Zhou Jun-Wen Ding Qing-Jie Zhao Zhi-Peng Lv 
The research was supported by the National Natural Science Foundation of China under Grant Nos. 61370183 and 61262011.
The p-center problem consists of choosing a subset of vertices in an undirected graph as facilities in order to minimize the maximum distance between a client and its closest facility. This paper presents a greedy ran...
关键词：p-center problem tabu search PATH-RELINKING facility location 
Generalized multiple time windows model based parallel machine scheduling for TDRSS被引量：1
《Journal of Beijing Institute of Technology》2016年第3期382-391,共10页LIN Peng KUANG Lin-ling CHEN Xiang YAN Jian LU Jian-hua WANG Xiao-juan 
Supported by the National Natural Science Foundation of China(91338101,91338108,61132002,6132106);Research Fund of Tsinghua University(2011Z05117);Co-innovation Laboratory of Aerospace Broadband Network Technology
The scheduling efficiency of the tracking and data relay satellite system（TDRSS）is strictly limited by the scheduling degrees of freedom（DoF）,including time DoF defined by jobs＇ flexible time windows and spatial ...
关键词：parallel machine scheduling problem with generalized multiple time windows （PMGMTW） positive/negative adaptive subsequence adjustment （p/n-ASA） evolutionary asymmetric key-path-relinking （EvAKPR） 
Adaptive subsequence adjustment with evolutionary asymmetric path-relinking for TDRSS scheduling被引量：12
《Journal of Systems Engineering and Electronics》2014年第5期800-810,共11页Peng Lin Linling Kuang Xiang Chen Jian Yan Jianhua Lu Xiaojuan Wang 
supported by the National Natural Science Foundation of China(61132002;91338101;91338108);the National S&T Major Project(2011ZX03004-001-01);the Research Fund of Tsinghua University(2011Z05117);the Co-innovation Laboratory of Aerospace Broadband Network Technology
Due to the limited transmission resources for data relay in the tracking and data relay satellite system （TDRSS）, there are many job requirements in busy days which will be discarded in the conventional job scheduli...
关键词：nonhomogeneous parallel machines scheduling problem with time window （NPM-TW） adaptive subsequence adjustment （ASA） asymmetric path-relinking （APR） evolutionary asymmetric path-relinking （EvAPR）. 
Application of Ant Colony Optimization for the Solution of 3 Dimensional Cuboid Structures被引量：1
《Journal of Computer and Communications》2014年第4期99-107,共9页Hüseyin Eldem Erkan Ulker 
Traveling Salesman Problem (TSP) is one of the most widely studied real world problems of finding the shortest (minimum cost) possible route that visits each node in a given set of nodes (cities) once and then returns...
关键词：Euclidean TSP Ant Colony Optimization METAHEURISTIC PATH-RELINKING Path Planning CUBOID 
Jumping PSO with Expanding Neighborhood Search for TSP on a Cuboid被引量：2
《Chinese Journal of Electronics》2013年第1期202-208,共7页SU Shoubao CAO Xibin 
This work is supported in part by the National Natural Science Foundation of China （No.61075049, No.61273096）, the National Defence Pre-research Foundation of China （No.113020102）, and the Funds for Creative Research Groups of China （No.61021002）.
Path planning on the surfaces of a cuboid-shaped object is a scientific value and practical significance of the research topic, because of its potential applications with many fields. On basis of analysis for calculat...
关键词：Particle swarm optimization Travelingsalesman problem （TSP） Expanding neighborhood search（ENS） PATH-RELINKING Path planning Cuboid. 
基于贪心随机自适应搜索的电路划分改进算法被引量：4
《浙江大学学报（工学版）》2007年第10期1679-1683,共5页詹青青 朱文兴 
福建省自然科学基金资助项目(2006J0030)
为提高基于迭代改进的传统电路划分算法的划分质量,提出了一种基于贪心随机自适应搜索过程(greedyrandomized adaptive search procedure,GRASP)的电路划分改进算法.GRASP由构造阶段和局部搜索阶段组成,能够快速构造较好的初始划分.在...
关键词：电路划分 贪心随机自适应搜索过程 启发式策略 PATH-RELINKING 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部