咨询与建议

限定检索结果

文献类型

  • 77 篇 期刊文献
  • 37 篇 会议
  • 1 篇 学位论文

馆藏范围

  • 115 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 91 篇 工学
    • 64 篇 计算机科学与技术...
    • 36 篇 电气工程
    • 12 篇 控制科学与工程
    • 10 篇 信息与通信工程
    • 6 篇 交通运输工程
    • 5 篇 仪器科学与技术
    • 4 篇 机械工程
    • 4 篇 生物工程
    • 3 篇 软件工程
    • 2 篇 力学(可授工学、理...
    • 2 篇 石油与天然气工程
    • 1 篇 材料科学与工程(可...
    • 1 篇 电子科学与技术(可...
    • 1 篇 测绘科学与技术
    • 1 篇 化学工程与技术
    • 1 篇 环境科学与工程(可...
    • 1 篇 城乡规划学
  • 34 篇 理学
    • 23 篇 数学
    • 7 篇 生物学
    • 1 篇 物理学
    • 1 篇 化学
    • 1 篇 地理学
    • 1 篇 系统科学
  • 29 篇 管理学
    • 29 篇 管理科学与工程(可...
    • 2 篇 工商管理
  • 2 篇 经济学
    • 2 篇 应用经济学
  • 2 篇 医学
    • 2 篇 临床医学
  • 1 篇 农学

主题

  • 115 篇 local search alg...
  • 8 篇 genetic algorith...
  • 6 篇 traveling salesm...
  • 6 篇 search problems
  • 5 篇 genetic algorith...
  • 5 篇 multi-agent syst...
  • 4 篇 incomplete algor...
  • 4 篇 convex maximizat...
  • 4 篇 optimization
  • 4 篇 swarm intelligen...
  • 4 篇 distributed cons...
  • 4 篇 combinatorial op...
  • 4 篇 global search al...
  • 4 篇 evolutionary com...
  • 3 篇 multi-objective ...
  • 3 篇 memetic algorith...
  • 3 篇 computational co...
  • 3 篇 piecewise convex...
  • 3 篇 approximation al...
  • 3 篇 integer programm...

机构

  • 3 篇 inria f-78153 le...
  • 2 篇 govt engn coll a...
  • 2 篇 chongqing univ c...
  • 2 篇 liaocheng univ s...
  • 2 篇 dalian univ tech...
  • 2 篇 shanghai univ de...
  • 2 篇 univ versailles ...
  • 2 篇 univ illinois de...
  • 2 篇 beijing jiaotong...
  • 1 篇 univ lisbon fac ...
  • 1 篇 huaiyin inst tec...
  • 1 篇 univ versailles ...
  • 1 篇 vardhaman mahave...
  • 1 篇 ecole mines dept...
  • 1 篇 manchester metro...
  • 1 篇 meidensha corp s...
  • 1 篇 shanghai univ en...
  • 1 篇 natl acad agr sc...
  • 1 篇 kutahya dumlupin...
  • 1 篇 changshu inst te...

作者

  • 4 篇 tseveendorj ider
  • 3 篇 fortin dominique
  • 3 篇 he jingyuan
  • 3 篇 sarac tugba
  • 2 篇 inoue yukinori
  • 2 篇 chen ziyu
  • 2 篇 ye yy
  • 2 篇 zhang jw
  • 2 篇 kang seung-ho
  • 2 篇 sanada masayuki
  • 2 篇 jacobson sh
  • 2 篇 gupta shruti
  • 2 篇 yang yongjian
  • 2 篇 morimoto shigeo
  • 2 篇 tutumlu busra
  • 2 篇 yu zhepeng
  • 2 篇 singh rohit
  • 2 篇 sun lijun
  • 2 篇 turky ayad
  • 2 篇 hussain ashik

语言

  • 110 篇 英文
  • 4 篇 其他
  • 1 篇 土耳其文
检索条件"主题词=Local Search Algorithm"
115 条 记 录,以下是31-40 订阅
排序:
Parallel memetic structures
收藏 引用
INFORMATION SCIENCES 2013年 227卷 60-82页
作者: Caraffini, Fabio Neri, Ferrante Iacca, Giovanni Mol, Aran De Montfort Univ Sch Comp Sci & Informat Ctr Computat Intelligence Leicester LE1 9BH Leics England Univ Jyvaskyla Dept Math Informat Technol Jyvaskyla 40014 Finland Innovat Ctr Adv Sensors & Sensor Syst INCAS3 NL-9400 AT Assen Netherlands
Memetic Computing (MC) structures are algorithms composed of heterogeneous operators (memes) for solving optimization problems. In order to address these problems, this study investigates and proposes a simple yet ext... 详细信息
来源: 评论
Train service design in an urban rail transit line incorporating multiple service routes and multiple train compositions
收藏 引用
TRANSPORTATION REsearch PART C-EMERGING TECHNOLOGIES 2021年 123卷
作者: Li, Zhengyang Zhao, Jun Peng, Qiyuan Southwest Jiaotong Univ Sch Transportat & Logist Chengdu 611756 Sichuan Peoples R China Southwest Jiaotong Univ Natl United Engn Lab Integrated & Intelligent Tra Chengdu 611756 Sichuan Peoples R China Hong Kong Polytech Univ Dept Civil & Environm Engn Hong Kong Peoples R China
This paper focuses on the train service design problem within a given period in an urban rail transit line, where multiple either full-length or short-turn service routes can be operated, and each service route can ut... 详细信息
来源: 评论
Heuristic approaches for the family traveling salesman problem
收藏 引用
INTERNATIONAL TRANSACTIONS IN OPERATIONAL REsearch 2021年 第1期28卷 262-295页
作者: Bernardino, Raquel Paias, Ana Univ Lisbon Fac Ciencias DEIO C6Piso 4 P-1749016 Lisbon Portugal Univ Lisbon Fac Ciencias Ctr Matemat Aplicacoes Fundamentais & Invest Oper C6Piso 1 P-1749016 Lisbon Portugal
In this article, we address the family traveling salesman problem (FTSP), an NP-hard problem that may be seen as a generalization of the traveling salesman problem. In the FTSP, the set of cities is partitioned into s... 详细信息
来源: 评论
Fractal triangular search: a metaheuristic for image content search
收藏 引用
IET IMAGE PROCESSING 2018年 第8期12卷 1475-1484页
作者: Rodrigues, Erick O. Liatsis, Panos Satoru, Luiz Conci, Aura Univ Fed Fluminense Dept Comp Sci Niteroi RJ Brazil Univ Fed Itajuba UNIFEI Dept Comp Sci Itabira MG Brazil Khalifa Univ Sci & Technol Dept Comp Sci Abu Dhabi U Arab Emirates
This work proposes a variable neighbourhood search (FTS) that uses a fractal-based local search primarily designed for images. searching for specific content in images is posed as an optimisation problem, where eviden... 详细信息
来源: 评论
Sparsity-aware, channel order-blind pilot placement with channel estimation in orthogonal frequency division multiplexing systems
收藏 引用
IET COMMUNICATIONS 2015年 第9期9卷 1182-1190页
作者: Peng, Xiaoqing Wu, Weimin Sun, Jun Liu, Yingzhuang Li, Frank Yong Huazhong Univ Sci & Technol Dept Elect & Informat Engn Wuhan 430074 Peoples R China Univ Agder Dept Informat & Commun Technol N-4898 Grimstad Norway
Equispaced pilot arrangement is the most popular scheme for pilot-aided transmission in orthogonal frequency division multiplexing systems. In this study, the authors argue that a non-equispaced pilot pattern may outp... 详细信息
来源: 评论
Data-independent neighborhood functions and strict local optima
收藏 引用
DISCRETE APPLIED MATHEMATICS 2005年 第3期146卷 233-243页
作者: Armstrong, DE Jacobson, SH BAE Syst Arlington VA 22203 USA Univ Illinois Dept Mech & Ind Engn Urbana IL 61801 USA
The paper proves that data-independent neighborhood functions with the smooth property (all strict local optima are global optima) for maximum 3-satisfiability (MAX 3-SAT) must contain all possible solutions for large... 详细信息
来源: 评论
A PAM approach to handling disruptions in real-time vehicle routing problems
收藏 引用
DECISION SUPPORT SYSTEMS 2013年 第3期54卷 1380-1393页
作者: Hu, Xiangpei Sun, Lijun Liu, Linlin Dalian Univ Technol Sch Management & Econ Inst Syst Engn Dalian 116023 Liaoning Provin Peoples R China
During the urban distribution process, unexpected events may frequently result in disruptions to the current distribution plan, which need to be handled in real-time vehicle routing. In this paper, a knowledge-based m... 详细信息
来源: 评论
Clustering of search trajectory and its application to parameter tuning
收藏 引用
JOURNAL OF THE OPERATIONAL REsearch SOCIETY 2013年 第12期64卷 1742-1752页
作者: Lindawati Lau, H. C. Lo, D. Singapore Management Univ Singapore 178902 Singapore
This paper is concerned with automated classification of Combinatorial Optimization Problem instances for instance-specific parameter tuning purpose. We propose the CluPaTra Framework, a generic approach to CLUster in... 详细信息
来源: 评论
Attractive force search algorithm for piecewise convex maximization problems
收藏 引用
OPTIMIZATION LETTERS 2012年 第7期6卷 1317-1333页
作者: Fortin, Dominique Tseveendorj, Ider Univ Versailles Lab PRiSM F-78035 Versailles France INRIA F-78153 Le Chesnay France
We consider mathematical programming problems with the so-called piecewise convex objective functions. A solution method for this interesting and important class of nonconvex problems is presented. This method is base... 详细信息
来源: 评论
Piece adding technique for convex maximization problems
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 2010年 第4期48卷 583-593页
作者: Fortin, Dominique Tseveendorj, Ider Univ Versailles Lab PRiSM F-78035 Versailles France INRIA F-78153 Le Chesnay France
In this article we provide an algorithm, where to escape from a local maximum y of convex function f over D, we (locally) solve piecewise convex maximization max{min{f (x) - f (y), p (y) (x)} | x is an element of D} w... 详细信息
来源: 评论