PSO Based Constraint Optimization of Intuitionistic Fuzzy Shortest Path Problem in an Undirected Network DOI

Chanchal Dudeja

International Journal of Uncertainty Fuzziness and Knowledge-Based Systems, Journal Year: 2024, Volume and Issue: 32(03), P. 303 - 323

Published: May 1, 2024

Shortest Path Problem (SPP) is mainly used in network optimization; also, it has a wide range of applications such as routing, scheduling, communication and transportation. The main objective this work to find the shortest path between two specified nodes by satisfying certain constraints. This modified version SP called Constraint (CSP), which establishes limit on selected constraints for path. constraint values precisely traditional CSP problems. But, precise data may vary due environmental conditions, traffic payload. To resolve this, proposed uses intuitionistic fuzzy numbers deal with imprecise data. Also, finding an optimal solution complex search space undirected difficult. Hence, Particle Swarm Optimization (PSO) obtain global within feasible regions. A numerical example implementation Matlab 2016a working environment are also illustrated. simulation analysis shows that PSO algorithm takes 1.8[Formula: see text]s graph, comparatively lower than existing Genetic Algorithm (2.4[Formula: text]s) without optimization (5.6[Formula: text]s).

Language: Английский

Original optimal method to solve the all-pairs shortest path problem: Dhouib-matrix-ALL-SPP DOI Creative Commons
Souhail Dhouib

Data Science and Management, Journal Year: 2024, Volume and Issue: 7(3), P. 206 - 217

Published: Feb. 2, 2024

The All-pairs shortest path problem (ALL-SPP) aims to find the joining all vertices in a given graph. This study proposed new optimal method, Dhouib-matrix-ALL-SPP (DM-ALL-SPP) solve ALL-SPP based on column-row navigation through adjacency matrix. DM-ALL-SPP is designed generate single execution with details among all-pairs of for graph positive and negative weighted edges. Even graphs cycle, reported cycle. In addition, continues work directed, undirected mixed graphs. Furthermore, it characterized by two phases: first phase consists adding column repeated (n) iterations (where n number vertices), second resides row executed worst case (n*log(n)) iterations. phase, focused improving elements each their values modifying them smallest value. emphasized rows only modified phase. Different instances from literature were used test performance which was developed using Python programming language results compared those obtained Floyd-Warshall algorithm.

Language: Английский

Citations

4
Minimizing the drilling robot arm movement by the advanced Dhouib-Matrix-4 metaheuristic DOI
Souhail Dhouib

Concurrent Engineering, Journal Year: 2025, Volume and Issue: unknown

Published: Jan. 7, 2025

Drilling holes on a Printed Circuit Board is complicated task and it usually ensured via Computer Numerical Control (CNC) machine using drilling robot arm. Commonly, to increase the performance of CNC, movement its arm minimized optimization route. Hence, different metaheuristics are used plan shortest In this purpose, we designed novel metaheuristic namely Dhouib-Matrix-4 (DM4) in paper DM4 enhanced with Tabu list (T) adapted route for arm: proposed method entitled Dhouib-Matrix-4-Tabu (DM4-T). fact, DM4-T combines two techniques multi-start structure: (i) An initial basic solution generated Dhouib-Matrix-TSP1 heuristic (ii) intensified innovative Far-to-Near local search technique list. Experimental results indicate robustness solve several instances up 2152 holes. Indeed, DM4- T outperforms existing literature such as Genetic Algorithm, Ants Colony Optimization, Integrated Simulated Annealing Modified Shuffled Frog Leaping Algorithm.

Language: Английский

Citations

0
Impact analysis of Russian-Ukrainian war on airspace DOI
Ivan Ostroumov, Viktoriia Ivannikova, Nataliia Kuzmenko

et al.

Journal of Air Transport Management, Journal Year: 2025, Volume and Issue: 124, P. 102742 - 102742

Published: Jan. 22, 2025

Language: Английский

Citations

0
Innovative technique with enriched movement directions to plan the trajectory for an autonomous Mobile robot DOI Creative Commons
Souhail Dhouib

Science Progress, Journal Year: 2025, Volume and Issue: 108(1)

Published: Jan. 1, 2025

This paper presents a deep analysis of novel method entitled Dhouib-Matrix-SPP-24 (DM-SPP-24) and its application to rapidly generate the shortest trajectory for an autonomous mobile robot. For this problem, environment is represented by grid map where several obstacles are exposed with static positions main objective plan robot from current target free-collisions. study introduces in-depth exploration twenty-four movement directions DM-SPP-24 method, on six maps comparison recent metaheuristics taken literature (such as Improved Ant Colony Algorithm, enhanced Optimization Gaussian Sampling, Particle Swarm Optimization, Genetic Algorithm other methods). Indeed, new namely introduced notes improvement in quality rapidity generated solution versus produced published literature. work serves valuable resource robotics path planning viewing that it very fast accurate

Language: Английский

Citations

0
The maximum range method for finding initial basic feasible solution for transportation problems DOI Creative Commons
Fredrick Asenso Wireko,

Ignatius Dennis Kwesi Mensah,

Emmanuel Nii Apai Aborhey

et al.

Results in Control and Optimization, Journal Year: 2025, Volume and Issue: unknown, P. 100551 - 100551

Published: April 1, 2025

Language: Английский

Citations

0
Innovative method to solve the minimum spanning tree problem: The Dhouib-Matrix-MSTP (DM-MSTP) DOI Creative Commons
Souhail Dhouib

Results in Control and Optimization, Journal Year: 2023, Volume and Issue: 14, P. 100359 - 100359

Published: Dec. 7, 2023

The Minimum Spanning Tree problem aims to create a subset of graph where all the vertices are connected with minimum edge weights and no cycle. In this field, an innovative method entitled Dhouib-Matrix-MSTP (DM-MSTP) is designed in research work time complexity independently number edges O(n*log(n)) n vertices. DM-MSTP constructive algorithm based on matrix navigation two new lists (Min-Columns MST-Path) order organize steering flow. composed four simple steps first fourth repeated only once, whereas second third reiterated (n-1). For more clarification, step-by-step application proposed presented details. Besides, performance proved through different examples from literature including negative weighted complete graphs TSP-LIB. Moreover, modification (Min by Max) tested Maximum (Largest) Problem. Also, applied eight case studies compared six methods developed literature. All these experimental results above environments show that can rapidly plan shortest spanning tree stable convivial representation optimal tree. Hence, under Python programming language using Matplotlib Numpy standard libraries.

Language: Английский

Citations

10
Enhancing the Dhouib-Matrix-4 metaheuristic to generate the Pareto non-dominated set solutions for multi-objective travelling salesman problem: The DM4-PMO method DOI Creative Commons
Souhail Dhouib,

Aïda Kharrat,

Taïcir Loukil

et al.

Results in Control and Optimization, Journal Year: 2024, Volume and Issue: 14, P. 100402 - 100402

Published: Feb. 27, 2024

This paper focuses on the multi-objective Travelling Salesman Problem for which aim is to find set of efficient solutions. To obtain this Pareto set's solutions, a novel metaheuristic named DM4-PMO proposed. The based first enhancement new Dhouib-Matrix-4 (DM4) method and composed two steps. First, weighted sum function with multi variation weights used non-dominated pareto frontier Second, lexicographical resolution applied in some solutions found generate final performance proposed approach demonstrated by experiment two-objective problems that are taken from TSP-LIB DIMACS datasets. test results show robust, fast, simply structured, short computational times using very few user-defined parameters.

Language: Английский

Citations

3
Hierarchical Coverage Repair Policies Optimization by Dhouib-Matrix-4 Metaheuristic for Wireless Sensor Networks using Mobile Robot DOI Open Access
Souhail Dhouib

International journal of engineering. Transactions C: Aspects, Journal Year: 2023, Volume and Issue: 36(12), P. 2153 - 2160

Published: Jan. 1, 2023

The wireless sensor networks represent a wide range of potential application, they are composed set energy-constrained sensors used for detecting events and then sending information. In this paper, the novel metaheuristic Dhouib-Matrix-4 (DM4) is enhanced to optimize coverage repair policies using mobile robot with different moving speeds. Hierarchically, two conflicted criteria considered: at first number be visited in time maximized, second, trajectory distance minimized. Therefore, maximizing lifetime minimizing path challenging issue. DM4 multi-start method which uses each start greedy heuristic Dhouib-Matrix-TSP1 order generate an initial basic feasible solution will intensified by new local search technique entitled Far-to-Near. applied on several TSP-LIB standard instances from literature where speed (w) actor varied 0.4 1. performance proven comparing its results those generated Evolutionary Algorithm (EA). developed under Python programming language graphical representation illustrated.

Language: Английский

Citations

9
Intelligent Path Planning for Cognitive Mobile Robot Based on Dhouib-Matrix-SPP Method DOI Creative Commons
Souhail Dhouib

Cognitive Robotics, Journal Year: 2024, Volume and Issue: 4, P. 62 - 73

Published: Jan. 1, 2024

The Mobile Robot Path Problem looks to find the optimal shortest path from starting point target with collision-free for a mobile robot. This is popular issue in robotics and this paper environment considered as static represented bidirectional grid map. Besides, novel method Dhouib-Matrix-SPP (DM-SPP) applied create robot environment. DM-SPP greedy based on column row navigation distance matrix characterized by its rapidity solve sparse graphs. comparative analysis conducted applying thirteen test cases comparing results given four metaheuristics Max-Min Ant System, System punitive measures, A* Improved Hybrid A*. outcomes acquired different scenarios indicate that proposed can rapidly outperform predefined artificial intelligence methods.

Language: Английский

Citations

2
Faster than Dijkstra and A* Methods for the Mobile Robot Path Planning Problem Using Four Movement Directions: The Dhouib-Matrix-SPP-4 DOI Open Access
Souhail Dhouib

Advances in transdisciplinary engineering, Journal Year: 2024, Volume and Issue: unknown

Published: Jan. 26, 2024

Planning the shortest path for a mobile robot is hard task. It consists in quickly finding distance from starting to target positions with obstacles collision-free. The performance of will be increased if optimal rapidly planned. Therefore, this paper novel method entitled Dhouib-Matrix-SPP (DM-SPP) enhanced problem four movement directions (namely DM-SPP-4) an environment represented as grid map fixed obstacles. simulation results on several 41x41 maps and comparison DM-SPP-4 different methods (Basic Dijkstra, Modified Basic A*, Best First Search Algorithm, Breadth Search, Depth algorithms) show that can realize planning more accuracy.

Language: Английский

Citations

1