The present study aimed to apply the Simulated Annealing (SA) optimization algorithm to find the ideal control of broiler housing rearing environment at 21, 28, 35, and 42 days of growth. Data from ...

Optimization problems often involve situations in which the user's goal is to minimize and/or maximize not a single objective function, but several, usually conflicting, functions simultaneously. Such ...

In the context of mass higher education, Chinese application-oriented undergraduate institutions face significant teaching challenges stemming from the increasingly diverse student population. This ...

Abstract: Optimization problems aim to identify the best solution from a wide range of possibilities. The Particle Swarm Optimization (PSO) algorithm is widely recognized for its simplicity and ...

ABSTRACT: In this paper, we investigate the convergence of the generalized Bregman alternating direction method of multipliers (ADMM) for solving nonconvex separable problems with linear constraints.

ABSTRACT: The alternating direction method of multipliers (ADMM) and its symmetric version are efficient for minimizing two-block separable problems with linear constraints. However, both ADMM and ...

Impact Statement: The multi-objective traveling salesman problem (MOTSP), one of the typical combinatorial optimization problems, can be used to model a broad range of real applications.

You can probably think of a time when you’ve used math to solve an everyday problem, such as calculating a tip at a restaurant or determining the square footage of a room. But what role does math play ...