中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页 机构 成果 学者
  
  1. CAS IR Grid
机构
采集方式
内容类型
发表日期
学科主题
筛选

浏览/检索结果: 共11条，第1-10条 帮助

条数/页： 排序方式：
Approximation algorithms for solving the line-capacitated minimum Steiner tree problem 期刊论文  OAI收割
JOURNAL OF GLOBAL OPTIMIZATION, 2022, 页码: 28
作者:  Li, Jianping;  Wang, Wencheng;  Lichen, Junran;  Liu, Suding;  Pan, Pengxiang
  |  收藏  |  浏览/下载：29/0  |  提交时间：2023/02/07
Bin packing with divisible item sizes and rejection penalties 期刊论文  OAI收割
OPTIMIZATION LETTERS, 2021, 页码: 11
作者:  Li, Jianping;  Pan, Pengxiang;  Cai, Lijian;  Lichen, Junran;  Wang, Wencheng
  |  收藏  |  浏览/下载：36/0  |  提交时间：2022/04/02
Covering Triangles in Edge-Weighted Graphs 期刊论文  OAI收割
THEORY OF COMPUTING SYSTEMS, 2018, 卷号: 62, 期号: 6, 页码: 1525-1552
作者:  Chen, Xujin;  Diao, Zhuo;  Hu, Xiaodong;  Tang, Zhongzheng
  |  收藏  |  浏览/下载：221/0  |  提交时间：2018/07/30
Multiple rules decision-based DE solution for the earliness-tardiness case of hybrid flow-shop scheduling problem 期刊论文  OAI收割
International Journal of Modelling, Identification and Control, 2012, 卷号: 16, 期号: 2, 页码: 97-107
作者:  Han ZH(韩忠华);  Shi HB(史海波);  Qiao F(乔枫);  Yue L(岳磊)
收藏  |  浏览/下载：23/0  |  提交时间：2012/12/28
local search with edge weighting and configuration checking heuristics for minimum vertex cover 会议论文  OAI收割
Cai Shaowei; Su Kaile; Sattar Abdul
收藏  |  浏览/下载：13/0  |  提交时间：2011/10/10
combinatorial optimization problem reduction and algorithm derivation 期刊论文  OAI收割
Ruan Jian Xue Bao/Journal of Software, 2011, 卷号: 22, 期号: 9, 页码: 1985-1993
Zheng Yu-Jun; Xue Jin-Yun; Ling Hai-Feng
  |  收藏  |  浏览/下载：17/0  |  提交时间：2011/10/10
Energy-saving scheduling strategy for elevator group control system based on ant colony optimization (EI CONFERENCE) 会议论文  OAI收割
2010 IEEE Youth Conference on Information, Computing and Telecommunications, YC-ICT 2010, November 28, 2010 - November 30, 2010, Beijing, China
作者:  Zhang J.-L.;  Li J.-F.
收藏  |  浏览/下载：24/0  |  提交时间：2013/03/25
Elevator group control scheduling is to dispatch every elevator to serve call requests from different floors based on some certain goal. It's a kind of typical combinatorial optimization problems. Ant colony algorithm is good at solving the discrete combinatorial optimization  its well global optimization ability and quick convergence velocity are both necessary to a scheduling algorithm. Moreover  reducing passengers' waiting and traveling time is the main focus of current dispatching algorithms  neglecting the energy consumed by the elevator system. So it's necessary to research on energy-saving algorithms. For the purpose of elevator group's energy-conservation run  the objective function of energy is built  ant colony model for elevator group control system is created  its optimization mechanism is figured out  and convergence of the algorithm is studied in this paper. Simulation results show the effectiveness of the strategy. 2010 IEEE.  
an algebraic approach to mechanical tabu search algorithm generation 会议论文  OAI收割
2010 1st IEEE International Conference on Progress in Informatics and Computing, PIC 2010, Shanghai, China, 40878
Zheng Yujun; Shi Haihe; Xue Jinyun
  |  收藏  |  浏览/下载：15/0  |  提交时间：2011/03/31
problem reduction graph model for discrete optimization problems 会议论文  OAI收割
3rd International Joint Conference on Computational Sciences and Optimization, CSO 2010: Theoretical Development and Engineering Practice, Huangshan, Anhui, China, 43979
Zheng Yujun; Xue Jinyun
  |  收藏  |  浏览/下载：19/0  |  提交时间：2011/03/31
approximation and hardness results for label cut and related problems 会议论文  OAI收割
6th Annual Conference on Theory and Applications of Models of Computation, TAMC 2009, Changsha, China, 43969
Zhang Peng; Cai Jin-Yi; Tang Linqing; Zhao Wenbo
收藏  |  浏览/下载：17/0  |  提交时间：2011/03/20