带有学习效应和加工时间可控的排序问题

考虑了带有学习效应和加工时间可控的交货期窗口的单机排序问题。工件的加工时间是关于所分配资源的线性函数或凸函数。其中每一个工件均有一个交货期窗口且窗口大小相同,若工件在窗口之前或之后完工则会产生相应的惩罚,若工件在窗口中完工则无惩罚,目标是通过极小化包括提前,误工工件数、窗口的开始时间、窗口大小和资源消耗的总惩罚函数确定工件的最优排序、最优加工时间和最优资源分配量。在加工时间是线性资源函数的情况下,通过将问题转化为一系列指派问题,构造一个多项式时间算法;在加工时间是凸资源函数的情况下,构造了一个在多项式时间内可解的动态规划算法。

Priority approach based on quadratic programming model to fuzzy preference relation

We investigate the decision-making problem with a finite set of alternatives,in which the decision information takes the form of a fuzzy preference relation. We develop asimple and practical approach to obtaining the priority vector of a fuzzy preference relation. Theprominent characteristic of the developed approach is that the priority vector can generally beobtained by a simple formula, which is derived from a quadratic programming model. We utilize theconsistency ratio to check the consistency of fuzzy preference relation. If the fuzzy preferencerelation is of unacceptable consistency, then we can return it to the decision maker to reconsiderstructuring a new fuzzy preference relation until the fuzzy preference relation with acceptableconsistency is obtained. We finally illustrate the priority approach by two numerical examples. Thenumerical results show that the developed approach is straightforward, effective, and can easily beperformed on a computer.

APPROACH FOR FUZZY MULTI-ATTRIBUTE DECISION-MAKING WITH FUZZY COMPLEMENTARY PREFERENCE RELATION ON ALTERNATIVES

In presented fuzzy multi-attribute decision-making （FMADM） problems, the information about attribute weights is interval numbers and the decision maker （DM） has fuzzy complementary preference relation on alternatives. Firstly, the decision-making information based on the subjective preference information in the form of the fuzzy complementary judgment matrix is uniform by using a translation function. Then an objective programming model is established. Attribute weights are obtained by solving the model, thus the fuzzy overall values of alternatives are derived by using the additive weighting method. Secondly, the ranking approach of alternatives is proposed based on the degree of similarity between the fuzzy positive ideal solution of alternatives （FPISA） and the fuzzy overall values. The method can sufficiently utilize the objective information of alternatives and meet the subjective requirements of the DM as much as possible. It is easy to be operated and implemented on a computer. Finally, the proposed method is applied to the project evaluation in the venture investment.

极大允许序列的框架结构

本文研究了极大允许序列的性质 ,给出了极大允许序列的框架结构 .

Design of Aided Decision-Making Program for Prioritizing Construction Projects in Urban Road Network Planning

The importance and complexity of prioritizing construction projects (PCP) in urban road network planning lead to the necessity to develop an aided decision making program (ADMP). Cost benefit ratio model and stage rolled method are chosen as the theoretical foundations of the program, and then benefit model is improved to accord with the actuality of urban traffic in China. Consequently, program flows, module functions and data structures are designed, and particularly an original data structure of road ...

A hybrid algorithm based on ILP and genetic algorithm for time-aware test case prioritization

To solve the problem of time-awarc test case prioritization,a hybrid algorithm composed of integer linear programming and the genetic algorithm(ILP-GA)is proposed.First,the test case suite which cm maximize the number of covered program entities a d satisfy time constraints is selected by integer linea progamming.Secondly,the individual is encoded according to the cover matrices of entities,and the coverage rate of program entities is used as the fitness function and the genetic algorithm is used to prioritize the selected test cases.Five typical open source projects are selected as benchmark programs.Branch and method are selected as program entities,and time constraint percentages a e 25%and 75%.The experimental results show that the ILP-GA convergence has faster speed and better stability than ILP-additional and IP-total in most cases,which contributes to the detection of software defects as early as possible and reduces the software testing costs.

Tri-level programming model for combined urban traffic signal control and traffic flow guidance

In order to balance the temporal-spatial distribution of urban traffic flow, a model is established for combined urban traffic signal control and traffic flow guidance. With consideration of the wide use of fixed signal control at intersections, traffic assignment under traffic flow guidance, and dynamic characteristics of urban traffic management, a tri-level programming model is presented. To reflect the impact of intersection delay on traffic assignment, the lower level model is set as a modified user equilibrium model. The middle level model, which contains several definitional constraints for different phase modes, is built for the traffic signal control optimization. To solve the problem of tide lane management, the upper level model is built up based on nonlinear 0-1 integer programming. A heuristic iterative optimization algorithm(HIOA) is set up to solve the tri-level programming model. The lower level model is solved by method of successive averages(MSA), the middle level model is solved by non-dominated sorting genetic algorithm II(NSGA II), and the upper level model is solved by genetic algorithm(GA). A case study is raised to show the efficiency and applicability of the proposed modelling and computing method.

Assessing Suitability of Rural Settlements Using an Improved Technique for Order Preference by Similarity to Ideal Solution

Land suitability assessment is a prerequisite phase in land use planning; it guides toward optimal land use by providing information on the opportunities and constraints involved in the use of a given land area. A geographic information system-based procedure, known as rural settlement suitability evaluation(RSSE) using an improved technique for order preference by similarity to ideal solution(TOPSIS), was adopted to determine the most suitable area for constructing rural settlements in different geographical locations. Given the distribution and independence of rural settlements, a distinctive evaluation criteria system that differed from that of urban suitability was established by considering the level of rural infrastructure services as well as living and working conditions. The unpredictable mutual interference among evaluation factors has been found in practical works. An improved TOPSIS using Mahalanobis distance was applied to solve the unpredictable correlation among the criteria in a suitability evaluation. Uncertainty and sensitivity analyses obtained via Monte Carlo simulation were performed to examine the robustness of the model. Daye, a resource-based city with rapid economic development, unsatisfied rural development, and geological environmental problems caused by mining, was used as a case study. Results indicate the following findings: 1) The RSSE model using the improved TOPSIS can assess the suitability of rural settlements, and the suitability maps generated using the improved TOPSIS have higher information density than those generated using traditional TOPSIS. The robustness of the model is improved, and the uncertainty is reduced in the suitability results. 2) Highly suitable land is mainly distributed in the northeast of the study area, and the majority of which is cultivated land, thereby leading to tremendous pressure on the loss of cultivated land. 3) Lastly, 12.54% of the constructive expansion permitted zone and 8.36% of the constructive expansion conditionally permitted zone are situated in an unsuitable area, which indicates that the general planning of Daye lacks the necessary verification of suitability evaluation. Guidance is provided on the development strategy of rural settlement patches to support decision making in general land use planning.

Multi-objective optimization of space station short-term mission planning

This paper studies the multi-objective optimization of space station short-term mission planning(STMP), which aims to obtain a mission-execution plan satisfying multiple planning demands. The planning needs to allocate the execution time effectively, schedule the on-board astronauts properly, and arrange the devices reasonably. The STMP concept models for problem definitions and descriptions are presented, and then an STMP multi-objective planning model is developed. To optimize the STMP problem, a Non-dominated Sorting Genetic Algorithm II(NSGA-II) is adopted and then improved by incorporating an iterative conflict-repair strategy based on domain knowledge. The proposed approach is demonstrated by using a test case with thirty-five missions, eighteen devices and three astronauts. The results show that the established STMP model is effective, and the improved NSGA-II can successfully obtain the multi-objective optimal plans satisfying all constraints considered. Moreover, through contrast tests on solving the STMP problem, the NSGA-II shows a very competitive performance with respect to the Strength Pareto Evolutionary Algorithm II(SPEA-II) and the Multi-objective Particle Swarm Optimization(MOPSO).