Simultaneous Computing of Sets of Maximally Different Alternatives to Optimal Solutions

Abstract

In solving many “real world” engineering optimization applications, it is generally preferable to formulate several quantifiably good alternatives that provide distinct perspectives to the particular problem. This is because decision-making typically involves complex problems that are riddled with incompatible performance objectives and contain competing design requirements which are very difficult – if not impossible – to capture and quantify at the time that the supporting mathematical programming models are actually constructed. There are invariably unmodelled design issues, not apparent at the time of model construction, which can greatly impact the acceptability of the model’s solutions. Consequently, it is preferable to generate several, distinct alternatives that provide multiple, disparate perspectives to the problem. These alternatives should possess nearoptimal objective measures with respect to all known modelled objective(s), but be fundamentally different from each other in terms of their decision variables. This solution approach is referred to as modelling to generatealternatives (MGA). This paper provides an efficient computational procedure for simultaneously generating multiple different alternatives to optimal solutions that employs the Firefly Algorithm. The efficacy of this approach will be illustrated using a well-known engineering optimization benchmark problem.

Authors and Affiliations

Julian Scott Yeomans

Keywords

Related Articles

Does a Hybrid Approach of Agile and Plan-Driven Methods Work Better for IT System Development Projects?

With a focus on large-scale IT system development projects in diverse enterprises, this research suggests that a hybrid approach combining agile and plan-driven management methods should fit in a wider context of specifi...

Strong and Weak Vertex-Edge Mixed Domination on S - Valued Graphs

In [6] we have introduced the notion of vertex edge mixed domination in S-valued graphs and proved several results. In this paper we introduce the notion of strong and weak vertex - edge mixed domination on S-valued grap...

Performance Investigation of Modified Desert Cooler

Desert cooler is effective and efficient when the dry bulb temperature is high and the relative humidity is low, restricting its use to dry climates. Traditionally, desert cooler pads consist of wood wool, coconut coir o...

A Survey on Crime Data Analysis Using Data Mining Techniques

In modern era, as the technology develops to a greater extent, the crime rates are increasing to a very vast level not only in India but also in major countries which possess a mighty threat to humans. So therefore these...

Project Teams For Traditional And AgileProjects: Why Are They Different?

Traditional projects and Agile projects require different approaches to systematically structure and develop project teams. Agile projectteams, as compared to traditional teams, question assumptionsroutinely, innovate, p...

Download PDF file
  • EP ID EP392448
  • DOI 10.9790/9622-0709082128.
  • Views 98
  • Downloads 0

How To Cite

Julian Scott Yeomans (2017). Simultaneous Computing of Sets of Maximally Different Alternatives to Optimal Solutions. International Journal of engineering Research and Applications, 7(9), 21-28. https://europub.co.uk/articles/-A-392448