Table of Content

28 February 2017, Volume 20 Issue 1 Previous Issue    Next Issue

For Selected:

Download Citations EndNote Reference Manager ProCite BibTeX RefWorks

Toggle Thumbnails

Analysis of an Evolutionary Game under Municipal Solid Waste Incineration Power Generation Based on System Dynamics DAI Feng, DAI Wei 2017, 20 (1):  1-11.  doi: 10.3969/j.issn.1007-7375.e16-3097 Abstract ( 1371 )   PDF (3430KB) ( 6153 )   Save Based on the assumption of bounded rationality, an evolutionary game model is proposed to analyze the decision among the central government, local government and MSW incineration power enterprises in waste disposing process while trying to reduce the environment pollution caused by municipal solid waste (MSW) incineration with electricity generation and promote MSW incineration power enterprises to dispose the waste in a green process. System dynamics is applied to analyze the stability of three stakeholders and identify equilibrium solutions. The simulation results show that the strategy selections of the three stakeholders fluctuate repeatedly, which indicates that the evolutionary stable strategy does not exist among the stakeholders. Therefore, dynamic penalty and dynamic reward are proposed to control the fluctuations. According to the sensitivity analysis, the simulation results indicate that the dynamic penalty can effectively restrain the fluctuations and make stakeholders more stable. Furthermore, compared with raising local government maximum penalty standard, raising the enterprise maximum penalty standard can not only restrain the fluctuations effectively but also present an ideal evolutionary stable strategy in which the probability of MSW incineration power enterprises to increase their probability to dispose waste in green process is closed to 1. References | Related Articles | Metrics

Real-time Pricing Scheme Considering Incentive Factor between Multi-retailers and Multi-users in Smart Grid DAI Yeming, GAO Yan, ZHU Hongbo, JIN Feng, YUAN Guanghui 2017, 20 (1):  12-19.  doi: 10.3969/j.issn.1007-7375.e16-3168 Abstract ( 1248 )   PDF (2640KB) ( 6086 )   Save As a crucial part of demand response management (DRM) in smart grid, real-time pricing has become one of the open research hot spots. In order to optimize energy consumption, a Stackelberg game model is established to study the real-time pricing in view of the interaction behaviors between multiple power retailers and multiple users by using game theory. The existence of equilibrium is proved and analyzed. After that, a distributed algorithm is proposed to solve the equilibrium with only local information. In addition, an incentive factor for regulating the real-time electricity price information of retailers is put forward for keeping the power system operation stability and power supply and demand balance. Numerical simulation results show that the proposed algorithm converges quickly and the appropriate incentive factors may improve the satisfaction of users. References | Related Articles | Metrics

Effect of Target Price Insurance for Agri-food under Competition Between Primary Markets CHEN Jun, MA Yongkai, CAO Qunhui 2017, 20 (1):  20-26.  doi: 10.3969/j.issn.1007-7375.e16-2145 Abstract ( 1036 )   PDF (1359KB) ( 5837 )   Save Target price insurance policy can give farmers a certain compensation when market price is too low, but it also affects farmers' production decision. Assuming that the buyer decides the purchase price, the game models are constructed in an agri-food supply chain consisting of two farmers and a buyer, considering whether the government launches target price insurance or shares the planning information. Comparing two indexes of social welfare and farmer's average profit for five schemes, it is observed that one scheme can maximize social welfare when just a government launches target price insurance and disclose planning information later, as well as the buyer takes discriminatory pricing strategy. Another scheme will minimize social welfare when the two governments don't disclose planning information and the buyer takes uniform pricing strategy. Being such a case, it makes little difference whether one or two governments launch target price insurance. References | Related Articles | Metrics

The Coordination Model of a Three-level Production-inventory Based on the Carbon Footprint Mass Balance Equation LAN Haiyan, DU Xinyu, TANG Yurong, LAN Haipeng 2017, 20 (1):  27-35.  doi: 10.3969/j.issn.1007-7375.e16-2295 Abstract ( 954 )   PDF (2375KB) ( 5911 )   Save Based on the mass balance equations of carbon footprint, a model of production-inventory-carbon footprint is established. The coordination of the order, production and carbon footprint between multiple members is studied. Numerical calculations shows that the carbon emission control policy that is the most severe or the most liberal will give rise to change conversely in the supply chain costs and carbon footprint. When carbon trading price is equal to zero, the supply chain cost is the lowest and the carbon footprint is the highest. The policy that carbon quota partially is free, combining with the carbon trading, is a feasible choice in the early carbon emission control. The price mechanism is more sensitive to the adjustment of supply chain decisions. In addition, the coordination efficiency curves highlight the value of collaboration in supply chain with carbon emissions, and the secondary distribution costs can not only reduce operating costs, but also alleviate the carbon footprint of supply chain. References | Related Articles | Metrics

The Optimal Contract Design with Asymmetric Production Cost Disruption Information in a Dual-channel Model of Retailer LIU Tingting, XU Qing 2017, 20 (1):  36-43,58.  doi: 10.3969/j.issn.1007-7375.e16-1111 Abstract ( 1099 )   PDF (3073KB) ( 5990 )   Save To investigate the impact of the asymmetric production cost disruption information on the retailer dual-channel supply chain contract, in which the retailer plays the main role in supply chain, the optimal channel strategy under the three situations of no production cost disruption, production cost disruption under the symmetric information and asymmetric information are considered respectively. Based on the consumer choice theory and the principal-agent theory, the influence of cost disruption on supply chain performance under the asymmetric information is analyzed using KKT (Karush-Kuhn-Tucker) condition. It is suggested that the original supply chain strategy is still the optimal choice under certain conditions. In addition, the information privacy of production cost disruption not always brings the loss of the profit of the entire supply chain. References | Related Articles | Metrics

Optimal Strategies for Inventory Financing with Capital Constrained CHAI Zhengmeng, DUAN Lili 2017, 20 (1):  44-50,64.  doi: 10.3969/j.issn.1007-7375.e15-2524 Abstract ( 950 )   PDF (2571KB) ( 6032 )   Save Considering the small and medium manufacturing enterprises holding the goods while borrowing money from the financial institutions for more output with the inventory financing, a logistics finance system consisting of a bank, a manufacturing firm (financing firm) and a logistics company is designed. In the light of the capital constraint and the endogenous default, a research is conducted respectively on the optimal interest rate and loan-to-value ratio of commercial bank, the optimal financing policy and the production policy of the manufacturing firm. It is indicated that the loan-to-value ratio and interest rate play an important role in the inventory financing with inventory financing as a kind of management method to achieve a win-win situation for all members. References | Related Articles | Metrics

Stochastic and Periodic Resource Scheduling Problem in Home Health Care WU Meng, LIU Ran, JIANG Zhibin, WANG Xuefeng 2017, 20 (1):  51-58.  doi: 10.3969/j.issn.1007-7375.e15-1563 Abstract ( 930 )   PDF (1094KB) ( 5998 )   Save Home health care is an emerging service industry. To meet the requirement of stochastic and periodic home health care and solve the resource scheduling problem in the stochastic and periodic service process, a resource scheduling model is established. The aim of this research is to schedule the service sequence and routes of the next period with the minimal resource cost (for example, service personnel), under the circumstance of the stochastics of the service date. The solution is to use the Monte Carlo simulation to find the best solution which is correspondent to reality by a reasonable Tabu search algorithm. By doing computational experiments within different scales, the validity of this algorithm is verified. References | Related Articles | Metrics

Research about Optimizing Prediction Accuracy and Time Complexity in Signed Networks TENG Shaohua, SU Qingjia, LIU Dongning, ZHANG Wei 2017, 20 (1):  59-64.  doi: 10.3969/j.issn.1007-7375.e16-4208 Abstract ( 841 )   PDF (1942KB) ( 5987 )   Save In signed networks, different sign predicting algorithms have been proposed. The prediction accuracy of the algorithm is improving, but the time complexity is also increasing. A way must be found to reduce the time complexity. In order to ensure the high prediction accuracy and low time complexity, an optimization algorithm is designed to analyze the relation between prediction accuracy and time complexity with increasing steps and an optimization scheme is also proposed through using the balanced cycle algorithm for predicting sign at first and then fitting the function of prediction accuracy and step, time complexity and step respectively. Experiments show that the optimization algorithm can effectively obtain the relation between prediction accuracy and time complexity. This research can be used in working out design symbol prediction algorithms. References | Related Articles | Metrics

An Approach to Optimizing the General Training Fleet Composition under Network Training Mode Wang Yu, Jiang Xia-fang, Li Fei 2017, 20 (1):  65-70.  doi: 10.3969/j.issn.1007-7375.e16-3056 Abstract ( 686 )   PDF (1711KB) ( 5790 )   Save To reduce the fleet training costs by optimizing the general training fleet composition (primary-grade aircraft, medium-grade aircraft, senior-grade aircraft) under network training mode, the multi-stage aviation training process with multi-base for a weighted directed network is abstracted. Then, considering several limitations including the total number of aviation training students, the flowing balance conditions, the available flying hours of the training fleet and the least number of deployed general airplanes on each training base as constraints, a general fleet composition optimization model was constructed with objective of minimizing the total fleet training costs. For a numeric example with the scale of 3 training bases and 1, 000 training aviation drivers in a training cycle, the simulation results show that for the same number of training aviation drivers the model presented in this paper can decrease the type number of fleet deployed to each training base to 2, 1, and 2 respectively. Furthermore, the total fleet training costs can be reduced by 2.7% as opposed to the use of general training mode. These results suggest that both the type number of fleet deployed to each training base and the fleet training costs can be significantly decreased under the network training mode. References | Related Articles | Metrics

Optimizing the Number of Kanbans for Two-stage Production System Based on Queuing Theory LIN Yu, LI Yajiao, SHI Yingjie 2017, 20 (1):  71-76.  doi: 10.3969/j.issn.1007-7375.e16-3242 Abstract ( 1054 )   PDF (1119KB) ( 6007 )   Save Excess inventories not only take up a lot of space, but also reduce the capital turnover, increasing the cost of enterprises. To solve the problem, Kanban system is proposed firstly. Then a method of determining the optimal number of Kanbans in two-stage production system is developed on this basis. Considering the actual situation, with the shortage cost, work in process cost, machine production cost and cost of idle machines all combined, the Markov process is identified and queuing theory used to build the model of optimal per-unit-time cost to obtain the optimal number of Kanbans. Then, a case is studied to demonstrate the feasibility and effectiveness of our model. Sensitivity analysis shows that, when the number of Kanbans is small, it is more sensitive to the parameters of the shortage cost and work in process cost. In addition, the optimal number of Kanbans increases as the rate of the latter production process increases. References | Related Articles | Metrics

Facility Mixed Layout Problems (FMLP) based on Hybrid Heuristic Algorithms ZHOU Na, SHU Fan, JIN Peiqing 2017, 20 (1):  77-82.  doi: 10.3969/j.issn.1007-7375.e16-2275 Abstract ( 1160 )   PDF (1875KB) ( 6005 )   Save The multi-objective model of the FMLP was built based on integrated solution of the facility unit layout, the genetic-immune-ant-colony hybrid heuristic algorithms (GIAHHA) was presented, the adaptive immune ant colony algorithm selection operation with the "safe" was designed, the diversity of population was maintained effectively, and the quality of the solution was improved. Finally, the effectiveness and the superiority of the model and algorithms were verified. References | Related Articles | Metrics

Queuing Network Modeling and Analysis of Manufacturing System with AGV with Multi-section-annular Path LIU Jianjun, CHEN Qingxin, MAO Ning, YU Ailin 2017, 20 (1):  83-90.  doi: 10.3969/j.issn.1007-7375.e15-1581 Abstract ( 1029 )   PDF (2150KB) ( 5851 )   Save It is difficult to analyze the performance of customized manufacturing system with Automated Material Handling Unit (AMHU) by traditional open queuing network model with finite buffers. Focused on the random lot size of handling, a queuing network modeling method was put forward. Firstly, the system was described and the queuing network model was built. Secondly, the model of corresponding state space of each node was developed based on the improved state space decomposition method, and the performance further obtained. Finally, experiments to assess the effectiveness and the accuracy of the proposed method were reported by comparing the results with simulation. This study can provide a basis for further optimization on similar manufacturing system. References | Related Articles | Metrics

Arc Routing Problem in Road Maintenance with Stochastic Time Variables XU Lei, CHEN Lu 2017, 20 (1):  91-98,106.  doi: 10.3969/j.issn.1007-7375.e16-3262 Abstract ( 980 )   PDF (2642KB) ( 5972 )   Save The vehicle routing optimization problem encountered in daily maintenance operation of a freeway network which considers the uncertainty of service and travel time in road maintenance is studied. By the scientific planning means and accurate and effective decision methods, resource waste caused by the artificial decision can be reduced. The problem is defined as a variation of the capacitated arc routing problem (CARP) and a chance-constrained programming model (CCPM) and a stochastic programming model with recourse (SPM-R) are formulated to describe it. An adaptive large neighborhood search (ALNS) algorithm is proposed due to the randomness of the problem. In the process of optimization, each removal heuristic and insertion heuristic are scored according to their performances on the solution. And at each iteration, the choice of a removal heuristic and of an insertion heuristic is based on a roulette-wheel selection principle. Compared with the branch-and-cut (B&C) algorithm, the average gap between the ALNS solutions and the B&C solutions ranges from 1.45% to 3.15%, but the computation time decreases a lot. So the ALNS is proved to be effective and it can be applied to the medium and large-size problems. The results of the instances of the real road network show the superiority of the SPM-R compared with the CCPM under certain circumstances. Some sensitivity analysis on the two important variables α and CV are conducted, and the results show how they affect the solutions. References | Related Articles | Metrics

User Experience Evaluation of Electronic Commerce Platform OUYANG Feng, FENG Baoying, ZENG Jing 2017, 20 (1):  99-106.  doi: 10.3969/j.issn.1007-7375.e16-4210 Abstract ( 1228 )   PDF (654KB) ( 6057 )   Save The attribute reduction algorithm of rough set is first applied to select initial indexes, the rough set theory used to attain their evaluation weights, and then the evaluation model built based on gray relational analysis to conduct an empirical analysis. The result proves the feasibility of applying the attribute reduction algorithm of rough set in establishing the evaluation index system,and the method proposed in this research can improve the accuracy of the comprehensive evaluation of the user experience. Therefore, it has a reference value to enhance the user experience of electronic commerce platform. References | Related Articles | Metrics