Search in Publications

Found 6674 publications

Modeling of Fuzzy Rule-base Algorithm for the Time Dependent Traveling Salesman Problem

Péter Földesi Boldizsár Tüű-Szabó Ruba Almahasneh László T. Kóczy

Publication Name: IEEE International Conference on Fuzzy Systems

Publication Date: 2019-06-01

Volume: Unknown

Issue: Unknown

Page Range: Unknown

Description:

The Traveling Salesman Problem (TSP) is one of the most extensively studied NP-hard graph search problems. In the literature, there have been numerous published attempts, applying various approaches in order to find the optimum (least cost) or semi optimum solution. Time Dependent Traveling Salesman Problem (TD TSP) is one of the most sufficient extensions and modifications of the original TSP problem. In TD TSP the costs of edges between nodes varies, they are assigned higher cost in the traffic jam region, such as city center or during the rush hour periods. In this paper, we introduce an even more realistic approach, the 3FTD TSP (Triple Fuzzy Time Dependent Traveling Salesman Problem); a fuzzified model of the original TD TSP. The 3FTD TSP presents a variation of the TD TSP utilizing fuzzy values in the cost between two nodes (shops, cities, etc.), the geographical areas of the traffic jam region, and also the rush hour period. The goal is to give a practically useful and realistic alternative of the basic TD TSP problem. In order to calculate the (quasi-) optimum solution, the Discrete Bacterial Memetic Evolutionary Algorithm was used, since it has been proven to be rather efficient (and predictably) in a wide range of NP-hard problems, including the original TSP and the TD TSP as well. The results from the runs based on the extensions of the family of benchmarks generated from the original TD TSP benchmark data set showed rather good and credible initial results.

Open Access: Yes

DOI: 10.1109/FUZZ-IEEE.2019.8858853

Eclipse SUMO and Unity 3D integration for emission studies based on driving behaviour in virtual reality environment

Viktor Nagy Viktor Nagy Csaba József Májer Sámuel Lepold

Publication Name: Procedia Computer Science

Publication Date: 2025-01-01

Volume: 257

Issue: Unknown

Page Range: 396-403

Description:

This paper explores the development of a traffic simulator that harnesses the power of OpenStreetMap (OSM) data, integrating it into a unified framework using Blender, SUMO (Simulation of Urban MObility), and Unity 3D. The project aims to provide a realistic and versatile platform for simulating complex transportation scenarios for urban planning, traffic management, and virtual environment creation. The process begins with the extraction and preprocessing of OSM data, ensuring the representation of road networks and geographic features. Blender, a 3D modelling software, is used to visualise and enhance the environment. The resulting 3D models are loaded into Unity. SUMO - a microscopic traffic simulation software - plays a role in modelling vehicle dynamics, traffic flow, and interactions within the simulated environment. Via an integration hub, bringing together the visuality of Unity 3D environment and SUMO's precise traffic simulation. Through this collaboration, the simulator offers real-time interaction and analysis. With the help of SUMO's free emissions module, the pollution resulting from driving behaviour can be measured not only at the individual level but also the impact on the network as well. The combination of OSM data, SUMO, Blender, and Unity 3D provides a powerful and free tool to study and optimise urban mobility, ultimately contributing to the development of smarter and more sustainable transportation systems.

Open Access: Yes

DOI: 10.1016/j.procs.2025.03.052

A new method applied for explaining the landing patterns: Interpretability analysis of machine learning

Yaodong Gu Gusztáv Fekete Wenjing Quan Datao Xu Huiyu Zhou Ukadike Chris Ugbolue

Publication Name: Heliyon

Publication Date: 2024-02-29

Volume: 10

Issue: 4

Page Range: Unknown

Description:

As one of many fundamental sports techniques, the landing maneuver is also frequently used in clinical injury screening and diagnosis. However, the landing patterns are different under different constraints, which will cause great difficulties for clinical experts in clinical diagnosis. Machine learning (ML) have been very successful in solving a variety of clinical diagnosis tasks, but they all have the disadvantage of being black boxes and rarely provide and explain useful information about the reasons for making a particular decision. The current work validates the feasibility of applying an explainable ML (XML) model constructed by Layer-wise Relevance Propagation (LRP) for landing pattern recognition in clinical biomechanics. This study collected 560 groups landing data. By incorporating these landing data into the XML model as input signals, the prediction results were interpreted based on the relevance score (RS) derived from LRP. The interpretation obtained from XML was evaluated comprehensively from the statistical perspective based on Statistical Parametric Mapping (SPM) and Effect Size. The RS has excellent statistical characteristics in the interpretation of landing patterns between classes, and also conforms to the clinical characteristics of landing pattern recognition. The current work highlights the applicability of XML methods that can not only satisfy the traditional decision problem between classes, but also largely solve the lack of transparency in landing pattern recognition. We provide a feasible framework for realizing interpretability of ML decision results in landing analysis, providing a methodological reference and solid foundation for future clinical diagnosis and biomechanical analysis.

Open Access: Yes

DOI: 10.1016/j.heliyon.2024.e26052

Three step bacterial memetic algorithm

László Gál Rita Lovassy László T. Kóczy

Publication Name: Ines 2010 14th International Conference on Intelligent Engineering Systems Proceedings

Publication Date: 2010-07-26

Volume: Unknown

Issue: Unknown

Page Range: 31-36

Description:

In order to study the function approximation performance of Fuzzy Neural Networks built up from fuzzy J-K flip-flop neurons a new learning algorithm, the Three Step Bacterial Memetic Algorithm is proposed. Hybrid evolutionary methods that combine genetic type algorithms with "classic" local search have been applied to perform efficient global search. This novel version of the Bacterial Memetic Algorithm with Modified Operator Execution Order (BMAM) is a recently developed technique of hybrid type. This particular merger of evolutionary and gradient based algorithms combining both global and local search consists of bacterial mutation and, as a second step, the Levenberg-Marquardt (LM) method applied for each clone. This LM step saves in this way some potential solutions that could be lost otherwise after each mutation step. As a third step the LM algorithm is recalled for a few iterations for each individual of the population towards reaching the local optimum. In our novel algorithm various kinds of fast algorithm with less complexity, like Quasi-Newton algorithm, Conjugate Gradient algorithm, and two Backpropagation training algorithms: Gradient Descent and Gradient Descent with Adaptive Learning Rate and Momentum are nested in the bacterial mutation. © 2010 IEEE.

Open Access: Yes

DOI: 10.1109/INES.2010.5483817

"System identification" and hermeneutics for long run series of synchronicities in the Pauli-Jung relationship

Peter Varlaki Imre J. Rudas József Bokor

Publication Name: Iccc 2009 IEEE 7th International Conference on Computational Cybernetics

Publication Date: 2009-12-01

Volume: Unknown

Issue: Unknown

Page Range: 129-140

Description:

The paper discusses some characteristic symbolic patterns which can be identified in the long run series of synchronicities in the Pauli-Jung cooperation concerning the long run dream series of Pauli. We try to show the paradigm of the modern system and control theory in the typical identifiable structures and symbolic patterns of dreams and synchronistic phenomena using the contemporary and old approaches of Hermeneutics. ©2009IEEE.

Open Access: Yes

DOI: 10.1109/ICCCYB.2009.5393949

Investigation on the physico-chemical properties of soil and mineralization of three selected tropical tree leaf litter

Mukesh Kumar Awasthi Jun Wei Lim Balasubramani Ravindran Babett Greff Rajinikanth Rajagopal A. Thamizharasan V. R.R. Rajaguru S. Gajalakshmi Soon Woong Chang

Publication Name: Environmental Research

Publication Date: 2024-02-15

Volume: 243

Issue: Unknown

Page Range: Unknown

Description:

Plant leaf litter has a major role in the structure and function of soil ecosystems as it is associated with nutrient release and cycling. The present study is aimed to understand how well the decomposing leaf litter kept soil organic carbon and nitrogen levels stable during an incubation experiment that was carried out in a lab setting under controlled conditions and the results were compared to those from a natural plantation. In natural site soil samples, Anacardium. occidentale showed a higher value of organic carbon at surface (1.14%) and subsurface (0.93%) and Azadirachta. indica exhibited a higher value of total nitrogen at surface (0.28%) and subsurface sample (0.14%). In the incubation experiment, Acacia auriculiformis had the highest organic carbon content initially (5.26%), whereas A. occidentale had the highest nitrogen level on 30th day (0.67%). The overall carbon-nitrogen ratio showed a varied tendency, which may be due to dynamic changes in the complex decomposition cycle. The higher rate of mass loss and decay was observed in A. indica leaf litter, the range of the decay constant is 1.26–2.22. The morphological and chemical changes of soil sample and the vermicast were substantained using scanning electron microscopy (SEM) and Fourier transmission infrared spectroscopy (FT-IR).

Open Access: Yes

DOI: 10.1016/j.envres.2023.117752

A new assessment methodology for fair-faced concrete surfaces based on digital image processing

András Horváth Kitti Ajtayné Károlyfi F. Papp

Publication Name: Proceedings of the 2020 Session of the 13th Fib International Phd Symposium in Civil Engineering

Publication Date: 2020-01-01

Volume: Unknown

Issue: Unknown

Page Range: 288-295

Description:

Fair-faced concrete elements have become even more popular in architecture because of their pure aesthetics and favourable material properties. The europian standards and guidelines are usually specifying four classes regarding to the surface quality. However, the strandard assessment methodologies are based only on manual methods and they are very subjective in some cases. In order to increase the efficiency and accuary of the evaluation a new methodology is proposed using digital image processing. In this paper the basis of the evaluation method made by using the Python 3.6 software is presented by focusing on the surface void ratio which is one of the most common surface defects of fair-faced concrete structures.

Open Access: Yes

DOI: DOI not available

Comparative Analysis of Discrete-Time and Precedence-Based MILP Formulations for Sustainable Scheduling in Furniture Manufacturing

Botond Bertok Károly Kalauz Márton Frits

Publication Name: Chemical Engineering Transactions

Publication Date: 2025-01-01

Volume: 121

Issue: Unknown

Page Range: 151-156

Description:

Efficient production scheduling plays a pivotal role in enhancing productivity and reducing energy consumption in mass manufacturing environments. This study presents a comparative evaluation of two mixed-integer linear programming (MILP) formulations - Discrete-Time Process Network Synthesis (PNS) and Precedence-Based Time-Constrained Process Network Synthesis (TCPNS) - for optimizing production scheduling in furniture manufacturing. Both approaches are grounded in the P-graph framework, which excels at representing complex, flexible process recipes commonly found in large-scale production systems. The TCPNS model, with its precedence-based structure, offers high-resolution scheduling capabilities and accurately manages complex changeover constraints. It enables the computation of exact start times and resource allocations, leading to highly optimized schedules. However, this precision comes with increased computational demand, which can become impractical for large-scale instances. Conversely, the PNS approach discretizes the planning horizon into time slots, significantly reducing model size and complexity. While this may result in less granular schedules, the formulation allows for faster solution times and easier integration of combinatorial simplifications, making it a practical alternative for real-time applications. The research also explores automated model generation techniques for both formulations, highlighting multi-resolution capabilities in the discrete-time approach that allow flexible trade-offs between accuracy and computational effort. A real-life case study from the furniture manufacturing sector is used to benchmark the two optimization strategies. The results demonstrate the practical implications of each method in terms of schedule precision, computational performance, and energy-aware utilization, i.e., if minute-to-minute scheduling is sufficient instead of milliseconds, then traditional PNS algorithms can offer the same sustainable solution with 10,000 times faster computation.

Open Access: Yes

DOI: 10.3303/CET25121026

Remanufacturing a Synchronous Reluctance Machine with Aluminum Winding: An Open Benchmark Problem for FEM Analysis

Miklós Kuczmann Mihaly Katona Tamas Orosz Zoltán Németh Dávid Gábor Bányai

Publication Name: Electronics Switzerland

Publication Date: 2024-02-01

Volume: 13

Issue: 4

Page Range: Unknown

Description:

The European Union’s increasing focus on sustainable and eco-friendly product design has resulted in significant pressure on original equipment manufacturers to adopt more environmentally conscious practices. As a result, the remanufacturing of end-of-life electric machines is expected to become a promising industrial segment. Identifying the missing parameters of these types of machines will play an essential role in creating feasible and reliable redesigns and remanufacturing processes. A few case studies related to this problem have been published in the literature; however, some novel, openly accessible benchmark problems can facilitate the research and function as a basis for comparing and validating novel numerical methods. This paper presents the identification process of an experimental synchronous machine. It outlines methodologies for identifying material properties, winding schemes, and other critical parameters for the finite element analysis and modelling of electric machines with incomplete information. The machine in question is intended for remanufacturing, with the plan to replace its faulty winding with an aluminium-based alternative. It also serves as an open benchmark problem for researchers, designers, and practitioners.

Open Access: Yes

DOI: 10.3390/electronics13040727