Volume 11 (2026)
Volume 10 (2025)
Volume 9 (2024)
Volume 8 (2023)
Volume 7 (2022)
Volume 6 (2021)
Volume 5 (2020)
Volume 4 (2019)
Volume 3 (2018)
Volume 2 (2017)
Volume 1 (2016)
Main Subjects = Optimization
Number of Articles: 18
A Graph-Theoretic Heuristic Approach for a Multi-Objective Healthcare Facility Layout Problem: A Real Hospital Case Study
Articles in Press, Accepted Manuscript, Available Online from 15 February 2026
Abstract
Efficient layout design in healthcare facilities is critical for operational effectiveness and patient care. This study addresses the healthcare facility layout problem using a multi-objective optimization approach. We propose a novel methodology based on graph theory, specifically planar adjacency graphs, ... Read MoreDesigning a New Continuous Quantum Evolutionary Algorithm for Nonlinear Optimization and Efficiency Frontier Evaluation
Volume 11, Issue 1 , January 2026, , Pages 1-29
Abstract
In this paper, we introduce a new continuous quantum evolutionary optimization algorithm designed for optimizing nonlinear convex functions, non-convex functions, and efficiency evaluation problems using quantum computing principles. Traditional quantum evolutionary algorithms have primarily been ... Read More)
Some Hybrid Conjugate Gradient Methods Based on Barzilai-Borwein Approach for Solving Two-Dimensional Unconstrained Optimization Problems
Volume 11, Issue 1 , January 2026, , Pages 59-71
Abstract
The conjugate gradient ({CG}) method is one of the simplest and most widely used approaches for unconstrained optimization, and our focus is on two-dimensional problems with numerous practical applications. We devise three hybrid {CG} methods in which the hybrid parameter is constructed from the Barzilai–Borwein ... Read More)
A Metaheuristic and LP-Based Approach to Irregular Face Coloring in Planar Graphs
Volume 11, Issue 1 , January 2026, , Pages 141-151
Abstract
In irregular coloring, each vertex is labeled with a unique color code, a tuple consisting of its assigned color and the number of neighbors in each color class. This work proposes a local search algorithm as a metaheuristic approach to the irregular face coloring problem in planar graphs, ... Read More)
Optimizing Deep Learning Hyperparameters Using Interpolation-Based Optimization
Volume 10, Issue 2 , July 2025, , Pages 241-253
Abstract
Hyperparameter optimization (HPO) is essential for maximizing the performance of deep learning models. Traditional approaches, such as grid search and Bayesian Optimization (BO), are widely used but can be computationally expensive. We present Interpolation-Based Optimization (IBO), a ... Read MoreA New Approach to Control of Legged Robots
Volume 9, Issue 2 , December 2024, , Pages 97-121
Abstract
Designing dynamically stable controllers for a robot with 2r legs is challenging due to its complex hybrid dynamics (r>1). This paper proposes a technique to decompose the robot into r biped robots, where the influence of other robot parts on each biped can be modeled as external forces. This approach ... Read MoreEfficient Solution of Nonlinear Unconstraint Optimization Problems using Quasi-Newton's Method: A Revised Approach
Volume 9, Issue 1 , May 2024, , Pages 49-65
Abstract
While many real-world optimization problems typically involve multiple constraints, unconstrained problems hold practical and fundamental significance. They can arise directly in specific applications or as transformed versions of constrained optimization problems. Newton's method, ... Read MoreA Hybrid Floyd-Warshall and Graph Coloring Algorithm for Finding the Smallest Number of Colors Needed for a Distance Coloring of Graphs
Volume 9, Issue 1 , May 2024, , Pages 185-194
Abstract
Graph coloring is a crucial area of research in graph theory, with numerous algorithms proposed for various types of graph coloring, particularly graph p-distance coloring. In this study, we employ a recently introduced graph coloring algorithm to develop a hybrid algorithm approximating the chromatic ... Read MoreA New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems
Volume 3, Issue 1 , July 2018, , Pages 27-43
Abstract
In this paper, two extended three-term conjugate gradient methods based on the Liu-Storey ({\tt LS}) conjugate gradient method are presented to solve unconstrained optimization problems. A remarkable property of the proposed methods is that the search direction always satisfies ... Read MoreTwo-Level Optimization Problems with Infinite Number of Convex Lower Level Constraints
Volume 2, Issue 2 , December 2017, , Pages 33-44
Abstract
This paper proposes a new form of optimization problem which is a two-level programming problem with infinitely many lower level constraints. Firstly, we consider some lower level constraint qualifications (CQs) for this problem. Then, under these CQs, ... Read MoreOptimal Shape Design for a Cooling Pin Fin Connection Profil
Volume 2, Issue 2 , December 2017, , Pages 61-76
Abstract
A shape optimization problem of cooling fins for computer parts and integrated circuits is modeled and solved in this paper. The main purpose is to determine the shape of a two-dimensional pin fin, which leads to the maximum amount of removed heat. To do this, the shape optimization problem is defined ... Read MoreOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
Volume 2, Issue 2 , December 2017, , Pages 77-101
Abstract
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and ... Read MoreA New Approach for Solving Grey Assignment Problems
Volume 2, Issue 1 , April 2017, , Pages 15-28
Abstract
Linear assignment problem is one of the most important practical models in the literature of linear programming problems. Input data in the cost matrix of the linear assignment problem are not always crisp and sometimes in the practical situations is formulated by the grey systems theory approach. ... Read MoreOptimization of Energy Consumption in Image Transmission in Wireless Sensor Networks (WSNs) using a Hybrid Method
Volume 2, Issue 1 , April 2017, , Pages 29-41
Abstract
In wireless sensor networks (WSNs), sensor nodes have limited resources with regard to computation, storage, communication bandwidth, and the most important of all, energy supply. In addition, in many applications of sensor networks, ... Read MoreRegularity Conditions for Non-Differentiable Infinite Programming Problems using Michel-Penot Subdifferential
Volume 1, Issue 1 , April 2016, , Pages 21-30
Abstract
In this paper we study optimization problems with infinite many inequality constraints on a Banach space where the objective function and the binding constraints are locally Lipschitz. Necessary optimality conditions and regularity conditions are given. Our approach are based on the ... Read MoreOn Efficiency of Non-Monotone Adaptive Trust Region and Scaled Trust Region Methods in Solving Nonlinear Systems of Equations
Volume 1, Issue 1 , April 2016, , Pages 31-40
Abstract
In this paper we run two important methods for solving some well-known problems and make a comparison on their performance and efficiency in solving nonlinear systems of equations. One of these methods is a non-monotone adaptive trust region strategy and another one is a scaled trust region ... Read MoreSolving Linear Semi-Infinite Programming Problems Using Recurrent Neural Networks
Volume 1, Issue 1 , April 2016, , Pages 55-67
Abstract
Linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints. In this paper, to solve this problem, we combine a discretization method and a neural network method. By a simple discretization ... Read MoreSolving Fully Fuzzy Linear Programming Problems with Zero-One Variables by Ranking Function
Volume 1, Issue 1 , April 2016, , Pages 69-78