Improvements to a decision-making algorithm

December 27, 2016, University of Electro-Communications
The chain-reaction update to effectively replace existing solutions for the search of the Pareto frontier. Hiroyuki Sato at the University of Electro-Communications in Tokyo, Japan, has made improvements to ability of the MOEA/D algorithm to search for the best solutions in multi- and many-objective decision-making problems. Credit: University of Electro-Communications

In fields such as engineering, economics or finance, highly complex decisions must be made, often incorporating multiple, at times contradictory, objectives. Highly specialised computer algorithms can help find the best possible solutions to these multi-objective problems (MOPs).

One such algorithm is MOEA/D (multi-objective evolutionary algorithm based on decomposition), which works by decomposing MOPs into single 'sub-problems', before selecting and presenting an optimal set of possible solutions known as the 'Pareto frontier'. The Pareto frontier is useful to designers and engineers, for example, because it helps them make trade-offs that allow for the best solution to a MOP.

Now, Hiroyuki Sato at the University of Electro-Communications in Tokyo has made improvements to the way in which MOEA/D searches for this optimal set of solutions. The method, which is based upon a chain-reaction solution update, deliberately ignores duplicated solutions within a search, thus enhancing the diversity of the solution population during a search. It also determines the order of existing search solutions to be presented in any one objective space; it does not automatically delete a solution if another neighbouring solution is deemed better but rather allows the user to specify target areas of the Pareto frontier that need to be met.

Further, the chain-reaction solution update allows for existing solutions to be replaced, and it will automatically back-track to check for alternative directions. Initial trials using the updated MOEA/D with 2-8 objectives showed improvements in its searching ability by enhancing diversity, although further investigations are needed into the computational costs of the proposed update.

Explore further: Post-disaster optimization technique capable of analyzing entire cities

More information: Hiroyuki Sato. Chain-reaction solution update in MOEA/D and its effects on multi- and many-objective optimization, Soft Computing (2016). DOI: 10.1007/s00500-016-2092-3

Related Stories

Path-finder computes search strategy to find Waldo

February 9, 2015

London-born Where's Waldo? creator Martin Handford started out as a commercial illustrator with a specialty in drawing crowd scenes. By now we know how that talent supported his success and fame. His first book, Where's Waldo?, ...

New 3-D structure shows optimal way to divide space

November 25, 2016

(—Researchers have discovered a new 3D structure that divides space into 24 regions, and have shown that it is the best solution yet to a modified version of a geometrical space-partitioning problem that has challenged ...

Recommended for you

Cryptocurrency rivals snap at Bitcoin's heels

January 14, 2018

Bitcoin may be the most famous cryptocurrency but, despite a dizzying rise, it's not the most lucrative one and far from alone in a universe that counts 1,400 rivals, and counting.

Top takeaways from Consumers Electronics Show

January 13, 2018

The 2018 Consumer Electronics Show, which concluded Friday in Las Vegas, drew some 4,000 exhibitors from dozens of countries and more than 170,000 attendees, showcased some of the latest from the technology world.

Finnish firm detects new Intel security flaw

January 12, 2018

A new security flaw has been found in Intel hardware which could enable hackers to access corporate laptops remotely, Finnish cybersecurity specialist F-Secure said on Friday.


Please sign in to add a comment. Registration is free, and takes less than a minute. Read more

Click here to reset your password.
Sign in to get notified via email when new comments are made.