P. Földesi

24724063900

Publications - 91

Stakeholders analysis of deposit refund waste collection system based on quality function deployment method

P. Földesi Eszter Sós Marah Almelhem

Publication Name: Cleaner Waste Systems

Publication Date: 2025-12-01

Volume: 12

Issue: Unknown

Page Range: Unknown

Description:

This study proposes a structured conceptual model for analyzing stakeholder complexity within Hungary's newly implemented Deposit Refund System (DRS), using the Quality Function Deployment (QFD) framework. A House of Quality (HoQ) matrix was developed to map the relationships between the functional features of the system and the specific requirements of key stakeholders, including government, system operators, manufacturers, retailers, and customers. A qualitative focus group method was applied to gather expert input and evaluate system features based on stakeholder experience and the evolving Hungarian context. Rather than aiming for statistical generalization, the study focuses on illustrating how structured modeling can reveal stakeholder trade-offs and support strategic alignment in complex waste collection systems. Findings highlight areas of convergence and divergence among stakeholders and demonstrate the utility of the QFD-based approach in designing adaptable, stakeholder-informed DRS models. The results are particularly relevant for countries in the early stages of DRS implementation or those seeking to redesign existing systems to better integrate technical feasibility and stakeholder priorities.

Open Access: Yes

DOI: 10.1016/j.clwas.2025.100370

A New Extensible Feature Matching Model for Corrosion Defects Based on Consecutive In-Line Inspections and Data Clustering

P. Földesi Mohamad Shatnawi

Publication Name: Applied Sciences Switzerland

Publication Date: 2025-03-01

Volume: 15

Issue: 6

Page Range: Unknown

Description:

Featured Application: The proposed framework introduces a new feature matching approach for corroded pipelines based on in-line inspections and data clustering, contributing to the broader field of pipeline integrity management. The effectiveness of this framework suggests potential for application in other domains that benefit from spatial feature matching. Corrosion is considered a leading cause of failure in pipeline systems. Therefore, frequent inspection and monitoring are essential to maintain structural integrity. Feature matching based on in-line inspections (ILIs) aligns corrosion data across inspections, facilitating the observation of corrosion progression. Nonetheless, the uncertainties of inspection tools and corrosion processes present in ILI data influence feature matching accuracy. This study proposes a new extensible feature matching model based on consecutive ILIs and data clustering. By dynamically segmenting the data into spatially localized clusters, this framework enables feature matching of isolated pairs and merging defects, as well as facilitating more precise localized transformations. Moreover, a new clustering technique—directional epsilon neighborhood clustering (DENC)—is proposed. DENC utilizes spatial graph structures and directional proximity thresholds to address the directional variability in ILI data while effectively identifying outliers. The model is evaluated on six pipeline segments with varying ILI data complexities, achieving high recall and precision of 91.5% and 98.0%, respectively. In comparison to exclusively point matching models, this work demonstrates significant improvements in terms of accuracy, stability, and managing the spatial variability and interactions of adjacent defects. These advancements establish a new framework for automated feature matching and contribute to enhanced pipeline integrity management.

Open Access: Yes

DOI: 10.3390/app15062943

Trade-offs in warehousing storage location reassignment

P. Földesi Tamas Bodis Polina Görbe

Publication Name: International Journal of Logistics Systems and Management

Publication Date: 2025-01-01

Volume: 51

Issue: 4

Page Range: 524-538

Description:

In the low-level picker-to-parts warehouses the order picking is the most time- and cost consuming process. The performance indicator for order picking is lead time. The system can be considered efficient if these lead times can be kept low, but this is heavily influenced by the storage location assignment in the warehouse, the routing, and the warehouse layout. The objective of this research is to investigate in what cases and to what extent reassignment and repositioning tasks following efficiency deterioration as well as seek answers to how to minimise these costly tasks and maintain a near-ideal storage location assignment. To solve this problem, an intelligent system concept is presented, which aims to support the warehouse operator in making replenishment decisions, which picking storage to replenish based on the current rotation of item, and which products to repositioning, while maintaining a near ideal storage location assignment. The aim of this paper is to highlight the potential decision points and circumstances, when adaptive storage location reassignment would be necessary and how this concept can help everyday warehouse logistics.

Open Access: Yes

DOI: 10.1504/IJLSM.2025.148067

An assessment of traffic education and its examination system—an extended House of Quality approach

P. Földesi Boglárka Eisingerné Balassa László Buics Zsolt Csaba Horváth

Publication Name: Humanities and Social Sciences Communications

Publication Date: 2024-12-01

Volume: 11

Issue: 1

Page Range: Unknown

Description:

The goal of this article is to examine traffic education and its examination system, using a new approach based on the House of Quality method. While every country has its own legal rules and requirements regarding how traffic education and examinations are conducted, there is a direct relationship between traffic education, its examination system and road safety. Therefore the quality of such a complicated process is of great interest for both stakeholders: the authorities and the citizens. These stakeholders both have their own objectives regarding the system, consequently increasing its complexity. This article investigates, as its case study, the system in Hungary. The House of Quality method has been expanded to provide a unique approach to examine the goals and objectives of both stakeholders, revealing similarities and differences and their interrelationships. Secondary data on the effectiveness of the traffic education and examination system are also analysed. Based on the HOQ model representations of the goals and objectives of the stakeholders regarding the traffic education and exam system, it can be established that the stakeholder points of view are closer to each other in the case of the test system than that of the education system. However, there are unsolved contradictions between the stakeholders that have to be handled, as opinions regarding the quality of the service and the criteria of the stakeholders’ satisfaction are very diverse.

Open Access: Yes

DOI: 10.1057/s41599-023-02553-6

An Efficient Tour Construction Heuristic for Generating the Candidate Set of the Traveling Salesman Problem with Large Sizes

P. Földesi Boldizsar Tuu-Szabo L. T. Koczy

Publication Name: Mathematics

Publication Date: 2024-10-01

Volume: 12

Issue: 19

Page Range: Unknown

Description:

In this paper, we address the challenge of creating candidate sets for large-scale Traveling Salesman Problem (TSP) instances, where choosing a subset of edges is crucial for efficiency. Traditional methods for improving tours, such as local searches and heuristics, depend greatly on the quality of these candidate sets but often struggle in large-scale situations due to insufficient edge coverage or high time complexity. We present a new heuristic based on fuzzy clustering, designed to produce high-quality candidate sets with nearly linear time complexity. Thoroughly tested on benchmark instances, including VLSI and Euclidean types with up to 316,000 nodes, our method consistently outperforms traditional and current leading techniques for large TSPs. Our heuristic’s tours encompass nearly all edges of optimal or best-known solutions, and its candidate sets are significantly smaller than those produced with the POPMUSIC heuristic. This results in faster execution of subsequent improvement methods, such as Helsgaun’s Lin–Kernighan heuristic and evolutionary algorithms. This substantial enhancement in computation time and solution quality establishes our method as a promising approach for effectively solving large-scale TSP instances.

Open Access: Yes

DOI: 10.3390/math12192960

Area of Interest Tracking Techniques for Driving Scenarios Focusing on Visual Distraction Detection

P. Földesi György Istenes Viktor Nagy

Publication Name: Applied Sciences Switzerland

Publication Date: 2024-05-01

Volume: 14

Issue: 9

Page Range: Unknown

Description:

On-road driving studies are essential for comprehending real-world driver behavior. This study investigates the use of eye-tracking (ET) technology in research on driver behavior and attention during Controlled Driving Studies (CDS). One significant challenge in these studies is accurately detecting when drivers divert their attention from crucial driving tasks. To tackle this issue, we present an improved method for analyzing raw gaze data, using a new algorithm for identifying ID tags called Binarized Area of Interest Tracking (BAIT). This technique improves the detection of incidents where the driver’s eyes are off the road through binarizing frames under different conditions and iteratively recognizing markers. It represents a significant improvement over traditional methods. The study shows that BAIT performs better than other software in identifying a driver’s focus on the windscreen and dashboard with higher accuracy. This study highlights the potential of our method to enhance the analysis of driver attention in real-world conditions, paving the way for future developments for application in naturalistic driving studies.

Open Access: Yes

DOI: 10.3390/app14093838

Developing sustainable logistic strategies in the context of cognitive biases

P. Földesi Eszter Sós

Publication Name: Infocommunications Journal

Publication Date: 2024-01-01

Volume: Unknown

Issue: Unknown

Page Range: 110-118

Description:

Cognitive biases often occur even in the decision-making process of highly qualified company managers due to the drive for efficiency and time pressure in operations. At the same time, there are also long-term strategic decisions where time pressure is no longer a factor, and yet cognitive bias appears, which has to be considered properly. In strategic issues, decision- makers tend to see their wishes and desires rather than the objective reality. The proposed system of fuzzy indicators based on technical and objective data supports decision-making between logistics strategies by mitigating cognitive biases, which is extremely important in the logistics field, where the decisions have to be made partly based on subjective, vague, or uncertain parameters.

Open Access: Yes

DOI: 10.36244/ICJ.2024.5.13

Calibration of Two Novel Segmentation Approaches by Synthetic Road Vehicle Vibrations

P. Földesi László Róbert Hári

Publication Name: Tehnicki Vjesnik

Publication Date: 2024-01-01

Volume: 31

Issue: 6

Page Range: 2094-2101

Description:

Simulation of non-stationary random vibrations has motivated Packaging vibration testing for decades. Often, an event-detection algorithm decomposes Road vehicle vibrations when analyzing the recorded series. However, heuristics and subjective justifications are often in the papers, whereby the foremost concern is the validation of the non-stationarity of simulated signals. Furthermore, if a changepoint detection is inherent to the procedure, it is recommended to calibrate the detector. The current paper concerns the Receiver operating characteristics (ROC) of two novel algorithms and provides contextual support by Segment length distributions (SLD).

Open Access: Yes

DOI: 10.17559/TV-20220114115149

Assessing and evaluating potential systems resilience

P. Földesi Eszter Sós Borbála Tamás

Publication Name: 2024 IEEE 15th International Conference on Cognitive Infocommunications Coginfocom 2024

Publication Date: 2024-01-01

Volume: Unknown

Issue: Unknown

Page Range: 43-50

Description:

The hierarchy of semantic networks can also be observed in the functioning of economic systems. There are uncertainties in semantic networks, meaning that the classification of different attributes is not always clear. The same uncertainty is also present, for example, in the design of logistics strategies as a sub-strategy of the economy, which can lead to inconsistencies between the parameters of the system. It is important for a system to be resilient to both internal and external influences, and it is, therefore, necessary to develop a hierarchy of system parameters based on the semantic network's method and to examine the relationship between parameters in order to achieve resilience and long-term sustainability.

Open Access: Yes

DOI: 10.1109/CogInfoCom63007.2024.10894735

A Risk Assessment Technique for Energy-Efficient Drones to Support Pilots and Ensure Safe Flying

P. Földesi Szabolcs Fischer Mykola Sysyn Dmytro Kurhan Szabolcs Kocsis Szurke Norbert Perness

Publication Name: Infrastructures

Publication Date: 2023-04-01

Volume: 8

Issue: 4

Page Range: Unknown

Description:

Unmanned Aerial Vehicles, also known as UAVs, play an increasingly important part in daily life. However, the ever-increasing number of UAVs pose an ever-increasing threat to the transportation infrastructure. Despite their precision and general efficiency, infrastructural-scale Unmanned Aerial Systems (UASs) have a disadvantage regarding their capability of being implanted in the ecosystem. There are several reasons for this, but the primary bottleneck is that their systems are not transparent to society and have very complicated processes. As a result, the authors decided to investigate the functional properties of UASs and make improvements to those properties. Throughout the study, the authors’ primary focus was on analysis, which boosts productivity and ensures a significant level of safety for routine flights. The amount of power that a UAV uses depends on several variables, including the amount of power that its individual components require, the temperature of its surroundings, and the condition of the battery that it is powered by. Therefore, critical parameters and interdependencies are taken into account in the risk assessment strategy for energy-efficient Unmanned Aerial Vehicles (UAVs). In the case of UAVs, the algorithm performs a risk calculation before take-off to estimate the amount of risk that can be associated with the given flight time when using the provided battery. On the one hand, several instances of the pre-take-off state and how its parameters interact are investigated. On the other hand, they demonstrate the calculation of the risk while in flight, which is based on actual flight data.

Open Access: Yes

DOI: 10.3390/infrastructures8040067

Testing Road Vehicle User Interfaces Concerning the Driver’s Cognitive Load

P. Földesi Szabolcs Fischer Szabolcs Szalai Mykola Sysyn Gábor Kovács Dmytro Kurhan Viktor Nagy

Publication Name: Infrastructures

Publication Date: 2023-03-01

Volume: 8

Issue: 3

Page Range: Unknown

Description:

This paper investigates the usability of touch screens used in mass production road vehicles. Our goal is to provide a detailed comparison of conventional physical buttons and capacitive touch screens taking the human factor into account. The pilot test focuses on a specific Non-driving Related Task (NDRT): the control of the on-board climate system using a touch screen panel versus rotating knobs and push buttons. Psychological parameters, functionality, usability and, the ergonomics of In-Vehicle Information Systems (IVIS) were evaluated using a specific questionnaire, a system usability scale (SUS), workload assessment (NASA-TLX), and a physiological sensor system. The measurements are based on a wearable eye-tracker that provides fixation points of the driver’s gaze in order to detect distraction. The closed road used for the naturalistic driving study was provided by the ZalaZONE Test Track, Zalaegerszeg, Hungary. Objective and subjective results of the pilot study indicate that the control of touch screen panels causes higher visual, manual, and cognitive distraction than the use of physical buttons. The statistical analysis demonstrated that conventional techniques need to be complemented in order to better represent human behavior differences.

Open Access: Yes

DOI: 10.3390/infrastructures8030049

Evaluation of a CUSUM-Type Changepoint Detector Applied in the Time-Frequency Domain of Synthetic Road Vehicle Vibrations

P. Földesi László Róbert Hári

Publication Name: Lecture Notes in Mechanical Engineering

Publication Date: 2023-01-01

Volume: Unknown

Issue: Unknown

Page Range: 812-823

Description:

Non-stationary random vibrations gained increasing interest in vibration testing. Often, a changepoint detection procedure handles the decomposition of Road vehicle vibrations (RVV) when analysing the recorded series. Unfortunately, only subjective justifications support the proposed methods, and mainly the validation of the non-stationarity of simulated signals is concerned. Thus, if a detector is inherent to the procedure, it is also recommended to calibrate it. The current paper concerns the Receiver operating characteristics (ROC) of a CUSUM-type algorithm and supplies contextual support by Segment length distributions (SLD).

Open Access: Yes

DOI: 10.1007/978-3-031-15211-5_67

Car Simulator Study for the Development of a Bring-Your-Own-Device (BYOD) Dashboard Concept

P. Földesi Gábor Kovács Viktor Nagy Ágoston Pál Sándor

Publication Name: Chemical Engineering Transactions

Publication Date: 2023-01-01

Volume: 107

Issue: Unknown

Page Range: 415-420

Description:

In-Vehicle Information Systems (IVIS) have evolved with the integration of advanced technologies like touchscreens, enhancing vehicle functionality and infotainment features. However, the development of sustainable and user-centric dashboard interfaces embracing the Bring-Your-Own-Device (BYOD) concept remains limited. This research aims to explore the usability, advantages, and disadvantages of the BYOD concept within the context of IVIS. Specifically, it investigated the control of the onboard air conditioning system and selected Advanced Driver Assistance System (ADAS) functions. To accomplish this, a complex simulation environment using Unity, Blender, and C# was developed. Eye-tracking technology was utilized to record participants' gaze patterns and attention allocation during experimental tasks. Following the simulation, participants provided subjective usability assessments of the system through questionnaires. The integration of a mobile phone with a suitable user interface as part of the BYOD concept generally led to enhanced usability and reduced distraction. This study underscores the potential benefits of integrating the BYOD concept into IVIS, emphasizing improved usability, sustainability, and user-friendliness. These findings hold significance for advancing the design of user-centric, sustainable interfaces in automotive technology.

Open Access: Yes

DOI: 10.3303/CET23107070

Effects of Cognitive Biases and Their Fuzzy Measure During Freight Transportation

P. Földesi Adrián Horváth Eszter Sós

Publication Name: Lecture Notes in Logistics

Publication Date: 2023-01-01

Volume: Unknown

Issue: Unknown

Page Range: 29-43

Description:

Cognitive biases affect all aspects of our lives, including the decision-making process related to the routing of freight transport. In the process of using human-machine systems, people upload rational and objective algorithms in order to obtain the best possible results in the route planning process. Nevertheless, during the route choice process, human reasoning, based on experience and assumptions, overrides the choice of the machine, that is, cognitive biases appear in the decision-making processes. For this reason, we investigate how an objective system of interests becomes a cognitive bias during the process of making decisions related to the route choice of freight transport by motor vehicle. Furthermore, we present a methodology to estimate fuzzy measures of route-related deviations concerning time and distance, which may be indicative of the emergence of cognitive biases.

Open Access: Yes

DOI: 10.1007/978-3-031-28236-2_3

Application of the QFD Technique Method in Logistics Strategy

P. Földesi Eszter Sós

Publication Name: Acta Polytechnica Hungarica

Publication Date: 2023-01-01

Volume: 20

Issue: 2

Page Range: 145-164

Description:

One of the most significant corporate challenges today is to meet customer expectations. In order for customer satisfaction to be achieved, it is necessary to review the entire corporate system and related processes and coordinate the various corporate strategies. In the recent past, it was widely regarded as sufficient by managers to develop the right marketing strategy in order to sell a product. However, there is currently a discussion as to whether a marketing logistics strategy as a well-designed logistics environment is needed to sell the product and thereby gain customer satisfaction. In this article, we present the Quality Function Deployment (QFD) technique, an effective tool for transforming consumer needs into technical, quality characteristics. The method of QFD technique can also be successfully applied in the field of logistics. Utilizing it ensures the possibility of examining the impact of the sub-areas and processes of marketing and logistics services on the basis of customer needs. In addition, visual control can be used to illustrate that whilst two products require the same logistics strategy, lead times already cause significant differences in the interaction of logistics processes and technological parameters. The analysis also highlights the shortcomings of the logistics environment, thereby supporting the decision-making of the company management in both marketing and logistics strategy planning.

Open Access: Yes

DOI: 10.12700/APH.20.2.2023.2.8

Application of Fuzzy Theory to Investigate the Effect of Innovation Power in the Emergence of an Advanced Reusable Packaging System

Ádám Bukovics P. Földesi A. Buruzs Péter Böröcz L. T. Koczy

Publication Name: Fuzzy Systems Modeling in Environmental and Health Risk Assessment

Publication Date: 2023-01-01

Volume: Unknown

Issue: Unknown

Page Range: 299-307

Description:

In this chapter, the authors present a novel technique to analyze the role of subjective factors such as innovations in the economy that influence the design of reusable packaging systems in a given industrial region. The focus of this chapter is on the power of innovation, which is not a directly measurable unit. Nowadays, with modern supply chains, companies and packaging engineers have to determine what constitutes adequate packaging with optimal waste. These decisions are usually based on known data and information, but the goal now is to create packaging that has a more favorable environmental impact than before. It seems obvious that more advanced regions will create more advanced packaging systems, but either way having an innovative milieu is a necessary prerequisite of this. This chapter shows that a willingness to innovate is an indispensable requirement of the design of advanced packaging and that most of the time this depends on the synergic effect of local production factors and regional peculiarities.

Open Access: Yes

DOI: 10.1002/9781119569503.ch16

An Approach for Hierarchical Clustering of Road Vehicle Vibration Spectrums

P. Földesi László Róbert Hári

Publication Name: Lecture Notes in Mechanical Engineering

Publication Date: 2023-01-01

Volume: Unknown

Issue: Unknown

Page Range: 799-811

Description:

Research on the non-stationary nature of road vehicle vibrations (RVV) led to advances in simulating such processes. Contemporary methods introduced for the analysis of RVV primarily aimed at partitioning the signal in the time- or time − frequency domain, providing differing segments of a signal. However, a degree of dissimilarity, or conversely similarity, is still challenging to find. Hereunder we argue that in some cases, merely a statement of dissimilarity between neighbouring segments within a signal might be well-enough, though from a broader perspective, the assessment of the similarity of discrete Fourier transforms (DFT) may be the next practical step forward. For this reason, the current paper presents the hierarchical clustering of elements of the short-time Fourier transform (STFT) plane from an RVV measurement; secondly, it introduces a clustering validation metric to arrive at an optimum distance metric and a threshold to use in binary hierarchical clusters.

Open Access: Yes

DOI: 10.1007/978-3-031-15211-5_66

Experiments with the Discrete Bacterial Memetic Evolutionary Algorithm for Solving the Cumulative Capacitated Vehicle Routing Problem

P. Földesi Boldizsar Tuu-Szabo L. T. Koczy

Publication Name: Studies in Computational Intelligence

Publication Date: 2023-01-01

Volume: 1040

Issue: Unknown

Page Range: 87-92

Description:

In this paper we present our initial experiments with the Discrete Bacterial Memetic Evolutionary Algorithm for solving the Cumulative Capacitated Vehicle Routing Problem. The algorithm was tested on instances proposed in the literature. However our method was able to find the optimal solution for small (around 50 nodes) instances, but its convergence speed is low. In the last section some of our ideas to improve the performance of the algorithm were presented.

Open Access: Yes

DOI: 10.1007/978-3-031-07707-4_11

Assessing logistics strategy issues under cognitive biases

P. Földesi Eszter Sós

Publication Name: 2023 14th IEEE International Conference on Cognitive Infocommunications Coginfocom 2023

Publication Date: 2023-01-01

Volume: Unknown

Issue: Unknown

Page Range: 141-146

Description:

Cognitive biases often appear in the decision-making process of highly qualified managers of companies because of the drive for efficiency and the time pressure in operation. There are also long-term strategic decisions where there is no longer time pressure, and yet cognitive bias appears, for example during the selection between the Push and Pull systems in logistics. The description of the actual situation has to be quantified because communication between human-machine systems, as defined in cognitive info-communication, is only viable if cognitive biases in decision-making can be considered properly. We propose fuzzy approach and measures that can assess whether the production uses a Push or Pull logistics strategy for a specific product or for the entire company.

Open Access: Yes

DOI: 10.1109/CogInfoCom59411.2023.10397543

Hierarchical Diagnostics and Risk Assessment for Energy Supply in Military Vehicles

P. Földesi Szabolcs Kocsis Szurke Dániel Csikor Ferenc Szauter L. T. Koczy

Publication Name: Energies

Publication Date: 2022-07-01

Volume: 15

Issue: 13

Page Range: Unknown

Description:

Hybrid vehicles are gaining increasing global prominence, especially in the military, where unexpected breakdowns or even power deficits are not only associated with greater expense but can also cost the lives of military personnel. In some cases, it is extremely important that all battery cells and modules deliver the specified amount of capacity. Therefore, it is recommended to introduce a new measurement line of rapid diagnostics before deployment, in addition to the usual procedures. Using the results of rapid testing, we recommend the introduction of a hierarchical three-step diagnostics and assessment procedure. In this procedure, the key factor is the building up of a hierarchical tree-structured fuzzy signature that expresses the partial interdependence or redundancy of the uncertain descriptors obtained from the rapid tests. The fuzzy signature structure has two main important components: the tree structure itself, and the aggregations assigned to the internal nodes. The fuzzy signatures that are thus determined synthesize the results from the regular maintenance data, as well as the effects of the previous operating conditions and the actual state of the battery under examination; a signature that is established this way can be evaluated by “executing the instructions” coded into the aggregations. Based on the single fuzzy membership degree calculated for the root of the signature, an overall decision can be made concerning the general condition of the batteries.

Open Access: Yes

DOI: 10.3390/en15134791

Fuzzy QFD assessment of logistics coherence

P. Földesi Eszter Sós

Publication Name: 2022 IEEE 6th International Conference on Logistics Operations Management Gol 2022

Publication Date: 2022-01-01

Volume: Unknown

Issue: Unknown

Page Range: Unknown

Description:

Accomplishing purchaser compliance is one of the significant corporate challenges of our time. All products are sold together with the associated logistics service, so it is important that the logistics environment of a company is properly designed in order to meet the objectives of the logistics strategy. In this paper, we present the combined application of Fuzzy system and Quality Function Deployment (QFD) techniques, which are already used effectively in many areas to study sub-processes. Generally, input values are determined as a fuzzy number, in this paper we use fuzzy to evaluate the values. In addition, we have developed a system to examine the compatibility of specific strategic tools and objectives with each other and the usefulness of specific elements for both the customer and the service provider. Using the new approach analysis, we developed a Fuzzy QFD assessment method, we can examine the coherence of logistics processes and technological parameters based on customer needs by comparing different options and alternative solutions. The analysis sheds light on the internal coherence of logistics strategies, thereby clarifying whether the aims that the company has defined can be achieved with the available, planned tools.

Open Access: Yes

DOI: 10.1109/GOL53975.2022.9820009

Analyzing the Performance of TSP Solver Methods

P. Földesi Boldizsar Tuu-Szabo L. T. Koczy

Publication Name: Studies in Computational Intelligence

Publication Date: 2022-01-01

Volume: 955

Issue: Unknown

Page Range: 65-71

Description:

In this paper we analyze the efficiency of three TSP solver methods: the best-performing exact Concorde algorithm, the state-of-the-art inexact Helsgaun’s Lin–Kernighan heuristic and our Discrete Bacterial Memetic Evolutionary Algorithm (DBMEA). In our analysis the run time predictability was also taken into account, not only the tour quality and the run time properties. Three models (polynomial, exponential, square-root exponential) were fitted to the mean run times of VLSI (Very-large-scale integration) instances up to 20,000 nodes. The DBMEA produces the highest (close to 1) R2-values for each model. The Concorde algorithm shows very low run time predictability.

Open Access: Yes

DOI: 10.1007/978-3-030-88817-6_8

Comparison of Discrete Memetic Evolutionary Metaheuristics for TSP

P. Földesi Boldizsar Tuu-Szabo Gergő Fogarasi L. T. Koczy

Publication Name: Studies in Computational Intelligence

Publication Date: 2022-01-01

Volume: 955

Issue: Unknown

Page Range: 29-37

Description:

In our paper we compare discrete memetic evolutionary metaheuristics (and other algorithms) which are applicable (also) for the widely studied and industrially applied (symmetric, Euclidean) NP-hard combinatorial optimization problem called Traveling Salesman Problem (TSP) such as DBMEA (Discrete Bacterial Memetic Evolutionary Algorithm), DMTLBO (Discrete Memetic Teaching–Learning Based Optimization) not to mention DMSSA (Discrete Memetic Squirrel Search Algorithm) algorithms. The comparisons occurred under the same fixed conditions.

Open Access: Yes

DOI: 10.1007/978-3-030-88817-6_4

Local Binary Pattern-Based Fingerprint Matching

P. Földesi Boldizsar Tuu-Szabo Gábor Kovács L. T. Koczy Szilvia Nagy

Publication Name: Studies in Computational Intelligence

Publication Date: 2022-01-01

Volume: 959

Issue: Unknown

Page Range: 183-188

Description:

In this paper we propose an image-based fingerprint recognition system. The method is based on Local Binary Pattern features extracted from the region of the fingerprint image around the core point. The experiments on the FVC2002 fingerprint databases show the effectiveness of the proposed approach.

Open Access: Yes

DOI: 10.1007/978-3-030-74970-5_21

The Role of Hungarian Traffic Rules Education and Examination System – a Quality Function Deployment Approach

P. Földesi Boglárka Eisingerné Balassa László Buics Zsolt Csaba Horváth

Publication Name: Acta Polytechnica Hungarica

Publication Date: 2022-01-01

Volume: 19

Issue: 7

Page Range: 7-26

Description:

This paper examines the traffic rules education and examination system in Hungary, by using the Quality Function Deployment (QFD) method, as a new approach towards this complex topic. The education and examination of traffic rules are necessary for the stakeholders, but they have slightly different goals and objectives. This system has two separate stakeholders, the citizens and the authority, with their own set of goals, objectives, desires and ideas, about this system. The QFD reveals the connections between these layers. The paper analyses statistical data regarding road safety and presents the QFD model of both stakeholders and their inter-connections. The results of this work can be used to redesign education and examination methods, during the application of digitalized e-government solutions and as a general approach to match individual and public interests.

Open Access: Yes

DOI: DOI not available

Examination of online education experiences from stakeholder perspective a Hungarian case study

P. Földesi Orsolya Putz Boglárka Eisingerné Balassa László Buics Zsolt Csaba Horváth Zoltán Varjú

Publication Name: International Conference on Higher Education Advances

Publication Date: 2022-01-01

Volume: 2022-June

Issue: Unknown

Page Range: 159-167

Description:

With the rise of Covid-19, higher education has undergone a major transformation. Prior to the pandemic, many universities offered online courses, but the majority of universities were characterized by face-To-face teaching. The goal of this research is to find out students' and teachers' opinions on the online education introduced in the first phase of Covid, with the help of a survey. As teachers had to react very quickly to the situation, the research would like to assess what worked well and what didn't during the online education period, what is in the focus of positive and negative opinions. The aim of this survey is to get feedback from students and faculty members regarding their experiences with online education during Covid.

Open Access: Yes

DOI: 10.4995/HEAd22.2022.14601

The impact of marketing strategy on logistics decisions and the implementation of JIT

P. Földesi Eszter Sós

Publication Name: Acta Technica Jaurinensis

Publication Date: 2021-11-24

Volume: 14

Issue: 4

Page Range: 364-376

Description:

Marketing has a significant impact on logistics systems and corporate performance, so it is nowadays necessary to define a marketing logistics strategy in the lives of larger companies so that logistics decisions are not distorted by the marketing strategy. According to the current direction of development, smaller and smaller quantities of goods are constantly being moved, with ever shorter deadlines. Therefore, companies prefer to use the Just In Time (JIT) system, which results in a gradual reduction in inventory costs, but increases the burden on the environment. In this article, we analyze the interaction between marketing and logistics and the logistics environment required to implement a JIT system. For research we have used the matrix of Quality Function Deployment (QFD) technique to evaluate the needs of the customer with respect to the JIT system, thus clarifying the logistics strategy applicable to the introduction of the specific product.

Open Access: Yes

DOI: 10.14513/actatechjaur.00597

Fuzzy approach for the decision on disposable or returnable packaging

P. Földesi Péter Böröcz Kata Vöröskoi L. T. Koczy

Publication Name: Sustainability Switzerland

Publication Date: 2020-09-01

Volume: 12

Issue: 18

Page Range: Unknown

Description:

In modern logistics, companies and packaging engineers have to make decisions to find the optimal sustainable product-packaging system with adequate protection. The decision most often involves a decision option between disposable (single-trip) and reusable (returnable) packaging solutions. In practice, in most cases, this decision is based on historical data and traditions and only considers the packaging material and investment expenses. Although cost is an important factor, it is not the only one needed to find the optimal solution. Several other alternative factors further complicate the situation. Traditional (two-valued) logic is not able to model this problem. This study presents a novel technique to help the decision-making process using the application of fuzzy approach. The authors used three different fuzzy signatures connected by fuzzy rules to model the packaging decisions, which were based on logistics expert opinions. Practical examples are presented concerning both customer packaging (primary packaging) and industrial transport packaging (secondary packaging) as well.

Open Access: Yes

DOI: 10.3390/SU12187304

Optimization of the time-dependent traveling salesman problem using interval-valued intuitionistic fuzzy sets

P. Földesi Boldizsar Tuu-Szabo Ruba Almahasneh L. T. Koczy

Publication Name: Axioms

Publication Date: 2020-06-01

Volume: 9

Issue: 2

Page Range: Unknown

Description:

This study proposes a new model and approach for solving a realistic extension of the Time-Dependent Traveling Salesman Problem, by using the concept of distance between interval-valued intuitionistic fuzzy sets. For this purpose, we developed an interval-valued fuzzy degree repository based on the relations between rush hour periods and traffic regions in the "city center areas", and then we utilized the interval-valued intuitionistic fuzzy weighted arithmetic average to aggregate fuzzy information to be able to quantify the delay in any given trip between two nodes (cities). The proposed method is illustrated by a simple numerical example.

Open Access: Yes

DOI: 10.3390/AXIOMS9020053

Extension of the Time Dependent Travelling Salesman Problem with Interval Valued Intuitionistic Fuzzy Model Applying Memetic Optimization Algorithm

P. Földesi Boldizsar Tuu-Szabo Ruba Almahasneh L. T. Koczy

Publication Name: ACM International Conference Proceeding Series

Publication Date: 2020-03-21

Volume: Unknown

Issue: Unknown

Page Range: 111-118

Description:

The Time Dependent Traveling Salesman Problem (TD TSP) is an extension of the classic Traveling Salesman Problem towards more realistic conditions. TSP is one of the most extensively studied NP-complete graph search problems. In TD TSP, the edges are assigned different weights, depending on whether they are traveled in the traffic jam regions (such as busy city centers) and during rush hour periods, or not. In such circumstances, edges are assigned higher costs, expressed by a multiplying factor. In this paper, we introduce a novel and even more realistic approach, the Interval Intuitionistic Fuzzy Time Dependent Traveling Salesman Problem (IVIFTD TSP); which is a further extension of the classic TD TSP, with the additional notion of deploying interval valued intuitionistic fuzzy for describing uncertainties. The core concept employs interval valued intuitionistic fuzzy sets for quantifying the traffic jam regions, and the rush hour periods loss (those are additional costs of the travel between nodes), which are always uncertain in real life. Since type-2 (such as inter valued) fuzzy sets have the potential to provide better performance in modeling problems with higher uncertainties than the traditional fuzzy set, the new approach it may be considered as an extended, practically more applicable, extended version of the original abstract problem. The optimization of such a complex model is obviously very difficult; it is a mathematically intractable problem. However, the Discrete Bacterial Memetic Evolutionary Algorithm proposed earlier by the authors' team has shown sufficient efficiency, general applicability for similar type problems and good predictability in terms of problem size, thus it is applied for the optimization of the concrete instances.

Open Access: Yes

DOI: 10.1145/3396474.3396490

Hierarchical fuzzy decision support methodology for packaging system design

P. Földesi A. Buruzs Kata Vöröskoi Gergő Fogarasi L. T. Koczy

Publication Name: Advances in Intelligent Systems and Computing

Publication Date: 2020-01-01

Volume: 945

Issue: Unknown

Page Range: 85-96

Description:

In the field of logistics packaging (industrial-, or even customer packaging), companies have to take decisions on determining the optimal packaging solutions and expenses. The decisions often involve a choice between one-way (disposable) and reusable (returnable) packaging solutions. Even nowadays, in most cases the decisions are made based on traditions and mainly consider the material and investment costs. Although cost is an important factor, it might not be sufficient for finding the optimal solution. Traditional (two-valued) logic is not suitable for modelling this problem, so here the application of a fuzzy approach, because of the metrical aspects, a fuzzy signature approach is considered. In this paper a fuzzy signature modelling the packaging decision is suggested, based on logistics expert opinions, in order to support the decision making process of choosing the right packaging system. Two real life examples are also given, one in the field of customer packaging and one in industrial packaging.

Open Access: Yes

DOI: 10.1007/978-3-030-18058-4_7

Fuzzy set based models comparative study for the td tsp with rush hours and traffic regions

P. Földesi Boldizsar Tuu-Szabo Ruba Almahasneh L. T. Koczy

Publication Name: Communications in Computer and Information Science

Publication Date: 2020-01-01

Volume: 1238 CCIS

Issue: Unknown

Page Range: 699-714

Description:

This study compares three fuzzy based model approaches for solving a realistic extension of the Time Dependent Traveling Salesman Problem. First, the triple Fuzzy (3FTD TSP) model, where the uncertain costs between the nodes depend on time are expressed by fuzzy sets. Second, the intuitionistic fuzzy (IFTD TSP) approach, where including hesitation was suitable for quantifying the jam regions and the bimodal rush hour periods during the day. Third, the interval-valued intuitionistic fuzzy sets model, that calculates the interval-valued intuitionistic fuzzy weighted arithmetic average (IIFWAA) of the edges’ confirmability degrees and non-confirmability degrees, was contributing in minimizing the information loss in cost (delay) calculation between nodes.

Open Access: Yes

DOI: 10.1007/978-3-030-50143-3_55

Three level fuzzy signature based decision methodology for packaging system design

P. Földesi A. Buruzs Kata Vöröskoi Gergő Fogarasi L. T. Koczy

Publication Name: Journal of Automation Mobile Robotics and Intelligent Systems

Publication Date: 2020-01-01

Volume: 14

Issue: 2

Page Range: 99-105

Description:

In the field of logistics packaging, companies have to take decisions on determining the optimal packaging solutions and expenses. The decisions often involve a choice between one-way (disposable) and reusable (returnable) packaging solutions. Even nowadays, in most cases the decisions are made based on traditions and mainly consider the material and investment costs. Although cost is an important factor, it might not be sufficient for finding the optimal solution. Traditional (two-valued) logic is not suitable for modelling this problem, so here the application of a fuzzy approach, because of the metrical aspects, a fuzzy signature approach is considered. In this paper three different fuzzy signatures connected by fuzzy rules modelling the packaging decision are suggested, based on logistics expert opinions, in order to support the decision making process of choosing the right packaging system. Two real life examples are also given, one in the field of customer packaging and one in industrial packaging.

Open Access: Yes

DOI: 10.14313/JAMRIS/2-2020/25

Quasi-Optimization of the Time Dependent Traveling Salesman Problem by Intuitionistic Fuzzy Model and Memetic Algorithm

P. Földesi Boldizsar Tuu-Szabo Ruba Almahasneh L. T. Koczy

Publication Name: Studies in Computational Intelligence

Publication Date: 2020-01-01

Volume: 872

Issue: Unknown

Page Range: 239-253

Description:

The Traveling Salesman Problem (TSP) is an NP-hard graph search problem. Despite having numerous modifications of the original abstract problem, Time Dependent Traveling Salesman Problem (TD TSP) was one of the most realistic extensions under real traffic conditions. In TD TSP the edges between nodes are assigned higher costs (weights), if they were traveled during the rush hour periods, or crossed the traffic jam regions, such as the city center(s). In this paper we introduce an even more real-life motivated approach, the Intuitionistic Fuzzy Time Dependent Traveling Salesman Problem (IFTD TSP), which is a further extension of the TSP, and also of the classic TD TSP, with the additional notion of using intuitionistic fuzzy sets for the definition of uncertain costs, time, and space of the rush hour—traffic jam region affecting graph sections. In IFTD TSP we use fuzzy memberships and non-memberships sets for estimating the vague costs between nodes in order to quantify the behavior of traffic jam regions, and the rush hour periods. Since intuitionistic fuzzy sets are generalizations of classic fuzzy sets, our approach may be considered an extension and substitution of the original abstract TD TSP problem, even, of the (classic) Fuzzy TD TSP. Lastly, DBMEA (Discrete Bacterial Memetic Evolutionary Algorithm) was applied on the IFTD TSP model, the results of the simulation runs based on some extensions of the benchmarks generated from the original TD TSP data set showed quite good and promising preliminary results.

Open Access: Yes

DOI: 10.1007/978-3-030-34409-2_14

A memetic version of the bacterial evolutionary algorithm for discrete optimization problems

P. Földesi Boldizsar Tuu-Szabo L. T. Koczy

Publication Name: Advances in Intelligent Systems and Computing

Publication Date: 2020-01-01

Volume: 945

Issue: Unknown

Page Range: 44-55

Description:

In this paper we present our test results with our memetic algorithm, the Discrete Bacterial Memetic Evolutionary Algorithm (DBMEA). The algorithm combines the Bacterial Evolutionary Algorithm with discrete local search techniques (2-opt and 3-opt). The algorithm has been tested on four discrete NP-hard optimization problems so far, on the Traveling Salesman Problem, and on its three variants (the Traveling Salesman Problem with Time Windows, the Traveling Repairman Problem, and the Time Dependent Traveling Salesman Problem). The DBMEA proved to be efficient for all problems: it found optimal or close-optimal solutions. For the Traveling Repairman Problem the DBMEA outperformed even the state-of-the-art methods. The preliminary version of this paper was presented at the 3rd Conference on Information Technology, Systems Research and Computational Physics, 2–5 July 2018, Cracow, Poland [1].

Open Access: Yes

DOI: 10.1007/978-3-030-18058-4_4

An efficient evolutionary metaheuristic for the traveling repairman (Minimum latency) problem

P. Földesi Boldizsar Tuu-Szabo L. T. Koczy

Publication Name: International Journal of Computational Intelligence Systems

Publication Date: 2020-01-01

Volume: 13

Issue: 1

Page Range: 781-793

Description:

In this paper we revisit the memetic evolutionary family of metaheuristics, called Discrete Bacterial Memetic Evolutionary Algorithm (DBMEA), whose members combine Furuhashi’s Bacterial Evolutionary Algorithm and various discrete local search techniques. These algorithms have proven to be efficient approaches for the solution of NP-hard discrete optimization problems such as the Traveling Salesman Problem (TSP) with Time Windows. This paper presents our results in solving the Traveling Repairman Problem (also called Minimum Latency Problem) with a DBMEA variant. The results are compared with state-of-the-art heuristics found in the literature. The DBMEA in most cases turned out to be faster than all other methods, and for the bigger benchmark instances it was also found to have better solutions than the former best-known results. Based on these test results we claim to have found the best approach and thus we suggest the use of the DBMEA for the Traveling Repairman Problem, especially for large instances.

Open Access: Yes

DOI: 10.2991/ijcis.d.200529.001

The discrete bacterial memetic evolutionary algorithm for solving the one-commodity pickup-and-delivery traveling salesman problem

P. Földesi Boldizsar Tuu-Szabo L. T. Koczy

Publication Name: Studies in Computational Intelligence

Publication Date: 2020-01-01

Volume: 819

Issue: Unknown

Page Range: 15-22

Description:

In this paper we propose a population based memetic algorithm, the Discrete Bacterial Memetic Evolutionary Algorithm for solving the one-commodity Pickup-and-Delivery Traveling Salesman Problem. The algorithm was tested on benchmark instances up to 100 nodes, and the results were compared with the state-of-the art methods in the literature. For all instances the DBMEA found optimal or close-optimal solutions.

Open Access: Yes

DOI: 10.1007/978-3-030-16024-1_3

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

P. Földesi Boldizsar Tuu-Szabo Ruba Almahasneh L. T. Koczy

Publication Name: IEEE International Conference on Fuzzy Systems

Publication Date: 2019-06-01

Volume: 2019-June

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

Identification and dynamic analysis of crime hot-spots in Hungary by a complex Computer Intelligence approach

P. Földesi Boldizsar Tuu-Szabo Gábor Kovács Gergő Fogarasi L. T. Koczy Szilvia Nagy

Publication Name: Ines 2019 IEEE 23rd International Conference on Intelligent Engineering Systems Proceedings

Publication Date: 2019-04-01

Volume: Unknown

Issue: Unknown

Page Range: 247-252

Description:

In the field of forensic science, crime maps are widely used. The representation of the data and analysis could offer some steps forward for crime prevention. Clustering is able to help identify criminal hot-spots and further analysis designate which require intervention. The aim of this study is to present a first step in the analysis of Hungary-related criminal information.

Open Access: Yes

DOI: 10.1109/INES46365.2019.9109437

Intuitionistic Fuzzy Model of Traffic Jam Regions and Rush Hours for the Time Dependent Traveling Salesman Problem

P. Földesi Boldizsar Tuu-Szabo Ruba Almahasneh L. T. Koczy

Publication Name: Advances in Intelligent Systems and Computing

Publication Date: 2019-01-01

Volume: 1000

Issue: Unknown

Page Range: 123-134

Description:

The Traveling Salesman Problem (TSP) is one of the most extensively studied NP-hard graph search problems. Many researchers published numerous approaches for quality solutions, applying various techniques in order to find the optimum (least cost) or semi optimum solution. Moreover, there are many different extensions and modifications of the original problem, The Time Dependent Traveling Salesman Problem (TD TSP) is a prime example. TD TSP indeed was one of the most realistic extensions of the original TSP towards assessment of traffic conditions [1]. Where the edges between nodes are assigned different cost (weight), considering whether they are traveled during the rush hour periods or they cross the traffic jam regions. In such conditions edges are assigned higher costs [1]. In this paper we introduce an even more realistic approach, the IFTD TSP (Intuitionistic Fuzzy Time Dependent Traveling Salesman Problem); which is an extension of the classic TD TSP with the additional notion of intuitionistic fuzzy sets. Our core concept is to employ intuitionistic fuzzy sets of the cost between nodes to quantify traffic jam regions, and the rush hour periods. Since the intuitionistic fuzzy sets are generalizations of the original fuzzy sets [2], then our approach is a usefully extended, alternative model of the original abstract problem. By demonstrating the addition of intuitionistic fuzzy elements to quantify the intangible jam factors and rush hours, and creating an inference system that approximates the tour cost in a more realistic way [3]. Since our motivation is to give a useful and practical alternative (extension) of the basic TD TSP problem, the DBMEA (Discrete Bacterial Memetic Evolutionary Algorithm) was used in order to calculate the (quasi-)optimum or semi optimum solution. DBMEA has been proven to be effective and efficient in a wide segment of NP-hard problems, including the original TSP and the TD TSP as well [4]. 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.1007/978-3-030-21920-8_12

Crime “hot-spots” identification and analysis in Hungary by computational intelligence

P. Földesi Boldizsar Tuu-Szabo Gábor Kovács Gergő Fogarasi L. T. Koczy Szilvia Nagy

Publication Name: Acta Polytechnica Hungarica

Publication Date: 2019-01-01

Volume: 16

Issue: 10

Page Range: 137-155

Description:

In the constantly growing and widening field of forensic science, crime maps are used in versatile ways. The representation of the data and analysis could offer some steps toward crime prevention and helps understand patterns, in terms of a timely distribution of crime types. Clustering is able to help identify criminal hot-spots and additional analysis may determine which areas require intervention. The aim of this study is to present an analysis of criminal information related to Hungary, in annual and monthly breakdown.

Open Access: Yes

DOI: 10.12700/APH.16.10.2019.10.9

Statistical Analysis of the Performance of the State-of-the-Art Methods for Solving TSP Variants

P. Földesi Boldizsar Tuu-Szabo L. T. Koczy

Publication Name: Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics

Publication Date: 2019-01-01

Volume: 11909 LNAI

Issue: Unknown

Page Range: 255-262

Description:

In this paper we analyze the efficiency of the state-of-the-art methods for solving two TSP variants, the Traveling Salesman Problem with Time Windows and one-commodity Pickup-and-Delivery Traveling Salesman Problem. Three models (polynomial, exponential, square-root exponential) were fitted to the mean run times of each method. The parameters of the curves, the R2-values and the RMSE values were compared.

Open Access: Yes

DOI: 10.1007/978-3-030-33709-4_23

A population based metaheuristic for the minimum latency problem

P. Földesi Boldizsar Tuu-Szabo L. T. Koczy

Publication Name: Studies in Computational Intelligence

Publication Date: 2019-01-01

Volume: 796

Issue: Unknown

Page Range: 113-121

Description:

In this paper we present a population based metaheuristic for solving the Minimum Latency Problem, which is the combination of bacterial evolutionary algorithm with local search techniques. The algorithm was tested on TSPLIB benchmark instances, and the results are competitive in terms of accuracy and runtimes with the state-of-the art methods. Except for two instances our algorithm found the best-known solution, and for the biggest tested instance it outperformed the best-known solution. The runtime was on average 30% faster than the most efficient method in the literature.

Open Access: Yes

DOI: 10.1007/978-3-030-00485-9_13

Enhanced discrete bacterial memetic evolutionary algorithm - An efficacious metaheuristic for the traveling salesman optimization

P. Földesi Boldizsar Tuu-Szabo L. T. Koczy

Publication Name: Information Sciences

Publication Date: 2018-09-01

Volume: 460-461

Issue: Unknown

Page Range: 389-400

Description:

In this paper we present a novel universal metaheuristic, Discrete Bacterial Memetic Evolutionary Algorithm (DBMEA), which is based on the combination of the Bacterial Evolutionary Algorithm and local search techniques, used for solving NP-hard optimization problems. The algorithm was tested on a series of symmetric Traveling Salesman Problems (TSP) and Traveling Salesman Problem with time windows (TSPTW) benchmarks. The size of the symmetric TSP benchmarks went up to 5 000 cities. In all cases the DBMEA algorithm produced optimal or near-optimal solutions and the difference from the known best values was within 0.16%. While for large size problems it was much faster than the Concorde solver, it was found to be slower compared to the Helsgaun-Lin-Kernighan heuristic, which is the most efficient TSP solver method. With some slight modifications the same algorithm was also tested on TSP with time windows (TSPTW) benchmark instances. In most cases the DBMEA procedure found the known best solutions, and it was again the second fastest method compared with the state-of-the-art techniques for the TSPTW. DBMEA is called efficacious because it is a universal method. It can be efficiently applied to various NP-hard optimization problems and, as in all cases, it results in the optimal or a very near-optimal solutions, while its runtime is very predictable in terms of the size of the problem, and the topology of the instance does not affect its runtime significantly. Even though heuristics developed for a particular type of problem might perform better for that restricted class, our novel method proposed here is universally applicable and may be deployed successfully for optimizing other discreet NP-hard graph search and optimization problems as well.

Open Access: Yes

DOI: 10.1016/j.ins.2017.09.069

A survey of the applications of fuzzy methods in recommender systems

P. Földesi Alex Tormási Brigita Sziová L. T. Koczy

Publication Name: Studies in Fuzziness and Soft Computing

Publication Date: 2018-01-01

Volume: 361

Issue: Unknown

Page Range: 483-495

Description:

In the past half century of fuzzy systems they were used to solve a wide range of complex problems, and the field of recommendation is no exception. The mathematical properties and the ability to efficiently process uncertain data enable fuzzy systems to face the common challenges in recommender systems. The main contribution of this paper is to give a comprehensive literature overview of various fuzzy based approaches to the solving of common problems and tasks in recommendation systems. As a conclusion possible new areas of research are discussed.

Open Access: Yes

DOI: 10.1007/978-3-319-75408-6_37

Discrete bacterial memetic evolutionary algorithm for the time dependent traveling salesman problem

P. Földesi Boldizsar Tuu-Szabo L. T. Koczy

Publication Name: Communications in Computer and Information Science

Publication Date: 2018-01-01

Volume: 853

Issue: Unknown

Page Range: 523-533

Description:

The Time Dependent Traveling Salesman Problem (TDTSP) that is addressed in this paper is a variant of the well-known Traveling Salesman Problem. In this problem the distances between nodes vary in time (are longer in rush hours in the city centre), Our Discrete Bacterial Evolutionary Algorithm (DBMEA) was tested on benchmark problems (on bier127 and on a self-generated problem with 250 nodes) with various jam factors. The results demonstrate the effectiveness of the algorithm.

Open Access: Yes

DOI: 10.1007/978-3-319-91473-2_45

Criticality analysis of purchased materials based on fuzzy signatures

P. Földesi Gabor Farkas L. T. Koczy

Publication Name: IEEE International Conference on Fuzzy Systems

Publication Date: 2017-08-23

Volume: Unknown

Issue: Unknown

Page Range: Unknown

Description:

Selecting and evaluating the suppliers represent a very complex task, because a wide range of attributions must be taken into consideration and many of them are difficult to be made objectively quantified. The aim of this research is to provide a new model based on fuzzy signatures for selecting and evaluating the critical parts for the production.

Open Access: Yes

DOI: 10.1109/FUZZ-IEEE.2017.8015649

An effective Discrete Bacterial Memetic Evolutionary Algorithm for the Traveling Salesman Problem

P. Földesi Boldizsar Tuu-Szabo L. T. Koczy

Publication Name: International Journal of Intelligent Systems

Publication Date: 2017-08-01

Volume: 32

Issue: 8

Page Range: 862-876

Description:

In recent years, a large number of evolutionary and other population-based heuristics were proposed in the literature. In 2009, we suggested to combine the very efficient bacterial evolutionary algorithm with local search as a new Discrete Bacterial Memetic Evolutionary Algorithm (DBMEA) (Farkas et al., In: Towards intelligent engineering & information technology, Studies in Computational Intelligence, Vol 243. Berlin, Germany: Springer-Verlag; 2009. pp 607–625). The method was tested on one of Traveling Salesman Problem (TSP) benchmark problems, and a difference was found between the real optimum calculated by the new and the published result because the Concorde and the Lin–Kernighan algorithm use an approximation substituting distances of points by the closest integer values. We modified the Concorde algorithm using real cost values to compare with our results. In this paper, we systematically investigate TSPLIB benchmark problems and other VLSI benchmark problems (http://www.math.uwaterloo.ca/tsp/vlsi/index.html) and compare the following values: optima found by the DBMEA heuristic and by the modified Concorde algorithm with real cost values, run times of DBMEA, modified Concorde, and Lin–Kernighan heuristic. In this paper, for the evaluation of metaheuristic techniques, we suggest the usage of predictability of the successful run in addition to the accuracy of the result and the computational cost as third property. We will show that in the case of DBMEA, the run time is more predictable than in the case of Concorde algorithm, so we suggest the use of DBMEA heuristic as very efficient for the solution of TSP and other nondeterministic polynomial-time hard optimization problems.

Open Access: Yes

DOI: 10.1002/int.21893

Welcome

P. Földesi Anna Esposito Tamas Mihalydeak P. Baranyi

Publication Name: 8th IEEE International Conference on Cognitive Infocommunications Coginfocom 2017 Proceedings

Publication Date: 2017-07-02

Volume: 2018-January

Issue: Unknown

Page Range: 3

Description:

No description provided

Open Access: Yes

DOI: 10.1109/CogInfoCom.2017.8268299

A population based metaheuristic for traveling salesman type problems

P. Földesi Boldizsar Tuu-Szabo L. T. Koczy

Publication Name: 2017 International Conference on Fuzzy Theory and Its Applications Ifuzzy 2017

Publication Date: 2017-03-09

Volume: 2017-November

Issue: Unknown

Page Range: 1-5

Description:

In this paper we present a metaheuristic method, called DBMEA. It combines the bacterial evolutionary algorithm with local search techniques. Based on our test results it can be used for solving efficiently more discrete optimization problems. The algorithm was tested on Traveling Salesman Problem and Traveling Repairman Problem (TRP) benchmark instances found in the literature. In the case of TSP the DBMEA algorithm produced optimal or near-optimal solutions for all tested instances. Although the most efficient TSP solver method, the Helsgaun's Lin-Kernighan heuristic was faster than DBMEA, but in the case of DBMEA the runtime was more predictable than it the case of other methods. In the case of TRP the results are competitive in terms of accuracy and runtimes with the state-of-the art methods. Except two instances our algorithm found the best-known solutions, and for the biggest tested instance it found new best solution. The runtime was on average 30% faster than the most efficient heuristic in the literature.

Open Access: Yes

DOI: 10.1109/iFUZZY.2017.8311797

An efficient new memetic method for the traveling salesman problem with time windows

P. Földesi Boldizsar Tuu-Szabo L. T. Koczy

Publication Name: Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics

Publication Date: 2017-01-01

Volume: 10607 LNAI

Issue: Unknown

Page Range: 426-436

Description:

In this paper we present a new memetic algorithm, which is called Discrete Bacterial Memetic Evolutionary Algorithm for solving the Traveling Salesman Problem with time windows (TSPTW). This method is the combination of bacterial evolutionary algorithm with 2-opt and 3-opt local searches. The algorithm was already tested on symmetric Traveling Salesman Problem (TSP) benchmark instances up to 5000 cities. It showed good properties in terms of tour lengths, runtimes and predictability of runtimes, so we decide to examine other variants of TSP with our algorithm. With some slight modifications our method was tested on TSP with time windows benchmark instances. Our test results were compared with the state-of-the art methods. In most cases our algorithm found the best-known solutions, and in terms of solution quality and runtime it is the second best method.

Open Access: Yes

DOI: 10.1007/978-3-319-69456-6_35

Improved discrete bacterial memetic evolutionary algorithm for the traveling salesman problem

P. Földesi Boldizsar Tuu-Szabo L. T. Koczy

Publication Name: Advances in Intelligent Systems and Computing

Publication Date: 2017-01-01

Volume: 532

Issue: Unknown

Page Range: 27-38

Description:

In recent years a large number of evolutionary and other population based heuristics were proposed in the literature for solving NP-hard optimization problems. In 2015 we presented a Discrete Bacterial Memetic Evolutionary Algorithm (DBMEA) for The Traveling Salesman Problem. It provided results tested on series of TSP problems. In this paper we present an improved version of the DBMEA algorithm, where the local search is accelerated, which is the most time consuming part of the original DBMEA algorithm. This modification led to a significant improvement, the runtime of the improved DBMEA was 5– 20 times shorter than the original DBMEA algorithm. Our DBMEA algorithms calculate real value costs better than integer ones, so we modified the Concorde algorithm be comparable with our results. The improved DBMEA was tested on several TSPLIB benchmark problems and other VLSI benchmark problems and the following values were compared: - optima found by the improved DBMEA heuristic and by the modified Concorde algorithm with real cost values - runtimes of original DBMEA, improved DBMEA and modified Concorde algorithm. Based on the test results we suggest the use of the improved DBMEA heuristic for the more efficient solution of TSP problems.

Open Access: Yes

DOI: 10.1007/978-3-319-48517-1_3

A discrete bacterial memetic evolutionary algorithm for the traveling salesman problem

P. Földesi Boldizsar Tuu-Szabo L. T. Koczy

Publication Name: 2016 IEEE Congress on Evolutionary Computation CEC 2016

Publication Date: 2016-11-14

Volume: Unknown

Issue: Unknown

Page Range: 3261-3267

Description:

This paper presents a Discrete Bacterial Memetic Evolutionary Algorithm (DBMEA) for the Traveling Salesman Problem. This algorithm combines the very efficient bacterial evolutionary algorithm with 2-opt and 3-opt local searches. Our approach was tested on TSPLIB and other VLSI benchmark problems. In this paper our computational results (minimal tour lengths, run times) are compared with other efficient TSP solver algorithms (Lin-Kernighan, Concorde). We will show that in significant number of the published benchmark problems the optimal tour was not found by the Concorde algorithm and the Lin-Kernighan heuristic because this approaches use an approximation substituting distances of points by the closest integer values. We suggest the substitution of the benchmark result set by the real optima calculated by the new DBMEA algorithm and the use of DBMEA heuristic as more precise for the solution of TSP and other NP-hard optimization problems.

Open Access: Yes

DOI: 10.1109/CEC.2016.7744202

Welcome

P. Földesi Anna Esposito Gabor Vattay P. Baranyi

Publication Name: 6th IEEE Conference on Cognitive Infocommunications Coginfocom 2015 Proceedings

Publication Date: 2016-01-25

Volume: Unknown

Issue: Unknown

Page Range: 3

Description:

No description provided

Open Access: Yes

DOI: 10.1109/CogInfoCom.2015.7390669

Preface: Special issue: multimodal biases in CoglnfoCom networks

P. Földesi Anna Esposito Hassan Charaf P. Baranyi Helen Meng

Publication Name: Journal on Multimodal User Interfaces

Publication Date: 2015-12-01

Volume: 9

Issue: 4

Page Range: 261-262

Description:

No description provided

Open Access: Yes

DOI: 10.1007/s12193-015-0201-8

Evaluation of waste management systems using fuzzy cognitive maps and optimization

F. Hatwágner P. Földesi A. Buruzs L. T. Koczy

Publication Name: 2015 10th Asian Control Conference Emerging Control Techniques for A Sustainable World Ascc 2015

Publication Date: 2015-09-08

Volume: Unknown

Issue: Unknown

Page Range: Unknown

Description:

Integrated Waste Management Systems (IWMS) are very complex systems with a lot of uncertainty. These can be defined as the selection and application of suitable techniques, technologies and management programs to achieve waste management objectives and goals. In order to support the decision making process in waste management we propose the use of Fuzzy Cognitive Map (FCM) and Bacterial Evolutionary Algorithm (BEA) methods since the combination of the FCM and BEA seem to be suitable to model complex mechanisms such as IWMS. While the FCM is formed for a chosen system by determining the concepts and their relationships, it is possible to quantitatively simulate the system considering its parameters. However, if the time series of the factors of the system are known, then the connection matrix of FCM, thus the causal relations among the parameters can be determined by optimization. This way a more objective description of IWMS can be given.

Open Access: Yes

DOI: 10.1109/ASCC.2015.7244894

A new state reduction approach for fuzzy cognitive map with case studies for waste management systems

F. Hatwágner P. Földesi A. Buruzs L. T. Koczy

Publication Name: Advances in Intelligent Systems and Computing

Publication Date: 2015-01-01

Volume: 331

Issue: Unknown

Page Range: 119-127

Description:

The authors have investigated the sustainability of Integrated Waste Management Systems (IWMS). These systems were modeled by Fuzzy Cognitive Maps (FCM), which are known as adequate fuzzy-neural network type models for multi-component systems with a stable state. The FCM model was designed of thirty-three factors to describe the real world processes of IWMS in as much detailed and as much accurately as possible. Although, this detailed model meets the requirements of accuracy, the presentation and explanation of such a complex model is difficult due to its size.While there is a general consensus in the literature about a very much simplified model of IWMSs, detailed investigation lead to the assumption that a much more complex model with considerably more factors (components) would more adequately simulate the rather complex real life behavior of the IWMS.As the starting point we used the thirty-three component model based on the consensus of a workshop of experts coming from all areas of the IWMS (operation, regulation, management, etc.) and the set goal was to find the most accurate real model that could be obtained by analyzing and properly reducing this – very likely too much detailed, or atomized – model.In this paper, a new state reduction approach with three different metrics is presented. The practical aspects of the results gained by these methods are evaluated.

Open Access: Yes

DOI: 10.1007/978-3-319-13153-5_12

A novel pose estimation algorithm for robotic navigation

R. C. Pozna P. Földesi Radu Emil Precup

Publication Name: Robotics and Autonomous Systems

Publication Date: 2015-01-01

Volume: 63

Issue: P1

Page Range: 10-21

Description:

This paper proposes a new pose estimation algorithm in the framework of robotic navigation problems. The algorithm gives the mobile robot (MR) pose on the basis of the difference between the MR desired pose and the MR current pose. In this regard the MR sensor readings and the readings of a virtual sensor are employed. The algorithm is advantageous in comparison with other pose estimation algorithms including those based on classical filter approaches because of the small computation time. Simulation and real-world experimental results are included to illustrate the effectiveness of the pose estimation algorithm and its potential for integration in MR control structures and algorithms.

Open Access: Yes

DOI: 10.1016/j.robot.2014.09.034

On the development of signatures for Artificial Intelligence applications

R. C. Pozna P. Földesi Radu Emil Precup L. T. Koczy

Publication Name: IEEE International Conference on Fuzzy Systems

Publication Date: 2014-09-04

Volume: Unknown

Issue: Unknown

Page Range: 1304-1310

Description:

This paper illustrates developments of signatures for Artificial Intelligence (AI) applications. Since the signatures are data structures with efficient results in modeling of fuzzy inference systems and of uncertain expert systems, the paper starts with the analysis of the data structures used in AI applications from the knowledge representation and manipulation point of view. An overview on the signatures, on the operators on signatures and on classes of signatures is next given. Using the proto fuzzy inference system, these operators are applied in a new application of fuzzy inference system modeled by means of signatures and of classes of signatures.

Open Access: Yes

DOI: 10.1109/FUZZ-IEEE.2014.6891636

Novel calculation of fuzzy exponent in the sigmoid functions for fuzzy neural networks

J. Botzheim P. Földesi

Publication Name: Neurocomputing

Publication Date: 2014-04-10

Volume: 129

Issue: Unknown

Page Range: 458-466

Description:

This paper presents a novel calculation of fuzzy exponent in the sigmoid functions for fuzzy neural networks. The investigated fuzzy neural network applies fuzzy input signals and crisp connection weights in the network's hidden and output layers. The applied calculation of fuzzy exponent is based on a parametric representation of the fuzzy exponent that is able to provide a crisp output instead of the extension principle's fuzzy output and requires significantly less computational effort than the learning based on α-cuts. For the training of the network the bacterial memetic algorithm is applied which effectively combines the bacterial evolutionary algorithm with gradient based learning. The method is tested on a benchmark problem and on two real datasets. Comparison to the classical technique concerning the learning time is also provided in the paper. © 2013 Elsevier B.V.

Open Access: Yes

DOI: 10.1016/j.neucom.2013.09.013

Strategic decision support in waste management systems by state reduction in FCM models

F. Hatwágner P. Földesi A. Buruzs L. T. Koczy

Publication Name: Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics

Publication Date: 2014-01-01

Volume: 8836

Issue: Unknown

Page Range: 447-457

Description:

In this paper, we introduce a new design for modeling sustainable waste management systems. By its complexity, this model is much more precise in describing the real systems than those found in the relevant literature. We set up a model with six factors and then decomposed the constituting factors up to around thirty subcomponents, thereby established an extremely complex and completely novel model of the Integrated Waste Management System (IWMS) using the system-of-system (SoS) approach with the help of experts. After the investigation of the basic and detailed model and their connection matrices, the following idea arises. The two models differ conceptually and so greatly that less than thirty-three factors should be enough to approximately describe the mechanism of action of the real IWMS. In the following, a new state reduction method is proposed. It can be considered as a generalization of the state reduction procedure of sequential systems and finite state machines. The essence of the proposal is to create clusters of factors and to build a new model using these clusters as factors. This way the number of factors can be decreased to make the model easier to understand and use. Our main goal with this method is to support the strategic decision making process of the stakeholder in order to ensure the long-term sustainability of IWMS.

Open Access: Yes

DOI: 10.1007/978-3-319-12643-2_55

Fuzzy Situational Maps: A new approach in mobile robot cooperation

R. C. Pozna Á Ballagi P. Földesi L. T. Koczy

Publication Name: Ines 2013 IEEE 17th International Conference on Intelligent Engineering Systems Proceedings

Publication Date: 2013-12-12

Volume: Unknown

Issue: Unknown

Page Range: 287-292

Description:

Intelligent robot cooperation tasks have very complex decision-making and computational processes. Collecting and calculating with a high amount of data is one of the weakest point of such system. In addition all of these it is necessary to process in real-time with limited computational capacity. In this paper we propose some novel algorithms for coping with these problems and give some information about the Fuzzy Situational Maps as a special case of the Fuzzy Signatures. An example takes to the field of warehouse logistics, managing and arranging boxes will be presented. © 2013 IEEE.

Open Access: Yes

DOI: 10.1109/INES.2013.6632828

Solution of a fuzzy resource allocation problem by various evolutionary approaches

P. Földesi Zsolt Dányádi L. T. Koczy

Publication Name: Proceedings of the 2013 Joint Ifsa World Congress and NAFIPS Annual Meeting Ifsa NAFIPS 2013

Publication Date: 2013-10-31

Volume: Unknown

Issue: Unknown

Page Range: 807-812

Description:

In this paper we present a fuzzy resource allocation and assignment problem and propose two types of biologically inspired optimization methods to solve it. The resources in question are used for the maintenance of a network of nodes, each with its specific maintenance demands over time. Our goal is to assign sufficient capacities to storage locations and transport the appropriate amount of resources to the nodes at specific times during the simulation, so that the total cost of storage, transportation and malfunction is kept to a minimum. We use fuzzy numbers to describe the parameters of all the scenarios a solution has to fit, such as the maintenance demands of each node, the additional expenditure that malfunctions bring, and also the varying cost of transportation between nodes and storage locations. The optimization methods we used were the bacterial evolutionary algorithm and the particle swarm algorithm, both with a plain and a memetic variant complemented with gradient-based local search. All of them had a version where they only worked with crisp values, and one with fuzzy solutions. We tested the effectiveness of these four approaches on four examples with varying network sizes and durations. © 2013 IEEE.

Open Access: Yes

DOI: 10.1109/IFSA-NAFIPS.2013.6608504

The Personal Assistant application, problem definition

R. C. Pozna P. Földesi Janos Kovacs

Publication Name: 4th IEEE International Conference on Cognitive Infocommunications Coginfocom 2013 Proceedings

Publication Date: 2013-01-01

Volume: Unknown

Issue: Unknown

Page Range: 851-856

Description:

The subject of the paper is a personal assistant design. The goal of personal assistant is a daily activities list planning. The personal assistant will assist the costumer (human operator) for planning an optimum succession of desired activities. The solution is based on objective and subjective information. The paper focus on problem definition, mathematical structure of the concepts which are involved and a first solution analyze. © 2013 IEEE.

Open Access: Yes

DOI: 10.1109/CogInfoCom.2013.6719215

Simultaneous optimization of customer satisfaction and cost function by nature inspired computing

J. Botzheim P. Földesi

Publication Name: Smart Innovation Systems and Technologies

Publication Date: 2012-12-01

Volume: 15

Issue: Unknown

Page Range: 309-318

Description:

When optimizing multi-dimensional non-linear problems the optimal solution in technical terms can be found by heuristic methods. It seems that human thinking does not work properlywith the mathematical processing: human decisionmakers tend to reject options that represent extreme values in the set of parameters and are not able to handle many system parameters at the same time. The paper investigates the best possible way for modeling the human thinking, comparing bacterial memetic algorithm and particle swarm optimization in fuzzy environment. © Springer-Verlag Berlin Heidelberg 2012.

Open Access: Yes

DOI: 10.1007/978-3-642-29977-3_31

Improving the Strategic Level Performance Measurement in Warehousing Processes

J. Botzheim P. Földesi Péter Németh

Publication Name: Smart Innovation Systems and Technologies

Publication Date: 2012-12-01

Volume: 16

Issue: Unknown

Page Range: 365-374

Description:

In our paper we propose a new method for the strategic level performance measurement at a warehouse in Hungary. The growing challenge of remaining successful in the warehousing forced the given warehouse to introduce and use a new tool for monitoring and forecasting strategic level indicators. Our proposed tool uses computational intelligence to establish connection between basic operational level data and important strategic level indicators. In this article we present the idea behind this tool and the process of programming and learning with company data. Finally, an evaluation is presented based on the results of the program run. © Springer-Verlag Berlin Heidelberg 2012.

Open Access: Yes

DOI: 10.1007/978-3-642-29920-9_37

Fuzzy search space for correction of cognitive biases in constructing mathematical models

P. Földesi Zsolt Dányádi L. T. Koczy

Publication Name: 3rd IEEE International Conference on Cognitive Infocommunications Coginfocom 2012 Proceedings

Publication Date: 2012-12-01

Volume: Unknown

Issue: Unknown

Page Range: 585-589

Description:

In optimization the constructed mathematical models are very often idealized mappings of the actual problem. Considering human decision-making processes there is always a chance that cognitive biases occur when constructing the objective function and the constrains. Misrepresented human desires in the objective function or in the constrains result non-acceptable outcome for the decision-maker. To solve the problem of uncertainty concerning the search space we propose the use of fuzzy search space. Bacterial evolutionary algorithm is applied to demonstrate the difference between solutions with altering degree of satisfaction of the original constrains. By presenting the whole set of solutions to the human decision-maker the cognitive biases encoded into the mathematical model can be corrected. © 2012 IEEE.

Open Access: Yes

DOI: 10.1109/CogInfoCom.2012.6422047

Computational method for corrective mechanism of cognitive decision-making biases

J. Botzheim P. Földesi

Publication Name: 3rd IEEE International Conference on Cognitive Infocommunications Coginfocom 2012 Proceedings

Publication Date: 2012-12-01

Volume: Unknown

Issue: Unknown

Page Range: 211-215

Description:

When decisions are made by human beings these choices are often 'predictably irrational'. A large number of different biases effect the human beings' information processing systems. Because of the imperfect information processing system the decisions are imperfect as well, and very often some distortion appears in the solution. In our paper we propose a simple corrective mechanism for the loss aversion bias, presenting Kano's quality model as a case study. An 'interface' is placed between the input data and the optimizing algorithm and the input data are debiased instead of modifying the algorithm itself. The use of fuzzy numbers is adequate to model the loss aversion type bias and corrective tools. Computational results are presented as well to demonstrate the efficiency. © 2012 IEEE.

Open Access: Yes

DOI: 10.1109/CogInfoCom.2012.6421982

Optimization of strategic level performance measurement and decision making using artificial neural network

J. Botzheim P. Földesi Csaba Tápler Péter Németh

Publication Name: 2012 IEEE International Technology Management Conference Itmc 2012

Publication Date: 2012-11-01

Volume: Unknown

Issue: Unknown

Page Range: 93-97

Description:

In our paper we propose a new method for the strategic level performance measurement and decision making by presenting two case studies performed in 2011. We proposed a computational intelligence method to establish connection between basic operational level data and important strategic level indicators. In the first case study this indicator is related to performance measurement. In the second case study the indicator is the contribution margin of the given company. After the introduction we present the process of programming and learning with actual company data. Finally an evaluation of the results is presented based on the program runs. © 2012 IEEE.

Open Access: Yes

DOI: 10.1109/ITMC.2012.6306360

A fuzzy bacterial evolutionary solution for crisp three-dimensional bin packing problems

P. Földesi Dányádi Zsolt L. T. Koczy

Publication Name: IEEE International Conference on Fuzzy Systems

Publication Date: 2012-10-23

Volume: Unknown

Issue: Unknown

Page Range: Unknown

Description:

This paper presents an evolutionary quasi-solution for a problem commonly occurring in practical logistics, the three-dimensional version of the bin packing problem. The algorithm presented here is a variation of the bacterial evolutionary approach, and utilizes fuzzy logic in the fitness calculation. The goal is to give a useful alternative method to the basic problem, and to demonstrate that the addition of fuzzy logic elements to the fitness function increases the speed of the evolutionary process. The paper first describes the specific problem, then moves on to the details of every key part of the algorithm. Finally, the results from a number of test runs are used to show the general efficiency, and the contrast between the crisp and fuzzy fitness functions. It is clearly shown that the application of fuzzy approach in the fitness function can improve the speed of convergence, so the fuzzy logic can be helpful even in solving crisp problems. © 2012 IEEE.

Open Access: Yes

DOI: 10.1109/FUZZ-IEEE.2012.6251262

Fast algorithm to solve the most economical path problem in sparse matrices

Kornélia Ambrus-Somogyi J. Gáti András Bakó P. Földesi

Publication Name: Ines 2012 IEEE 16th International Conference on Intelligent Engineering Systems Proceedings

Publication Date: 2012-10-01

Volume: Unknown

Issue: Unknown

Page Range: 335-339

Description:

Several variations exist of the shortest path problem depending on the type of the graph. The most common problems are the shortest path problem between two points and between every pair of points (the so called multiterminal minimal path problem). Beside this several other variations are known. One of them is the shortest path in a network having gains, the time dependent path, the shortest path in a network, where the travelling time depends on the actual traffic flow. In this paper a powerful algorithm is presented in large scale, sparse network. In long term road network planning problem sometimes the size of the network is very large - about hundred thousand. The network is usually sparse, one point is connected with average 3 or 4 points. It will be shown that the presented algorithm in this case is much more powerful. © 2012 IEEE.

Open Access: Yes

DOI: 10.1109/INES.2012.6249854

A bullwhip type of instability induced by time varying target inventory in production chains

P. Földesi Árpád Csík

Publication Name: International Journal of Innovative Computing Information and Control

Publication Date: 2012-08-01

Volume: 8

Issue: 8

Page Range: 5885-5897

Description:

We present an analytic investigation of the bullwhip effect developing in production-distribution chains. All common considered causes of the effect are excluded and the only mean to induce a bullwhip type of instability is the adoption of an inventory replenishment policy involving a variable target level. The policy is designed to maintain a safety stock that is proportional to the actual demand. In order to achieve our goals we develop a particular discrete model of supply chains by introducing some fresh concepts into the field of supply chain stability. The basic idea is to derive an update scheme describing the status of the whole chain over the entire time-space (period-stage) domain of interest. We prove that the strategy of demand driven target inventory inherently leads to an instability developing in the chain, which is precisely a manifestation of the bullwhip effect. Following the identification of the source and the nature of the instability, we propose a new production plan, which is stable and does not exhibit the bullwhip effect at all. Thus, the amplitude of the variation of the production rate never exceeds the amplitude of the oscillation of the market demand within the entire supply chain. © 2012 ICIC International.

Open Access: Yes

DOI: DOI not available

Parametric approximation of fuzzy exponent for computationally intensive problems

J. Botzheim P. Földesi

Publication Name: International Journal of Innovative Computing Information and Control

Publication Date: 2012-08-01

Volume: 8

Issue: 8

Page Range: 5725-5744

Description:

The paper deals with the investigation of the critical non-linear factors and NP-hard problems of real-life decision-making processes. When using non-linear utility/objective functions to represent the value of various options in the search space or when NP-hard problems arise, often soft computing techniques must be applied for optimization. Many times significant uncertainty must be handled as well, so the use of fuzzy numbers can be an efficient method to cope with ambiguity and lack of information. The fuzzy extensions for heuristic based optimizing algorithms often face the problem of an increased number of calculations required to find the solutions. Appropriate representation of the fuzzy power function for non-linear cases is to be used so that it can keep the required computation time and resources at a reasonable level. © 2012 ICIC International.

Open Access: Yes

DOI: DOI not available

Variations of gravitation models using geometric programming

P. Földesi Habil A. Bako

Publication Name: Isciii 2011 5th International Symposium on Computational Intelligence and Intelligent Informatics

Publication Date: 2011-12-12

Volume: Unknown

Issue: Unknown

Page Range: 93-97

Description:

The article deals with the gravitation problem, which is widely used for solving different practical problems. First of all it is used to forecast the future traffic of a territory (Origin/destination problem). It is also used in the economy for forecasting the Leontief Input/Output table. It will be shown if the I-divergence is used for the sample O/D matrix and the future traffic matrix the cost function is exponential and the element of the forecasted matrix are determined in the well known RAS form. For the proof the geometric programming and its dual and the week and strong duality theorem are applied. © 2011 IEEE.

Open Access: Yes

DOI: 10.1109/ISCIII.2011.6069749

Interpretation of loss aversion in Kano's quality model

J. Botzheim P. Földesi

Publication Name: Smart Innovation Systems and Technologies

Publication Date: 2011-12-01

Volume: 10 SIST

Issue: Unknown

Page Range: 165-174

Description:

For designing and developing products/services it is vital to know the relevancy of the performance generated by each technical attribute and how they can increase customer satisfaction. Improving the parameters of technical attributes requires financial resources, and the budgets are generally limited. Thus the optimum target can be the achievement of the minimum overall cost for a given satisfaction level. Kano's quality model classifies the relationships between customer satisfaction and attribute-level performance and indicates that some of the attributes have a non-linear relationship to satisfaction, rather power-function should be used. For the customers' subjective evaluation these relationships are not deterministic and are uncertain. Also the cost function are uncertain, where the loss aversion of decision makers should be considered as well. This paper proposes a method for fuzzy extension of Kano's model and presents numerical examples. © 2011 Springer-Verlag Berlin Heidelberg.

Open Access: Yes

DOI: 10.1007/978-3-642-22194-1_17

Representation of loss aversion and impatience concerning time utility in supply chains

J. Botzheim P. Földesi E. Süle

Publication Name: Smart Innovation Systems and Technologies

Publication Date: 2011-12-01

Volume: 10 SIST

Issue: Unknown

Page Range: 273-282

Description:

The paper deals with the investigation of the critical time factor of supply chain. The literature review gives a background to understand and handle the reasons and consequences of the growing importance of time, and the phenomenon of time inconsistency. By using utility functions to represent the value of various delivery-times for the different participants in the supply chain, including the final customers, it is shown that the behaviour and willingness of payment of time-sensitive and non time-sensitive consumers are different for varying lead times. Longer lead times not only generate less utility but impatience influences the decision makers, that is the time elasticity is not constant but it is function of time. For optimization soft computing techniques (particle swarm optimization in this paper) can be efficiently applied. © 2011 Springer-Verlag Berlin Heidelberg.

Open Access: Yes

DOI: 10.1007/978-3-642-22194-1_28

Adapted queueing algorithms for process chains

P. Földesi András Rövid Ágnes Bogárdi-Mészöly

Publication Name: Smart Innovation Systems and Technologies

Publication Date: 2011-12-01

Volume: 10 SIST

Issue: Unknown

Page Range: 65-73

Description:

Process chains are a common modeling paradigm for analysis and optimization of logistic processes, and are intensively used in many practical applications. The ProC/B toolset is a collection of software tools for modeling, analysis, validation and optimization of process chains. The ProC/B models can be translated into queueing networks or Petri nets, which can be solved by effective techniques and algorithms to evaluate performance metrics. The base queueing model with Mean-Value Analysis evaluation algorithm, and their adaptations for modeling thread pool and queue limit have been verified and validated for multi-tier software systems. The goal of our work is to adapt these models and algorithms for process chains to model parallel processes and queue limit. © 2011 Springer-Verlag Berlin Heidelberg.

Open Access: Yes

DOI: 10.1007/978-3-642-22194-1_7

Cooperation in multiagent systems

R. C. Pozna P. Földesi Radu Emil Precup Janos Kovacs

Publication Name: Sisy 2011 9th International Symposium on Intelligent Systems and Informatics Proceedings

Publication Date: 2011-10-26

Volume: Unknown

Issue: Unknown

Page Range: 195-200

Description:

This paper gives aspects related to a cooperation scenario in the framework of multiagent systems. The presentation is focused on a multiagent system that consists of two agents, the Master and the Apprentice. The theoretical basis of the cooperation scenario is the definition of the most probable process, and two algorithms are used with this regard. The formulation of the cooperation scenario is exemplified for a case study that builds an architecture of successively placed bricks in the workspace. © 2011 IEEE.

Open Access: Yes

DOI: 10.1109/SISY.2011.6034321

On a new doctoral (PhD) school in multidisciplinary engineering sciences

P. Földesi L. T. Koczy László Keviczky

Publication Name: 2011 International Conference on Information Technology Based Higher Education and Training Ithet 2011

Publication Date: 2011-10-04

Volume: Unknown

Issue: Unknown

Page Range: Unknown

Description:

Széchenyi István University (SIU) is one of the youngest universities in Hungary, however, the school has three century old origins. The immediate predecessor of SIU was an engineering college founded 40 years ago. © 2011 IEEE.

Open Access: Yes

DOI: 10.1109/ITHET.2011.6018691

Eugenic bacterial memetic algorithm for fuzzy road transport traveling salesman problem

J. Botzheim P. Földesi L. T. Koczy

Publication Name: International Journal of Innovative Computing Information and Control

Publication Date: 2011-05-01

Volume: 7

Issue: 5 B

Page Range: 2775-2798

Description:

The aim of the Traveling Salesman Problem (TSP) is to find the cheapest way of visiting all elements in a given set of cities (nodes) exactly once and returning to the starting point. In solutions presented in the literature costs of travel between nodes are based on Euclidean distances, the problem is symmetric and the costs are constant and crisp values. Practical application in road transportation and supply chains are often uncertain or fuzzy. The risk attitude depends on the features of the given operation. The model presented in this paper handles the fuzzy, time dependent nature of the TSP and also gives a solution for the asymmetric loss aversion by embedding the risk attitude into the fitness function of the eugenic bacterial memetic algorithm. Computational results are presented for different cases. The classical TSP is investigated along with a modified instance where some costs between the cities are described with fuzzy numbers. Two different techniques are proposed to evaluate the uncertainties in the fuzzy cost values. The time dependent version of the fuzzy TSP is also investigated and simulation experiences are presented. © 2011.

Open Access: Yes

DOI: DOI not available

Modeling of loss aversion in solving fuzzy road transport traveling salesman problem using eugenic bacterial memetic algorithm

J. Botzheim P. Földesi

Publication Name: Memetic Computing

Publication Date: 2010-12-01

Volume: 2

Issue: 4

Page Range: 259-271

Description:

The aim of the traveling salesman problem (TSP) is to find the cheapest way of visiting all elements in a given set of cities and returning to the starting point. In solutions presented in the literature costs of travel between nodes (cities) are based on Euclidean distances, the problem is symmetric and the costs are constant and crisp values. Practical application in road transportation and supply chains are often fuzzy. The risk attitude depends on the features of the given operation. The model presented in this paper handles the fuzzy, time dependent nature of the TSP and also gives solution for the asymmetric loss aversion by embedding the risk attitude into the fitness function of the bacterial memetic algorithm. Computational results are presented as well. © 2010 Springer-Verlag.

Open Access: Yes

DOI: 10.1007/s12293-010-0037-4

Determining an optimal subdivision of gene transfer partitions

J. Botzheim P. Földesi Mark Farkas L. T. Koczy

Publication Name: Proceedings of the 9th Wseas International Conference on Applied Computer and Applied Computational Science Acacos 10

Publication Date: 2010-12-01

Volume: Unknown

Issue: Unknown

Page Range: 202-207

Description:

Bacterial memetic algorithms are widely used on discrete combinatorial problems, which are essential in the field of logistics and forwarding, such as the well known Traveling Salesman Problem. The original Bacterial Evolutionary Algorithm proposed by Nawa and Furuhashi [5] has a predefined set of operators such as bacterial mutation and gene transfer also known as infection. The traditional bacterial infection operator is proven to be far from optimal. The authors suggest an alternative gene transfer operator that is applied on the metric Traveling Salesman Problem [9]. This alternative infection algorithm has superior rate of convergence while reducing the risk of getting stuck in a local optima.

Open Access: Yes

DOI: DOI not available

A solution method for solving I/O and O/D tables

András Bakó P. Földesi István Szüts

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

Publication Date: 2010-07-26

Volume: Unknown

Issue: Unknown

Page Range: 195-198

Description:

The Origin-Destination (O/D) matrix is intensively used in long term traffic network planning. The matrix is used for forecasting the future traffic between the sections and for distributing the traffic. Several methods are known as a solution for this problem. In this paper it is shown that all these methods can be solved by the RAS algorithm. Furthermore we present the Input-Output table problem which also can be solved by this RAS method. © 2010 IEEE.

Open Access: Yes

DOI: 10.1109/INES.2010.5483850

Fuzzy approach to utility of time factor

J. Botzheim P. Földesi E. Süle

Publication Name: Isciii 09 4th International Symposium on Computational Intelligence and Intelligent Informatics Proceedings

Publication Date: 2009-12-28

Volume: Unknown

Issue: Unknown

Page Range: 23-29

Description:

The paper deals with the investigation of the critical factor of the supply chain concerning time factor. The literature review can give a background to understand and handle the reasons and consequences of the growing importance of time. By using utility functions to represent the value of various delivery-times for the different participants in the supply chain, including the final customers, it proves through the Kano-model, that the choices, behaviour and willingness of payment of time-sensitive and non time-sensitive consumers are different for varying lead times, so for optimization soft computing techniques must be applied. As the functions are not linear and significant uncertainty must be handled as well, the use of fuzzy numbers is necessary. The features of fuzzy power functions are investigated, and a parametric approaches is presented that can be an efficient approximation of the values calculated on the basis of extension principle. © 2009 IEEE.

Open Access: Yes

DOI: 10.1109/ISCIII.2009.5342282

Approaching the fuzzy road transport Traveling Salesman Problem by eugenic bacterial memetic algorithm

J. Botzheim P. Földesi

Publication Name: Isciii 09 4th International Symposium on Computational Intelligence and Intelligent Informatics Proceedings

Publication Date: 2009-12-28

Volume: Unknown

Issue: Unknown

Page Range: 15-22

Description:

The aim of the Traveling Salesman Problem (TSP) is to find the cheapest way of visiting all elements in a given set of cities and returning to the starting point. In solutions presented in the literature costs of travel between nodes (cities) are based on Euclidean distances, the problem is symmetric and the costs are constant. In this paper a novel construction and formulation of the TSP is presented in which the requirements and features of practical application in road transportation and supply chains are taken into consideration. Computational results are presented as well. © 2009 IEEE.

Open Access: Yes

DOI: 10.1109/ISCIII.2009.5342281

Solution for fuzzy road transport traveling salesman problem using eugenic bacterial memetic algorithm

J. Botzheim P. Földesi L. T. Koczy

Publication Name: 2009 International Fuzzy Systems Association World Congress and 2009 European Society for Fuzzy Logic and Technology Conference Ifsa Eusflat 2009 Proceedings

Publication Date: 2009-12-01

Volume: Unknown

Issue: Unknown

Page Range: 1667-1672

Description:

The aim of the Traveling Salesman Problem (TSP) is to find the cheapest way of visiting all elements in a given set of cities and returning to the starting point. In solutions presented in the literature costs of travel between nodes (cities) are based on Euclidean distances, the problem is symmetric and the costs are constant. In this paper a novel construction and formulation of the TSP is presented in which the requirements and features of practical application in road transportation and supply chains are taken into consideration. Computational results are presented as well.

Open Access: Yes

DOI: DOI not available

Approximation of a modified traveling salesman problem using bacterial memetic algorithms

J. Botzheim P. Földesi Mark Farkas L. T. Koczy

Publication Name: Studies in Computational Intelligence

Publication Date: 2009-12-01

Volume: 243

Issue: Unknown

Page Range: 607-625

Description:

The goal of this paper is to develop an algorithm that is capable to handle a slightly modified version of the minimal Traveling Salesman Problem in an efficient and robust way and produces high-quality solutions within a reasonable amount of time. The requirements of practical logistical applications, such as road transportation and supply chains, are also taken into consideration in this novel approach of the TSP. This well-known combinatorial optimization task is solved by a bacterial memetic algorithm, which is an evolutionary algorithm inspired by bacterial transduction. A new method is also proposed to deal with the time dependency in the cost matrix. The efficiency of the implementation, including time and space constraints, is investigated on a real life problem. © 2009 Springer-Verlag Berlin Heidelberg.

Open Access: Yes

DOI: 10.1007/978-3-642-03737-5_44

Determination the basic network algorithms with gains

András Bakó P. Földesi István Szüts

Publication Name: Studies in Computational Intelligence

Publication Date: 2009-12-01

Volume: 243

Issue: Unknown

Page Range: 447-456

Description:

Several optimalization algorithms have been proposed for the solution of the basic network flow algorithms, such as the minimal and the multiterminal minimal path of a network having cost (distance) function, maximal flow of a capacitated network. In this paper we present these algorithms in a special network in which on the edges a gain function is given. On the edge (x,y) of the network a t(x,y) transportation cost is defined. In the course of the transportation on the edge (x,y) the goods loose a part of there weight. If one unit of goods is transported from point x to point y then k(x,y) unite of goods arrive at point y, where 0

Open Access: Yes

DOI: 10.1007/978-3-642-03737-5_32

Utility of time factor in logistic optimization

P. Földesi E. Süle

Publication Name: Proceedings 2009 3rd International Workshop on Soft Computing Applications Sofa 2009

Publication Date: 2009-11-25

Volume: Unknown

Issue: Unknown

Page Range: 209-214

Description:

The paper deals with the investigation of the critical factor of the supply chain, with regards to time. The literature review can give a background to understand and handle the reasons and consequences of the growing importance of time. It analyses the time- and place-value of products and it evaluates time by showing theoretical functions as well. By using utility functions to represent the value of various delivery-times for the different participants in the supply chain, including the final customers, it proves through the Kano-model, that the choices, behaviour and willingness of payment of time-sensitive and non time-sensitive consumers are different for varying lead times, so for optimization soft computing techniques must be applied. © 2009 IEEE.

Open Access: Yes

DOI: 10.1109/SOFA.2009.5254851

Fuzzy solution for non-linear quality models

J. Botzheim P. Földesi L. T. Koczy

Publication Name: 12th International Conference on Intelligent Engineering Systems Proceedings Ines 2008

Publication Date: 2008-09-01

Volume: Unknown

Issue: Unknown

Page Range: 269-275

Description:

For designing and developing products/services it is vital to know the relevancy of the performance generated by each technical attribute and how they can increase customer satisfaction. Improving the parameters of technical attributes requires financial resources, and the budgets are generally limited. Thus the optimum target is to achieve maximum customer satisfaction within given financial limits. Kano's quality model classifies the relationships between customer satisfaction and attribute-level performance and indicates that some of the attributes have a non-linear relationship to satisfaction, rather power-function should be used. For the customers' subjective evaluation these relationships are not deterministic and are uncertain. This paper proposes a method for fuzzy extension of Kano's model and presents numerical examples that can prove the efficiency of bacterial evolutionary algorithm in as well. © 2008 IEEE.

Open Access: Yes

DOI: 10.1109/INES.2008.4481306

Fuzzy extension for Kano's model using bacterial evolutionary algorithm

J. Botzheim P. Földesi L. T. Koczy

Publication Name: Isciii 07 3rd International Symposium on Computational Intelligence and Intelligent Informatics Proceedings

Publication Date: 2007-09-25

Volume: Unknown

Issue: Unknown

Page Range: 147-151

Description:

For designing and developing products/services it is vital to know the relevancy of the performance generated by each technical attribute and how they can increase customer satisfaction. Improving the parameters of technical attributes requires financial resources, and the budgets are generally limited. Thus the optimum target is to achieve maximum customer satisfaction within given financial limits. Kano's quality model classifies the relationships between customer satisfaction and attribute-level performance and indicates that some of the attributes have a nonlinear relationship to satisfaction, rather power-function should be used. For the customers' subjective evaluation these relationships are not deterministic and are uncertain. This paper proposes a method for fuzzy extension of Kano's model and presents numerical examples that can prove the efficiency of bacterial evolutionary algorithm in as well. © 2007 IEEE.

Open Access: Yes

DOI: 10.1109/ISCIII.2007.367379