Accuracy Optimizing Bipolar Fuzzy Fractional Programming Problems Using the Variable Neighborhood Search Algorithm

In this paper, we propose a new variable neighbourhood search algorithm for solving a bipolar fuzzy number fractional problem (FBVNS). The proposed algorithm utilises a modified version of Kerre's inequality, a tool employed to compare bipolar fuzzy numbers. The utilisation of the FBVNS algorithm enables the direct resolution of the bipolar fuzzy number fractional problem, obviating the necessity for conversion to a crisp number representation. The FBVNS algorithm is further enhanced by the introduction of a novel local search method, which is informed by ascending directions derived from the resolution of four distinct crisp mathematical programming problems. Finally, the efficacy of the proposed algorithm is demonstrated through its implementation on a range of problems.

Institutions

Publication Details

Journal
OICC Press Journals
Published
2025-04-23
DOI
https://doi.org/10.57647/j.fomj.2025.16559
Primary Topic
Optimization and Mathematical Programming
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Accuracy Optimizing Bipolar Fuzzy Fractional Programming Problems Using the Variable Neighborhood Search Algorithm

OICC Press Journals
Optimization and Mathematical Programming
article

Accuracy Optimizing Bipolar Fuzzy Fractional Programming Problems Using the Variable Neighborhood Search Algorithm

article en

Abstract

In this paper, we propose a new variable neighbourhood search algorithm for solving a bipolar fuzzy number fractional problem (FBVNS). The proposed algorithm utilises a modified version of Kerre's inequality, a tool employed to compare bipolar fuzzy numbers. The utilisation of the FBVNS algorithm enables the direct resolution of the bipolar fuzzy number fractional problem, obviating the necessity for conversion to a crisp number representation. The FBVNS algorithm is further enhanced by the introduction of a novel local search method, which is informed by ascending directions derived from the resolution of four distinct crisp mathematical programming problems. Finally, the efficacy of the proposed algorithm is demonstrated through its implementation on a range of problems.

OICC Press Journals
Kharazmi University (IR), University of Qom (IR), Ferdowsi University of Mashhad (IR)
Reduced inequalities
Openalex Percentile: Top 48%
Optimization and Mathematical Programming
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.