The most representative composite rank ordering of multi-attribute objects by the particle swarm optimization

Rank-ordering of individuals or objects on multiple criteria has many important practical applications. A reasonably representative composite rank ordering of multi-attribute objects/individuals or multi-dimensional points is often obtained by the Principal Component Analysis, although much inferior but computationally convenient methods also are frequently used. However, such rank ordering – even the one based on the Principal Component Analysis – may not be optimal. This has been demonstrated by several numerical examples. To solve this problem, the Ordinal Principal Component Analysis was suggested some time back. However, this approach cannot deal with various types of alternative schemes of rank ordering, mainly due to its dependence on the method of solution by the constrained integer programming. In this paper we propose an alternative method of solution, namely by the Particle Swarm Optimization. A computer program in FORTRAN to solve the problem has also been provided. The suggested method is notably versatile and can take care of various schemes of rank ordering, norms and types or measures of correlation. The versatility of the method and its capability to obtain the most representative composite rank ordering of multi-attribute objects or multi-dimensional points have been demonstrated by several numerical examples. It has also been found that rank ordering based on maximization of the sum of absolute values of the correlation coefficients of composite rank scores with its constituent variables has robustness, but it may have multiple optimal solutions. Thus, while it solves the one problem, it gives rise to the other problem. The overall ranking of objects by maximin correlation principle performs better if the composite rank scores are obtained by direct optimization with respect to the individual ranking scores.Rank ordering, standard; modified; competition; fractional; dense; ordinal; principal component; integer programming; repulsive particle swarm; maximin; absolute; correlation; FORTRAN; program

Task Allocation Strategies in Multi-Robot Environment

Multirobot systems (MRS) hold the promise of improved performance and increased fault tolerance for large-scale problems. A robot team can accomplish a given task more quickly than a single agent by executing them concurrently. A team can also make effective use of specialists designed for a single purpose rather than requiring that a single robot be a generalist. Multirobot coordination, however, is a complex problem. An empirical study is described in the thesis that sought general guidelines for task allocation strategies. Different strategies are identified, and demonstrated in the multi-robot environment.Robot selection is one of the critical issues in the design of robotic workcells. Robot selection for an application is generally done based on experience, intuition and at most using the kinematic considerations like workspace, manipulability, etc. This problem has become more difficult in recent years due to increasing complexity, available features, and facilities offered by different robotic products. A systematic procedure is developed for selection of robot manipulators based on their different pertinent attributes. The robot selection procedure allows rapid convergence from a very large number of candidate robots to a manageable shortlist of potentially suitable robots. Subsequently, the selection procedure proceeds to rank the alternatives in the shortlist by employing different attributes based specification methods. This is an attempt to create exhaustive procedure by identifying maximum possible number of attributes for robot manipulators.Availability of large number of robot configurations has made the robot workcell designers think over the issue of selecting the most suitable one for a given set of operations. The process of selection of the appropriate kind of robot must consider the various attributes of the robot manipulator in conjunction with the requirement of the various operations for accomplishing the task. The present work is an attempt to develop a systematic procedure for selection of robot based on an integrated model encompassing the manipulator attributes and manipulator requirements

Simulation optimisation to inform economic evaluations of sequential therapies for chronic conditions: a case study in Rheumatoid Arthritis

This thesis investigates the problem of treatment sequencing within health economic evaluations. For some chronic conditions, sequences of treatments can be used. When there are a lot of alternative treatments, then the number of possible sequences becomes very large. When undertaking an economic evaluation, it may not be feasible to estimate the costs and benefits of every alternative treatment sequence. The objective of the thesis is to test the feasibility of simulation optimisation methods to find an optimal or set of near-optimal sequences of disease modifying treatments for rheumatoid arthritis in an economic evaluation framework. A large number of economic evaluations have been undertaken to estimate the costs and benefits associated with different treatments for rheumatoid arthritis. Many of these have not considered the downstream sequence of treatments provided, and no published study has considered identifying the best, or optimal, treatment sequence. The published evidence is therefore of limited applicability if the objective is to maximise patient benefit while constrained by a finite budget. It is plausible that decision-makers have developed sub-optimal guidance for rheumatoid arthritis, and this could extend to other chronic conditions. A simulation model can provide an expectation of the population mean costs and benefits for alternative treatment sequences. These models are routinely used to inform health economic evaluations. However, they can be computationally expensive to run, and therefore the evaluation of potentially millions of treatment sequences is not feasible. However, simulation optimisation methods exist to identify a good solution from a simulation model within a feasible period of time. Using these methods within an economic evaluation of treatment sequences has not previously been investigated. In this thesis I highlight the importance of the treatment sequencing problem, review and assess relevant simulation optimisation methods, and implement a simulated annealing algorithm to explore its feasibility and appropriateness. From the implementation case study within rheumatoid arthritis, simulation optimisation via simulated annealing appears to be a feasible method to identify a set of good treatment sequences. However, the method requires a significant amount of time to implement and execute, which may limit its appropriateness for health resource allocation decision making. Further research is required to investigate the generalisability of the method, and further consideration regarding its use in a decision-making context is important