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

Solving the Observing and Downloading Integrated Scheduling Problem of Earth Observation Satellite with a Quantum Genetic Algorithm

引用

Journal of Systems Science and Information 2018年第5期9卷 399-420页

作者： Ye ZHANG Xiaoxuan HU Waiming ZHU Peng JIN School of Management Hefei University of Technology Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education

This paper addresses the integrated Earth observation satellite scheduling problem. It is a complicated problem because observing and downloading operations are both involved. We use an acyclic directed graph model to describe the observing and downloading integrated scheduling *** on the model which considering energy constraints and storage capacity constraints, we develop an efficient solving method using a novel quantum genetic algorithm. We design a new encoding and decoding scheme that can generate feasible solution and increase the diversity of the *** results of the simulation experiments show that the proposed method solves the integrated Earth observation satellite scheduling problem with good performance and outperforms the genetic algorithm and greedy algorithm on all instances.

关键词： Earth observation satellite integrated scheduling quantum genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Heuristic algorithms for scheduling on uniform parallel machines with heads and tails

引用

Journal of Systems Engineering and Electronics 2011年第3期22卷 462-467页

作者： Kai Li Shanlin Yang School of Management Hefei University of TechnologyHefei 230009P.R.China Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of EducationHefei University of TechnologyHefei 230009P.R.China

This paper considers the uniform parallel machine scheduling problem with unequal release dates and delivery times to minimize the maximum completion *** this NP-hard problem,the largest sum of release date,processing time and delivery time first rule is designed to determine a certain machine for each job,and the largest difference between delivery time and release date first rule is designed to sequence the jobs scheduled on the same machine,and then a novel algorithm for the scheduling problem is *** evaluate the performance of the proposed algorithm,a lower bound for the problem is *** accuracy of the proposed algorithm is tested based on the data with problem size varying from 200 jobs to 600 *** computational results indicate that the average relative error between the proposed algorithm and the lower bound is only 0.667%,therefore the solutions obtained by the proposed algorithm are very accurate.

关键词： scheduling parallel machine uniform release date/head delivery time/tail.

来源：评论

学校读者我要写书评

暂无评论

Pricing and production strategies in remanufacturing from the perspectives of supply chain: Review and future directions

引用

Frontiers of Engineering Management 2024年第1期11卷 1-15页

作者： Kai LI Yan LI Nenggui ZHAO School of Management Hefei University of TechnologyHefei 230009China Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of EducationHefei 230009China

Remanufacturing is widely recognized as beneficial to the environment and a circular economy. However, remanufacturing is more complex than traditional manufacturing due to the effects of government policy, uncertainty of consumer preferences, competition and cooperation among firms, and so on. These factors motivate academics to optimize remanufacturing outcomes, especially for product pricing and production. This study reviews the published literature on pricing and production strategies in remanufacturing from four perspectives of supply chain, namely, government policy, consumer characteristics, relationships among firms, and supply chain structures. Review results can benefit scholars/practitioners in the future by highlighting the challenges and opportunities in remanufacturing strategies.

关键词： remanufacturing reverse and closed-loop supply chain circular economy

来源：评论

学校读者我要写书评

暂无评论

Earth observation satellite scheduling for emergency tasks

引用

Journal of Systems Engineering and Electronics 2019年第5期30卷 931-945页

作者： SUN Haiquan XIA Wei HU Xiaoxuan XU Chongyan School of Management Hefei University of TechnologyHefei 230009China Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of EducationHefei 230009China Graduate School Beijing Institute of Remote Sensing InformationBeijing 100192China

The earth observation satellites(EOSs)scheduling problem for emergency tasks often presents many *** example,the scheduling calculation should be completed in seconds,the scheduled task rate is supposed to be as high as possible,the disturbance measure of the scheme should be as low as possible,which may lead to the loss of important observation opportunities and data transmission *** scheduling algorithms are not designed for these ***,we propose a rolling horizon strategy(RHS)based on event triggering as well as a heuristic algorithm based on direct insertion,shifting,backtracking,deletion,and reinsertion(ISBDR).In the RHS,the driven scheduling mode based on the emergency task arrival and control station time window events are designed to transform the long-term,large-scale problem into a short-term,small-scale problem,which can improve the schedulability of the original scheduling scheme and emergency response *** the ISBDR algorithm,the shifting rule with breadth search capability and backtracking rule with depth search capability are established to realize the rapid adjustment of the original plan and improve the overall benefit of the plan and early completion of emergency ***,two heuristic factors,namely the emergency task urgency degree and task conflict degree,are constructed to improve the emergency task scheduling guidance and algorithm ***,we conduct extensive experiments by means of simulations to compare the algorithms based on ISBDR and direct insertion,shifting,deletion,and reinsertion(ISDR).The results demonstrate that the proposed algorithm can improve the timeliness of emergency tasks and scheduling performance,and decrease the disturbance measure of the scheme,therefore,it is more suitable for emergency task scheduling.

关键词： emergency task rolling horizon shifting rule backtrackingrule

来源：评论

学校读者我要写书评

暂无评论

RETRACTED ARTICLE: Research of fractal dimension calculation algorithm based on Mobile Box-Counting Method

RETRACTED ARTICLE: Research of fractal dimension calculation...

引用

2011 7th International Conference on Natural Computation, ICNC 2011

作者： Li, Feng-Gang Gong, Wei-Feng Li, Ying Liang, Yu Wang, Xiao-Lu Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education Hefei University of Technology Hefei 230009 China

ISBN: (纸本)9781424499533

Fractal data mining technology is based on the fractal characteristic of data set, the real data set usually exists approximate fractal characteristic in the fractal non-scaling interval. Fractal dimension can describe the fractal characteristic of data sets, but the most popular fractal dimension calculation algorithm gets the minimal cover set using Box-Counting method is inaccurate. Mobile Box-Counting Method which finds the minimal cover set more accurately by moving and merging multi-dimensional grid can calculate fractal dimension more accurately. © 2011 IEEE.

关键词： Fractal dimension

来源：评论

学校读者我要写书评

暂无评论

A Multi-dimensional Trust-aware Cloud Service Selection Mechanism Based on Evidential Reasoning Approach

引用

International Journal of Automation and computing 2015年第2期12卷 208-219页

作者： Wen-Juan Fan Shan-Lin Yang Harry Perros Jun Pei School of Management Hefei University of Technology Department of Computer Science North Carolina State University The Ministry of Education Key Laboratory of Process Optimization and Intelligent Decision Making Department of Industry and System Engineering University of Florida

In the last few years, cloud computing as a new computing paradigm has gone through significant development, but it is also facing many problems. One of them is the cloud service selection problem. As increasingly boosting cloud services are offered through the internet and some of them may be not reliable or even malicious, how to select trustworthy cloud services for cloud users is a big challenge. In this paper, we propose a multi-dimensional trust-aware cloud service selection mechanism based on evidential reasoning(ER) approach that integrates both perception-based trust value and reputation based trust value, which are derived from direct and indirect trust evidence respectively, to identify trustworthy services. Here, multi-dimensional trust evidence, which reflects the trustworthiness of cloud services from different aspects, is elicited in the form of historical users feedback ratings. Then, the ER approach is applied to aggregate the multi-dimensional trust ratings to obtain the real-time trust value and select the most trustworthy cloud service of certain type for the active users. Finally, the fresh feedback from the active users will update the trust evidence for other service users in the future.

关键词： Cloud service selection multi-dimensional trust evidence trust and reputation evaluation evidential reasoning(ER) clond service

来源：评论

学校读者我要写书评

暂无评论

Multi-CODP decision models for supplier selection and order allocation in customized logistics service supply chain

引用

Neural Computing and Applications 2024年第19期36卷 11097-11119页

作者： Hu, Xiaojian Xu, Liangcheng Yao, Gang Wu, Zhening School of Management Hefei University of Technology Tunxi Anhui Hefei230009 China Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education Tunxi Anhui Hefei230009 China

To address the problem of positioning customer order decoupling point (CODP) in customized logistics service supply chain and to provide logistics service integrators (LSI) with various CODP decision-making and supplier selection solutions. We consider LSI, logistics service providers (LSPs) and customers and propose multiobjective nonlinear team optimization models for multi-CODP location, including minimizing the cost to the LSI and maximizing the synthetic satisfaction of LSPs and customers. This paper adopts an improved nondominated sorting genetic algorithm (NSGA-II), in which the key modules such as the crossover operations, chromosome structure and mutation operations are reconstructed, to solve the team models and investigate the Pareto-optimal front for the two objectives. To demonstrate the validity of NSGA-II and the reliability of mathematical models, cases from a specific dataset are generated and solved. Moreover, a classic genetic algorithm (GA) is applied to solve for the two objectives separately. The optimal solutions found by GA are f1 = 2027.491, f2 = 0.7704 and f1 = 2454.512, f2 = 0.8909. The corresponding optimal solutions in the Pareto-optimal solution set are f1 = 2053.675, f2 = 0.7715 and f1 = 2427.114, f2 = 0.8843. We find that the optimal solutions provided by GA cannot dominate any solution in the Pareto-optimal solution set, indicating that the results are valid and sufficiently convergent. In summary, the results of this paper provide LSI with easy access to various supplier selection schemes with multi-CODP, which is essential to reduce the cognitive burden on decision makers and address the diverse customization needs of many challenging real-world logistics issues. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

The utility frequent pattern mining based on slide window in data stream

The utility frequent pattern mining based on slide window in...

引用

2012 5th International Conference on intelligent Computation Technology and Automation, ICICTA 2012

作者： Li, Feng-Gang Sun, Ying-Jia Ni, Zhi-Wei Liang, Yu Mao, Xue-Ming Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education Hefei University of Technology Hefei 230009 China

ISBN: (纸本)9780769546377

In traditional study of mining data stream, each item in the data stream is of equal importance. However, in practice, each item has a different significance, which is known as utility. This paper combines frequent mining item sets with utility and proposes an efficient algorithm for utility frequent pattern mining (UFPM). It combines bitmap with tree structure that can store and update the pattern of data stream quickly and completely by scanning only once. The algorithm generated by lexicographic order, proposes a novel tree U-tree and makes convenience for pattern updating and user reading. With a pattern growth approach in mining, the algorithm can effectively avoid the problem of a mass candidacy generation by level-wise searching. The experiments results show that our algorithm which is in high efficiency and good scalability outperforms the existing analogous algorithm. © 2012 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Smart surgical telementoring system with patch-to-pixel point tracking method

EngMedicine

引用

EngMedicine 2025年第1期2卷

作者： Yanwei Qu Ling Li Tongtong Li Jieyu Zheng Wentao Tang Xiaojian Li School of Management Hefei University of Technology Hefei 230009 Anhui China Philosophy and Social Sciences Laboratory of Data Science and Smart Society Governance Ministry of Education Hefei 230009 Anhui China Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education Hefei 230009 Anhui China Hefei Haochuan Information Technology Co. Ltd Hefei 230088 Anhui China Ministry of Education Engineering Research Center for Intelligent Decision-Making Information System Technologies Hefei 230009 Anhui China

The utilization of surgical telementoring has become increasingly prevalent in enhancing the surgical standards of grassroots hospitals in contemporary times. In the traditional framework of surgical telementoring, remote doctors guide grassroots doctors via video and audio communication, which may encounter obstacles such as inadequate information transfer and challenges in accurately pinpointing the surgical site and path. To mitigate these issues, this study introduces an intelligent surgical telementoring system based on edge computing. This system enables the transmission of points marked by remote doctors to grassroots doctors, updating these points’ coordinates in real-time on the local endoscopic video. In this system, a novel method named P2PTracking (Patch-to-Pixel Point Tracking) is implemented. This process begins with the tracking of a square patch surrounding the point marked by the remote doctor using SiameseFC. Following this, feature matching is performed on the tracked patch in the current frame and the square patch in the labelled frame or template frame. The affine transformation is then calculated based on the feature matching results. Lastly, the point tracking result is derived using the computed affine transformation. Experimental results indicate that the proposed system has a transmission speed of 1.99M/s and a transmission latency of 171 ms when transmitting video at a resolution of 1920 × 1080px, while the proposed method can achieve an accuracy of 96.6 % when the pixel error is 4. The code and data are available at https://***/hfut66/*** .

关键词： Surgical telementoring Patch tracking Point tracking Feature matching Template update mechanism

来源：评论

学校读者我要写书评

暂无评论

A data-driven open decision framework based on adaptive evidential reasoning rule

引用

Computers & Industrial Engineering 2025年 206卷

作者： Chao Fu Wenjun Chang Min Xue Guangyan Lu School of Management Hefei University of Technology Hefei Box 270 Hefei 230009 Anhui China Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education Hefei 230009 Anhui China Ministry of Education Engineering Research Center for Intelligent Decision-Making & Information System Technologies Hefei 230009 Anhui China Department of Operation Management CRRC Qishuyan Instiute Co. Ltd Changzhou Jiangsu 213011 China

Data accumulation is beneficial to efficiently make decisions on new cases. However, it is rare to use the historical data of experienced decision makers to help inexperienced decision makers generate solutions to new cases in an open and adaptive way. To address this issue, a data-driven open decision framework is developed based on an adaptive evidential reasoning (ER) rule. Giving two assumptions, criterion weights are learned from historical individual and overall assessments while criterion reliabilities are learned from historical individual assessments and gold standards. The adaptive ER rule is developed based on two abstract functions with the variables of criterion weight and criterion reliability, respectively, whose properties are analyzed. With these foundations, the general situation of the open decision framework is demonstrated from the learning, aggregation, and prediction hierarchies. Three special situations of the framework are presented to make it flexible. The historical data of more experienced decision makers are allowed in the framework to ensure its openness. The applicability of the general situation of the open decision framework is examined by its use in helping diagnose breast lesions. Its performance is highlighted by the comparison with the three special situations of the framework, five representative machine learning algorithms, and the framework with four forms of two abstract functions.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：