Genetic algorithm-based multi-criteria project portfolio selection

Project portfolio selection is one of the most important decision-making problems for most organizations in project management and engineering management. Usually project portfolio decisions are very complicated when project interactions in terms of multiple selection criteria and preference information of decision makers (DMs) in terms of the criteria importance are taken into consideration simultaneously. In order to solve this complex decision-making problem, a multi-criteria project portfolio selection problem considering project interactions in terms of multiple selection criteria and DMs?? preferences is first formulated. Then a genetic algorithm (GA)-based nonlinear integer programming (NIP) approach is used to solve the multi-criteria project portfolio selection problem. Finally, two illustrative examples are presented for demonstration and verification purposes. Experimental results obtained indicate that the GA-based NIP approach can be used as a feasible and effective solution to multi-criteria project portfolio selection problems.     

Communication and understanding mathematical foundations and practical applications

Since Shannon??s and Weaver??s ??Mathematical theory of Communication?? it is well known that mathematical definitions of information or the degree of information respectively is possible. The great problem for a complete theory of communication is the exact definition of meaning in mathematical terms. I shall demonstrate how such a definition can be achieved in terms of complex systems theory. In particular it is possible to derive exact definitions of the degree of meaning, applied to semantical networks, and of the degree of information that is suited for the analysis of human communication. The degree of information as well as the degree of meaning is dependent on the geometry of the receiving systems, which are modeled as semantical networks. It can be shown that the knowledge about the geometrical structure allows predictions about the degrees of information and of meaning a message has for a certain receiving system, although of course only on the average. In a semantical application of these fundamental concepts it will be shown how a new self organized leaning neural network that we have developed is able to deal with linguistic ambiguities. Additional applications of the communication theory will be demonstrated, in particular an Internet meta search engine based on computing the degrees of information and meaning, and a computer based discourse analysis.     

Choosing the Operational Research Programme for B.I.S.R.A

This paper examines some important problems in the evaluation and selection of research projects, with particular reference to operational research projects in a central industry research organization. A method for project evaluation is suggested which provides data suitable for use in a powerful and flexible formal procedure for project selection. In evaluating a project, the assessment of resource requirements is based on a probabilistic network plan of the project, and the estimates of benefits are derived from the marginal effects on the industry of performing or not performing the project, using discounted cash flow techniques. The procedure for project selection chooses not only the projects to be undertaken, but also the team sizes that should be used. A wide variety of constraints can be imposed on the system to reflect different aspects of management policy or other special factors. The procedures described have been implemented, and have proved well worth while.     

基于关键链的敏捷软件开发多项目网络模型

敏捷软件开发因其效率和文档量远低于传统方法在一提出就得到广泛应用,但仍无法有效解决软件开发多项目管理中的资源受限调度问题.将关键链思想应用到包含多个项目的敏捷软件开发问题中,在分析敏捷软件开发多项目网络模型的基础上,建立了数学优化模型;提出了一种适宜敏捷软解开发的多项目网络迭代调度假设与规则,并设计了相应的算法,具体包括关键链选择算法和调度算法;最后进行了实例分析,所得结果与遗传算法的相比从52个单位时间的迭代周期减少到42,使得工期节省了近20%.     

Spectral corrections for Sturm–Liouville problems

The numerical solution of the Sturm–Liouville problem can be achieved using shooting to obtain an eigenvalue approximation as a solution of a suitable nonlinear equation and then computing the corresponding eigenfunction. In this paper we use the shooting method both for eigenvalues and eigenfunctions. In integrating the corresponding initial value problems we resort to the boundary value method. The technique proposed seems to be well suited to supplying a general formula for the global discretization error of the eigenfunctions depending on the discretization errors arising from the numerical integration of the initial value problems. A technique to estimate the eigenvalue errors is also suggested, and seems to be particularly effective for the higher-index eigenvalues. Numerical experiments on some classical Sturm–Liouville problems are presented.     

Positive solutions for nonlinear Neumann problems with concave and convex terms

We consider a nonlinear elliptic Neumann problem driven by the p-Laplacian with a reaction that involves the combined effects of a ??concave?? and of a ??convex?? terms. The convex term (p-superlinear term) need not satisfy the Ambrosetti?CRabinowitz condition. Employing variational methods based on the critical point theory together with truncation techniques, we prove a bifurcation type theorem for the equation.     

A Two Stage Search Heuristic for Scheduling Payments in Projects

When the Net Present Value (NPV) of a project is used as a measure of its financial performance, effective management of cash flows over the duration of the project is critical for improved profitability. Progress payments are a major component of project cash flows. In many project environments, the contractor can negotiate payment terms. Payments are typically tied to completion of project activities and therefore have significant impact on the schedule of activities and the timing of the payments. In this paper, we consider the problem of simultaneously determining the amount, timing and location of progress payments in projects to maximize NPV. Due to the combinatorial nature of the problem, heuristics are a practical approach to solving the problem. We propose a two-stage heuristic where simulated annealing is used in the first stage to determine a set of payments. In the second stage, activities are rescheduled to improve project NPV. We compare the performance of this general purpose heuristic with other problem-dependent heuristics from the literature. Our results indicate that the simulated annealing heuristic significantly outperforms the parameter-based heuristics. Although rescheduling in the second stage improves NPV, increases are relatively small in magnitude. While the specific parameters settings suggested by the simulated annealing heuristic in this study may have limited generalizability at this time due to the narrow range of problems tested, our analysis suggests that a pure simulated annealing approach is a very attractive alternative for obtaining good heuristic solutions to the complex problem of scheduling payments in projects.     

FMMSIC: a hybrid fuzzy based decision support system for MMS (in order to estimate interrelationships between criteria)

One of the main tasks in exploitation of ore-body is to select a suitable mining method. In mining method selection (MMS) problems, a decision procedure has to choose the best exploitation method that satisfies the evaluation criteria. It is generally hard to find a mining method that meets all the criteria simultaneously, therefore a good compromise solution is preferred as the final selection. Furthermore, the MMS problem is an inherently uncertain activity. To deal with the uncertainty, this paper presents an hybrid decision support system based on the fuzzy multi attribute decision making, named the fuzzy mining method selection with interrelation criteria (FMMSIC). FMMSIC models the relative weights of criteria by combining the fuzzy analytic network process and fuzzy entropy, and discusses using these hybrid techniques to determine the overall weights. Subsequently, the technique for order preference by similarity to an ideal solution method was modified by various normalization norms according to the MMS problem condition. Finally, to illustrate how the FMMSIC is used for the MMS problems, an empirical study of a real case is conducted. It shows by means of an application that the FMMSIC is well suited as a decision support system for the MMS.     

Unpacking Online Asynchronous Collaboration in mathematics teacher education

We report on one aspect of an extended research and development project that was conducted to support teachers?? development of mathematical knowledge for teaching (MKT) algebra through participation and authentic engagement in online collaborative mathematical problem solving. This article expands on our recent work, which has succeeded in developing a model for supporting teachers?? mathematical development at a distance that has shown great promise for supporting significant gains in teachers?? MKT. Specifically, this ex-post-facto analysis consisted of qualitative, micro-level analysis of the content of teachers?? activity and generated artifacts and helps us understand how the various collaborative activities (specific combinations of interaction, instructor support and feedback, and technology) supported and/or constrained the development of MKT algebra in an online environment.     

A multi-methodological approach to the development of a regional solid waste management system

The management of solid waste at regional level has received considerable attention over the last years. Increased consumption levels are causing an exacerbation of the problem, whereas the sensitivity of the public over environmental issues makes its solution harder. Although the main difficulties in resolving the different occurrences of the problem belong to the realm of policy making, so far the employment of operational research and systems methods seems to adopt a purely technocratic stance, concentrating on the content and understating the solution process. In the different formulations of the problem as static optimization relating to the economics of the location of the treatment facilities and the methods and routes of waste transportation, the dynamics of the issue and the intervention activities are neglected, whereas cognitive and social perspectives of the solution process are objectified and over-rationalized. This paper aims at demonstrating how the solid waste management (SWM) problem and its solution process can be addressed in a more holistic way by adopting a multi-methodological point of view. Towards this end, we present the combined application of soft systems methodology, system dynamics and multi-objective optimization in an action research project for the development of an SWM system for a specific region in Greece.     

用最少的虚工序构建等效多阶段工序网络

运用网络计划可以直观地表示项目管理中的诸多疑难问题, 便于分析和求解. 但是它也存在明显的缺点, 如, (1) 工序网络的有向无回路性表明很多时候适合运用动态规划法, 但它在通常情况下的无阶段性使得该方法无法直接应用; (2) 任意构建的工序网络容易表现得错综复杂, 不利于研究; (3) 用最少的虚工序表示双代号网络是NP-难问题, 因此对一个工序系统可能构建出多个差别迥异的工序网络, 有碍于进度计划管理研究, 等等. 如果能将工序网络构建成等效的多阶段网络, 各工序分别表示在相应的阶段中, 无疑有助于上述问题的解决. 构建等效多阶段工序网络需要添加虚工序. 通过添加最少的虚工序将工序网络构建成等效多阶段网络, 从而有助于建立更合理的工序网络表示法.     

Creating Advanced Bases For Large Scale Linear Programs Exploiting Embedded Network Structure

In this paper, we investigate how an embedded pure network structure arising in many linear programming (LP) problems can be exploited to create improved sparse simplex solution algorithms. The original coefficient matrix is partitioned into network and non-network parts. For this partitioning, a decomposition technique can be applied. The embedded network flow problem can be solved to optimality using a fast network flow algorithm. We investigate two alternative decompositions namely, Lagrangean and Benders. In the Lagrangean approach, the optimal solution of a network flow problem and in Benders the combined solution of the master and the subproblem are used to compute good (near optimal and near feasible) solutions for a given LP problem. In both cases, we terminate the decomposition algorithms after a preset number of passes and active variables identified by this procedure are then used to create an advanced basis for the original LP problem. We present comparisons with unit basis and a well established crash procedure. We find that the computational results of applying these techniques to a selection of Netlib models are promising enough to encourage further research in this area.     

An evaluation of the adequacy of project network generators with systematically sampled networks

This paper evaluates and compares different network generators to generate project scheduling problem instances based on indicators measuring the topological network structure. We review six topological network indicators in order to describe the detailed structure of a project network. These indicators were originally developed by [L.V. Tavares, J.A. Ferreira and J.S. Coelho, The risk of delay of a project in terms of the morphology of its network, European Journal of Operational Research 119 (1999), 510–537] and have been modified, or sometimes completely replaced, by alternative indicators to describe the network topology. The contribution of this paper is twofold. Firstly, we generate a large amount of different networks with four project network generators. Our general conclusions are that none of the network generators are able to capture the complete feasible domain of all networks. Additionally, each network generator covers its own network-specific domain and, consequently, contributes to the generation of data sets. Secondly, we perform computational results on the well-known resource-constrained project scheduling problem to prove that our indicators are reliable and have significant, predictive power to serve as complexity indicators.     

On the optimal management of project risk

The uncertainty of project networks has been mainly considered as the randomness of duration of the activities. However, another major problem for project managers is the uncertainty due to the randomness of the amount of resources required by each activity which can be expressed by the randomness of its cost. Such randomness can seriously affect the discounted cost of the project and it may be strongly correlated with the duration of the activity.In this paper, a model considering the randomness of both the cost and the duration of each activity is introduced and the problem of project scheduling is studied in terms of the project's discounted cost and of the risk of not meeting its completion time. The adoption of the earliest (latest) starting time for each activity decreases (increases) the risk of delays but increases (decreases) the discounted cost of the project. Therefore, an optimal compromise has to be achieved. This problem of optimization is studied in terms of the probability of the duration and of the discounted cost of the project falling outside the acceptable domain (Risk function) using the concept of float factor as major decision variable. This last concept is proposed to help the manager to synthetize the large number of the decision variables representing each schedule for the studied project. Numerical results are also presented for a specific project network.     

网络计划技术在建筑工程施工管理中的应用问题

根据建筑工程施工特点,指出了应用网络计划资本的重要性。从网络计划技术在建筑施工管理中的应用现状出发,阐述了应用中存在的主要问题,详细分析了其产生的原因,进而对提高应用水平的对策进行了讨论,章有助于网络计划技术更好地在施工管理中应用。     

Service provider portfolio selection for project management using a BP neural network

Service provider portfolio selection (SPPS) can be a major challenge for organizations to achieve project success. Hence, organizations need to decide on which service provider portfolio (SPP) is appropriate for project management (PM). However, there has been limited research on how to select a SPP in PM. To address this research gap, we establish a novel model for SPPS based on a BP neural network integrated with entropy-AHP from the perspective of the comprehensive economic benefit. This model employs a BP neural network due to its robustness and memory and nonlinear mapping abilities. Furthermore, we implement the proposed model for a construction project to verify the effectiveness. Our results indicate that the model performs well with a prediction accuracy of 97%. Moreover, the model is confirmed to be robust as it still achieves high prediction accuracy when the input data are disturbed randomly.

     

A new method for constructing a minimal PERT network

A project is an enterprise consisting of several activities which are to be carried out in some specific order. The activities and the order in which they need to be carried out can be represented by a PERT network. The PERT technique is a traditional, well-known approach to the expert of project management. When networks are used, it often becomes necessary to draw dummy activities. Since the computation of project completion time is proportional to the number of arcs, including dummy arcs, it is desirable to draw a network with as few dummy activities as possible.In this paper, we propose a new method for constructing, for a given project scheduling problem, a PERT network having as small as possible the number of dummy arcs by using some results on line graphs. This algorithm deals with the existence of transitive arcs. The paper contains illustrative examples, proofs of some theoretical results as well as a comparative study with a similar algorithm known in the literature. Computational results showed the superiority of our algorithm.     

模糊环境下带有平衡条件的投资项目评估与选择决策方法

文章提出在模糊环境下求解带有平衡条件的投资项目评估与选择问题的决策方法。该方法由模糊综合评价系统和项目选择的模糊整数规划模型两部分组成。其中模糊综合评价系统采用三角模糊数来描述决策人对项目的主观评价以及多个评价因素的综合，而模糊整数规划模型则描述了各种不同门类利益之间的平衡。最后以实例说明该方法的应用。     

Solving Fixed-Charge Network Flow Problems with a Hybrid Optimization and Constraint Programming Approach

We apply to fixed charge network flow (FCNF) problems a general hybrid solution method that combines constraint programming and linear programming. FCNF problems test the hybrid approach on problems that are already rather well suited for a classical 0–1 model. They are solved by means of a global constraint that generates specialized constraint propagation algorithms and a projected relaxation that can be rapidly solved as a minimum cost network flow problem. The hybrid approach ran about twice as fast as a commercial mixed integer programming code on fixed charge transportation problems with its advantage increasing with problem size. For general fixed charge transshipment problems, however, it has no effect because the implemented propagation methods are weak.     

Double-knife EDGE problems with elastic/plastic type screens

A problem of diffraction of a wave by a pair of semi-infinite screens is considered. The screens are lined with two different wave bearing materials that can support surface waves. This type of problem arises in the propagation and, scattering of acoustic and electromagnetic waves by surface wave guides. To be specific, we shall couch our problem in terms of acoustics. These diffraction problems for two parallel wave bearing screens lead to boundary value problems which are governed by the Helmholtz equation, and some specific third kind boundary conditions. Such problems are shown to be well-posed for finite energy space solutions. Their representation is given by means of the canonical factorization of a non-rational matrix function.This work was supported by DFG grant KO 634/32-1