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

Approximation algorithms for two-stage supply chain scheduling of production and distribution

International Journal of Systems Science: Operations and Logistics 2015年第2期2卷 78-89页

作者： Cheng, Bayi Li, Kai Hu, Xiaoxuan School of Management Hefei University of Technology Hefei China Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education Hefei China

In this paper, we investigate a class of two-stage optimisation problems for manufacturers in supply chains. The objective is to optimise production and outbound distribution. In the production part, the manufacturer has identical batch-processing machines with limited capacity in size. The processing times and sizes of jobs are determined by the customer. As long as the total size of jobs in a batch does not exceed the machine capacity, the batch can be processed on any machine. The processing of a batch cannot be interrupted until all the jobs in the batch have been completed. In the distribution part, the manufacturer assigns the completed jobs in groups and delivers them to the customer with its own vehicles. We propose the model of minimising service span, which lasts from the processing of the first job to the delivery of the last job. We investigate two types of machine configuration, including single machine and parallel machines. In the vehicle configuration, we consider two cases including infinite vehicles and a fixed number of vehicles. We show all the problems under investigation are NP-hard. For each problem, we design an effective polynomial time algorithm. We analyse the time complexity and show the performance guarantees of the algorithms. © 2014, © 2014 Taylor & Francis.

关键词： approximation algorithm arbitrary-size jobs batch-processing machines supply chain scheduling

来源：评论

学校读者我要写书评

暂无评论

CO-RS: A new method for opinion mining based on semi-supervised learning and ensemble learning

引用

ICIC Express Letters 2015年第7期9卷 1803-1808页

作者： Wang, Gang Li, Ningning School of Management Hefei University of Technology No. 193 Tunxi Road Hefei China Key Laboratory of Process Optimization and Intelligent Decision-Making Ministry of Education Hefei University of Technology No. 193 Tunxi Road Hefei China

In recent years many machine learning methods have been proposed for opinion mining and the effectiveness of applying them to opinion mining has also been approved theoretically. However, machine learning methods encounter many problems when they are used in practice. One of the problems is to construct learning systems with strong generalization ability. In this study, we propose, Co-RS, a semi-supervised method for opinion mining based on co-training and Random Subspace. Co-RS tries to get the strong generalization ability by integrating the strength of two machine learning paradigms, i.e., semi-supervised learning and ensemble learning. Moreover, four public opinion datasets were investigated to verify the effectiveness of proposed method. Empirical results reveal that Co-RS gets the best result among the compared methods. These results illustrate that Co-RS can be used as a viable method for opinion mining. © 2015, ISSN 1881-803X.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Disagreement-based semi-supervised learning method for enterprise credit risk assessment

引用

ICIC Express Letters 2015年第6期9卷 1671-1676页

The enterprise credit risk assessment problem has long been regarded as an important and widely studied issue in both academia and industry. However, unla-beled data problem is paid less attention to in the credit risk assessment community. To fill in this research gap, one of popular disagreement semi-supervised learning methods, co-training, is introduced to exploit the unlabeled data to improve the enterprise credit risk assessment performance. Co-training allows one to start with just a few labeled instances to produce an initial weak classifier and then use unlabeled data to improve the performance. Experiments based on two credit datasets reveal that co-training SVM&DT (Support Vector Machine & Decision Tree) gets the better performance than the compared methods. Based on these results, we can conclude that co-training SVM&DT can be used as an alternative method for enterprise credit risk assessment. © 2015 ICIC International.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

Evaluation on regional innovation performance of China's patent data based on two-stage model

Evaluation on regional innovation performance of China's pat...

引用

IEEE International Conference on Service Operations and Logistics, and Informatics, SOLI

作者： Su Yang Changyong Liang School of Management Anhui University of Architecture Hefei China School of Management Hefei University of Technology Hefei China Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education Hefei China

ISBN: (纸本)9781467384810

Being paid great attention to its operating performance, patent is the key element for a country or area to gain long-term advantage in various competitions. This paper, based on Chinese patent data, proposes a two-stage model with factor analysis and clustering analysis. It also proposes a patent innovation performance evaluation system in view of the input-output index of twenty patents, giving factor analysis to principal components, combining the various indexes to create new factors through calculating, extracting and aggregating, and then with this new factor score, this article evaluates the patent innovation performance systematically using the clustering analysis. The results show that, obviously, patent modification can promote innovation patent performance, especially the second modification. And at last, this article provides suggestion and development strategies to the improvement of patent system.

关键词： Decision support systems Conferences Logistics Informatics

来源：评论

学校读者我要写书评

暂无评论

Collaborative optimization of profit and cost of hybrid cloud storage service

引用

International Journal of u- and e- Service, Science and Technology 2015年第2期8卷 185-196页

作者： Sun, Chao-Ping Zhao, Jing Ruan, Su-Mei School of Management Hefei University of Technology Hefei China Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education Hefei China School of Business Anhui University of Finance and Economics Bengbu China

Aiming at hybrid cloud storage service (HCSS), this paper conducts research on collaborative optimization of corresponding profits and costs. Profit function of HCSS considers flexibility, extendibility, decrease in investment, improvement on access speed, data sharing, disaster recovery, and green IT, while cost function of HCSS considers data transmission, data storage, and facilities of hardware and software. Based on profit and cost functions of HCSS, a goal programming model is constructed to collaboratively optimize profits and costs of HCSS. The model is validated by making a comparative analysis in two representative contexts. © 2015 SERSC.

关键词： Profitability

来源：评论

学校读者我要写书评

暂无评论

A study on DS-SVM-based forecast model from the view of information fusion

引用

International Journal of u- and e- Service, Science and Technology 2015年第2期8卷 395-404页

作者： Zhu, Weidong Sun, Yibo Wu, Yong Liu, Jingyu School of Economics Hefei University of Technology HefeiAnhui China Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education HefeiAnhui China Institute of Industrial Information Hefei University of Technology HefeiAnhui China School of Management Hefei University of Technology HefeiAnhui China School of Management Hefei University of Technology HefeiAnhui China Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education HefeiAnhui China School of Management Hefei University of Technology HefeiAnhui China

Dempster-Shafer Theory is specially advantaged in information fusion, while Support Vector Machine (SVM) can well deal with high-dimensional limited sample data. This Article firstly forecasts the data samples by categories with multiple SVMs, and hence based thereon, fuses the resulting information from multiple SVM models by using DS theory. At the end, Anderson's Iris data set is used to simulate the system of the created DS-SVM model, which shows that the approaches proposed in this Article can not only increase the accuracy rate of the SVM forecasting model, but also improve the propensity scores of the SVM forecasting model. © 2015 SERSC.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

COS-training: A new semi-supervised learning method for keyphrase extraction based on co-training and SMOTE

引用

ICIC Express Letters, Part B: Applications 2015年第1期6卷 233-238页

作者： Wang, Gang Yang, Shanlin Ma, Jian School of Management Hefei University of Technology No. 193 Tunxi Road Hefei China Ministry of Education Key Laboratory of Process Optimization and Intelligent Decision-Making Hefei University of Technology No. 193 Tunxi Road Hefei China Department of Information Systems City University of Hong Kong Tat Chee Avenue Kowloon Hong Kong

As keyphrase is a small set of words that can best represent a document, they play significant roles in varieties of text-related tasks. In recent years, many unsupervised and supervised methods have been proposed for keyphrase extraction. However, keyphrase extraction is an imbalanced classification problem in nature and contains many unlabeled data, which have not been paid attention to in the previous studies. In this research, a new semi-supervised learning method, COS-training, is proposed for keyphrase extraction based on co-training and SMOTE. For the testing and illustration purpose, a keyphrase extraction dataset is selected to verify the effectiveness of the proposed method. Empirical results reveal that COS-training is a potential solution for keyphrase extraction. Among the compared methods, COS-training gets the best result. Al l these results illustrate that COS-training can be used as an alternative method for keyphrase extraction.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

The green project of data management for industrial integration

International Journal of Database Theory and Application

引用

International Journal of Database Theory and Application 2015年第6期8卷 333-342页

作者： Tian, Yiming Zhu, keyu Pan, Ruoyu Liang, Changyong School of Computer and Information Hefei University of Technology Anhui Transport Interconnection Management Center Hefei China Institute of Computer Network Systems Hefei University of Technology Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education Hefei China Key Technologies and Equipment of IOT of Highway Traffic Anhui Engineering Technology Research Center Hefei China

The green project fulfills the requests of industrial management and application by sharing data rather than isolating. The data center with energy-efficient equipment is correspondingly effective in industrial service, management and construction of information. This study suggests a green data center in the two-level framework as a basic factor in industrial integration with potent procedures. In the case of transportation, it processed validating data to resolve logistics and emergency operations. © 2015 SERSC.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

An Inventory Control Model for Perishable Items with Stochastic Replenishment Interval and Stock-dependent Selling Rate

An Inventory Control Model for Perishable Items with Stochas...

引用

第26届中国控制与决策会议

作者： Guang-fan Xu Xiao-jia Wang Yan-yan Wu Shan-lin Yang School of Management Hefei University of Technology Key Laboratory of Process Optimization and Intelligent Decision-making Ministry of Education

ISBN: (纸本)9781479937097

Periodic replenishment inventory models are widely used in practice, especially for inventory systems in which many different goods are purchased from the same supplier. However, most of periodic replenishment inventory models have assumed a fixed length of the replenishment periods. In practice, it is possible that the replenishment periods are of a stochastic length. This paper presents an inventory control model for deteriorating items in the case of random replenishment intervals and stock-dependent selling rate. The replenishment interval is assumed to obey from two different distributions, namely, exponential and uniform distributions. Also, shortages are allowed in the term of partial backordering. For this model, we provide the necessary and sufficient conditions of the existence and uniqueness of the optimal solutions and a procedure is also developed to determine the optimal solution for the proposed models. At last, numerical example is shown to illuminate the presented model.

关键词： stochastic replenishment interval,stock-dependent selling rate,inventory control,partial backlogging,deteriorating items

来源：评论

学校读者我要写书评

暂无评论

A novel hybrid dynamic programming algorithm for a two-stage supply chain scheduling problem

引用

8th International Conference on Learning and intelligent optimization, LION 2014

作者： Pei, Jun Liu, Xinbao Fan, Wenjuan Pardalos, Panos M. Liu, Lin School of Management Hefei University of Technology Hefei 230009 China Center for Applied Optimization Department of Industrial and Systems Engineering University of Florida Gainesville FL 32601 United States Key Laboratory of Process Optimization and Intelligent Decision-making of Ministry of Education Hefei 230009 China Department of Computer Science North Carolina State University Raleigh NC 27695-7534 United States

ISBN: (纸本)9783319095837

This study addresses a two-stage supply chain scheduling problem, where the jobs need to be processed on the manufacturer's serial batching machine and then transported by vehicles to the customer for further processing. The size and processing time of the jobs are varying due to the differences of types, and setup time is needed before processing one batch. For the problem with minimizing the makespan, we formalize it as a mixed integer programming model. In addition, the structural properties and lower bound of the problem are provided. Based on the analysis above, a novel hybrid dynamic programming algorithm, combining dynamic programming and heuristics, is proposed to solve the problem. Furthermore, its time complexity is also analyzed. By comparing the experimental results of our proposed algorithm with the heuristics B F F and L F F , we demonstrate that our proposed algorithm has better performance and can solve the problem in a reasonable time. © 2014 Springer International Publishing.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：