Minimum cost polygon overlay with rectangular shape stock panels

06/19/2016
by   Wilson S. Siringoringo, et al.
0

Minimum Cost Polygon Overlay (MCPO) is a unique two-dimensional optimization problem that involves the task of covering a polygon shaped area with a series of rectangular shaped panels. This has a number of applications in the construction industry. This work examines the MCPO problem in order to construct a model that captures essential parameters of the problem to be solved automatically using numerical optimization algorithms. Three algorithms have been implemented of the actual optimization task: the greedy search, the Monte Carlo (MC) method, and the Genetic Algorithm (GA). Results are presented to show the relative effectiveness of the algorithms. This is followed by critical analysis of various findings of this research.

READ FULL TEXT
research
12/16/2020

Distributed Global Optimization (DGO)

A new technique of global optimization and its applications in particula...
research
09/24/2012

Developing Improved Greedy Crossover to Solve Symmetric Traveling Salesman Problem

The Traveling Salesman Problem (TSP) is one of the most famous optimizat...
research
07/29/2021

Quasi-genetic algorithms and continuation Newton methods with deflation techniques for global optimization problems

The global minimum point of an optimization problem is of interest in en...
research
04/17/2017

A Sport Tournament Scheduling by Genetic Algorithm with Swapping Method

A sport tournament problem is considered the Traveling Tournament Proble...
research
05/26/2021

The influence of various optimization algorithms on nuclear power plant steam turbine exergy efficiency and destruction

This paper presents an exergy analysis of the whole turbine, turbine cyl...
research
12/04/2020

Monte-Carlo Methods for the Neutron Transport Equation

This paper continues our treatment of the Neutron Transport Equation (NT...

Please sign up or login with your details

Forgot password? Click here to reset