Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...

Methods of Medium Optimization

Methods of Medium Optimization

Optimizing growth media enhances microbial proliferation and maximizes product yield. Statistical experimental design methodologies provide structured and reproducible approaches, offering progressively higher levels of robustness and efficiency.The One-Factor-at-a-Time (OFAT) MethodThe One-Factor-at-a-Time (OFAT) method involves adjusting a single variable while keeping all others constant. However, it cannot detect interactions between variables, often leading to suboptimal outcomes when...

Mathematical Modeling: Problem Solving

Mathematical Modeling: Problem Solving

Mathematical modeling transforms real-world scenarios into mathematical expressions, allowing for structured problem-solving and analysis. This process involves defining the situation, assigning variables to measurable quantities, selecting an appropriate model, and solving the resulting equation. Such models are invaluable in finance, providing precise methods to evaluate investments, loans, and repayment structures.A widely used example is the calculation of fixed monthly payments on a loan,...

Theorems of Pappus and Guldinus: Problem Solving

Theorems of Pappus and Guldinus: Problem Solving

Pappus and Guldinus's theorems are powerful mathematical principles that are used for finding the surface area and volume of composite shapes. For example, consider a cylindrical storage tank with a conical top. Finding the surface area or volume can be challenging for such complex shapes. These theorems are particularly useful in calculating the volume and surface area of such systems. Here, the cylindrical storage tank with a conical top can be broken down into two simple shapes: a cylinder...

Statically Indeterminate Problem Solving

Statically Indeterminate Problem Solving

Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...

Method of Sections: Problem Solving II

Method of Sections: Problem Solving II

Consider an arbitrary truss structure composed of diagonal, vertical, and horizontal members fixed to the wall. To calculate the force acting on members CB, GB, and GH, method of sections can be used. The loads and lengths of the horizontal and vertical members are known parameters, as shown in the figure.

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

A Low Cost IoT Cyber-Physical System for Vehicle and Pedestrian Tracking in a Smart Campus.

Sensors (Basel, Switzerland)·2022

Same author

Hybridization of Evolutionary Operators with Elitist Iterated Racing for the Simulation Optimization of Traffic Lights Programs.

Evolutionary computation·2022

Same author

Dynastic Potential Crossover Operator.

Evolutionary computation·2021

Same author

BIN-CT: Urban waste collection based on predicting the container fill level.

Bio Systems·2019

Same author

BiPred: A Bilevel Evolutionary Algorithm for Prediction in Smart Mobility.

Sensors (Basel, Switzerland)·2018

Same author

Advances in Neural Networks and Hybrid-Metaheuristics: Theory, Algorithms, and Novel Engineering Applications.

Computational intelligence and neuroscience·2016

Search research articles

Related Experiment Video

Updated: Jun 3, 2026

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

Published on: December 9, 2012

A methodology to find the elementary landscape decomposition of combinatorial optimization problems.

Francisco Chicano¹, L Darrell Whitley, Enrique Alba

¹Departamento de Lenguajes y Ciencias de la Computación, Universidad de Málaga, Spain. chicano@lcc.uma.es

Evolutionary Computation

|April 8, 2011

Summary

This study introduces algebraic methods to decompose complex combinatorial optimization problems into simpler elementary landscapes. This approach aids in understanding and solving challenging computational problems.

Related Experiment Videos

Last Updated: Jun 3, 2026

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

Published on: December 9, 2012

Area of Science:

Computational complexity
Combinatorial optimization
Mathematical analysis

Background:

Combinatorial optimization problems often feature complex search spaces.
Elementary landscapes, defined by objective functions as eigenfunctions of the Laplacian, represent a simplified subset of these problems.
Many real-world problems do not fit this elementary structure.

Purpose of the Study:

To develop theoretical foundations for decomposing arbitrary combinatorial optimization problems into elementary landscapes.
To establish algebraic methods for objective function decomposition.
To demonstrate the applicability of this methodology to specific problems.

Main Methods:

The study leverages the property that objective functions can be expressed as superpositions of elementary landscapes on symmetric neighborhoods.
Theoretical results are presented to support algebraic decomposition techniques.
The methodology is applied to analyze the subset sum and quadratic assignment problems.

Main Results:

A method is established to decompose any combinatorial optimization problem's objective function into a sum of elementary landscapes.
The subset sum problem is shown to be a superposition of two elementary landscapes.
The quadratic assignment problem is demonstrated to be a superposition of three elementary landscapes.

Conclusions:

The developed algebraic methods provide a systematic way to decompose complex optimization landscapes.
This decomposition facilitates a deeper understanding of problem structures.
The potential for automated tools to assist in landscape decomposition is highlighted.