Jolanta Koszelew | Bialystok University of Technology (original) (raw)
Papers by Jolanta Koszelew
This paper presents a new evolutionary algorithm, called Routes Generation Evolutionary Algorithm... more This paper presents a new evolutionary algorithm, called Routes Generation Evolutionary Algorithm (RGEA), for determining routes with optimal travel time. The algorithm is illustrated on the simple example of transportation network. The method was implemented and tested on the real transport network in Bialystok city. Effectiveness of the method was compared with another algorithm Routes Generation Matrix Algorithm (RGMA) which is based on special transfer matrices. Computer experiments have shown that RGEA generates routes better than RGMA and significantly faster.
Archives of Transport System Telematics, 2010
A huge number of papers studies Travelling Salesman Problem (TSP) in classical version. In standa... more A huge number of papers studies Travelling Salesman Problem (TSP) in classical version. In standard TSP all cities must be visited and graph is completed. While this is indeed the case in many practical problems, there are many other practical problems where these assumptions are not valid. This paper presents a new evolutionary algorithm (EA) which solves TSP with profits and returns (TSPwPR). This version of TSP is often applied in Intelligent Transport Systems, especially in Vehicle Routing Problem (VRP). TSPwPR consists in finding a cycle which maximizes collected profit but does not exceed a given cost constraint. A graph which is considered in this problem can be not completed, salesman doesn’t have to visit all cities and he can repeat (with zero profit) cities in his tour. The method was implemented and tested on real network which consists of 160 cities in eastern and central voivodeships of Poland. The main parameter which has the highest influence on quality of obtaining ...
![Research paper thumbnail of Problem generowania optymalnej trasy bezzałogowego statku powietrznego stosowanego do detekcji obiektów niebezpiecznych w systemach autonomicznej nawigacji morskiej [w:] Wybrane zagadnienia informatyki technicznej. Modelowanie i przetwarzanie informacji w warunkach niepewności](https://attachments.academia-assets.com/100645937/thumbnails/1.jpg)
](
Information Processing and Security Systems
Survivability is the ability of system to continue operating in the presence of failures or malic... more Survivability is the ability of system to continue operating in the presence of failures or malicious attacks [4]. We present an original method for performing probabilistic analysis of survivability of network systems. We can simulate failures and intrusion events in our method and then observe the effects of the injected events. Our model is based on Markov Decision Processes which are generalization of Markov Chains and provides the analysis of probabilistic measures for network systems, such us: probability that a service that has been issued will be finished or the expected time it takes a service to finish. We illustrate the idea of our technigues by a simply example.
Journal of Automation, Electronics and Electrical Engineering, 2021
Autonomous Vessel with an Air Look, is a research project that aims to develop autonomous navigat... more Autonomous Vessel with an Air Look, is a research project that aims to develop autonomous navigation of ships. The system uses three independent sources of information i.e. radar, AIS ? Automatic Identification System and cameras, which can be located on a drone or ship?s superstructure. The article presents the results of testing of an image processing system in real conditions on m/f Wolin.
2018 Baltic Geodetic Congress (BGC Geomatics), 2018
This article presents the conception and assumptions of innovative technology under the acronym A... more This article presents the conception and assumptions of innovative technology under the acronym AVAL - Autonomous Vessel with an Air Look concerning on Unmanned Surface Vehicle (USV) which applies UAV for the collection of additional navigation data. The AVAL technology is now developed as an R & D project co-financed by the National Research and Development Center in Poland. The aim of the AVAL project [1] is developing a technology of autonomous marine vessel, which is integrated with navigation devices, autopilots and control systems of the modern ship. AVAL constitutes a breakthrough innovation in the market of maritime transport. One of them is UAV, which is responsible for observation, detection, and recognition of objects in the nearby area. Others are autonomous navigation, automatic negotiations and communication.
This paper presents a new version of Routes Generation Matri x Algorithm, called Routes Generatio... more This paper presents a new version of Routes Generation Matri x Algorithm, called Routes Generation Matrix Improved Algorithm (RGMIA ), for determining routes with optimal travel time in public transport network. The me thod was implemented and tested on the real public transport network in Warsaw city. T his network was completed with walk links and therefore resultant routes are more prac tic l and can perform various users’ preferences. Effectiveness of the improved method w as compared in two aspects: time complexity and quality of results, with another two alg orithms previous version of Routes Generation Matrix Algorithm (RGMA) and Routes Gener ation Genetic Algorithm (RGGA). RGMA and RGGA algorithms were described in previous a thor’s papers [9,10].
Biocybernetics and Biomedical Engineering, 2021
Sensors, 2020
A single anti-collision trajectory generation problem for an “own” vessel only is significantly d... more A single anti-collision trajectory generation problem for an “own” vessel only is significantly different from the challenge of generating a whole set of safe trajectories for multi-surface vehicle encounter situations in the open sea. Effective solutions for such problems are needed these days, as we are entering the era of autonomous ships. The article specifies the problem of anti-collision trajectory planning in many-to-many encounter situations. The proposed original multi-surface vehicle beam search algorithm (MBSA), based on the beam search strategy, solves the problem. The general idea of the MBSA involves the application of a solution for one-to-many encounter situations (using the beam search algorithm, BSA), which was tested on real automated radar plotting aid (ARPA) and automatic identification system (AIS) data. The test results for the MBSA were from simulated data, which are discussed in the final part. The article specifies the problem of anti-collision trajectory p...
Annual of Navigation, 2017
The paper presents a concept of the new algorithm solving Last Moment Manoeuvre problem. Last Mom... more The paper presents a concept of the new algorithm solving Last Moment Manoeuvre problem. Last Moment Manoeuvre means that action taken only by one vessel is not enough to avoid collision. This is why both vessels have to synchronize their manoeuvres to pass each other. The main focus of the proposed solution is concentrated on the procedure defining the best possible manoeuvre for each vessel when avoiding a collision is no longer possible. For simplification, the assumption that the parameters of the vessels involved in the Last Moment Manoeuvre meet Standards for Ships Manoeuvrability set out in the IMO resolution, will be adopted. The algorithm presented in the paper will be implemented and tested in the commercial system.
Annals of Operations Research, 2016
The orienteering problem (OP) is defined on a graph with scores assigned to the vertices and weig... more The orienteering problem (OP) is defined on a graph with scores assigned to the vertices and weights attached to the links. The objective of solutions to the OP is to find a route over a subset of vertices, limited in length, that maximizes the collective score of the vertices visited. In this paper we present a new, efficient method for solving the OP, called the evolution-inspired local improvement algorithm (EILIA). First, a multi-stage, hill climbing-based method is used to improve an initial random population of routes. During the evolutionary phase, both feasible and infeasible (routes that are too long) parts of the solution space are explored and exploited by the algorithm operators. Finally, infeasible routes are repaired by a repairing method. Computer testing of EILIA is conducted on popular data sets, as well as on a real transport network with 908 nodes proposed by the authors. The results are compared to an exact method (branch and cut) and to the best existing algorithms for OP. The results clearly show that EILIA outperforms existing heuristic methods in terms of the quality of its solutions. In many cases, EILIA produces the same results as the exact method.
Lecture Notes in Computer Science, 2011
A public transport route planner provides for citizens and tourists information about available p... more A public transport route planner provides for citizens and tourists information about available public transport journeys. The heart of such systems are effective methods for solving itinerary planning problem in a multi-modal urban public transportation networks. This paper describes a new evolutionary algorithm solving a certain version of this problem. The method returns the set of k-journeys that lexicographically optimize two criteria's: total travel time and number of transfers. Proposed algorithm was compared with two another solutions for itinerary planning problem. This comparison is prepared on the base of experimental results which were performed on real-life data - Warsaw city public transport network. Conducted experiments confirm high effectiveness of the proposed method in comparison with two another known solutions for considered problem.
6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07), 2007
With the increase of cars on the streets, more and more people in big cities, decide to move from... more With the increase of cars on the streets, more and more people in big cities, decide to move from one place to another by public transport, such as tram, metro or bus. Public transport users need detail informations about network connections. Therefore, some urban portals offer to use systems of optimization of public transport travel. However, finding one or several optimal routes, according to user preferences, is a difficult problem. This paper presents an original method for determining optimal paths in public transportation network. Author describes a network model with time- dependent and bi-modal links, defines the problem of finding optimal routes with users' preferences and proposes algorithm, which can be a solution of this problem.
The analysis of dependences between parameters of core on light propagation in ring-core optical ... more The analysis of dependences between parameters of core on light propagation in ring-core optical fibers is presented in this paper. Authors try to find the answer on following question: How should we establish values of gabarit parameters of optical fiber and index of refraction for core and cladding, to get desirable distribution of electric field in transverse intersecction of ring-core fiber. The answer on above mentioned important question is settled on the ground results of many computer simulations, which are implementation of two-step theoretical model for this kind of optical fibers.
Lecture Notes in Computer Science, 2011
The selective travelling salesman problem (STSP) appears in various applications. The paper prese... more The selective travelling salesman problem (STSP) appears in various applications. The paper presents a new version of this problem called the selective travelling salesman problem on a road network (R-STSP). While in the classical STSP a graph is complete and each vertex can be visited at most once, in R-STSP these two constraints are not obligatory which makes the problem more real-life and applicable. To solve the problem, the memetic algorithm (MA) is proposed. After implementing the MA, computer experiments were conducted on the real transport network in Poland. The comparative study of the MA with the genetic algorithm (GA) shows that the MA outperforms the GA.
Communications in Computer and Information Science, 2010
This paper presents a new evolutionary algorithm, called Routes Generation Evolutionary Algorithm... more This paper presents a new evolutionary algorithm, called Routes Generation Evolutionary Algorithm with Knowledge (RGEAwK), for determining routes with optimal travel time in graph which models public transport network. The method was implemented and tested on the real transport network. Effectiveness of the method was compared with Routes Generation Matrix Algorithm (RGMA) [8]. This comparison is based on experimental results which were performed on realistic data. The paper ends with some remarks about future work on improving of RGEAwK.
This paper presents a new evolutionary algorithm, called Routes Generation Evolutionary Algorithm... more This paper presents a new evolutionary algorithm, called Routes Generation Evolutionary Algorithm (RGEA), for determining routes with optimal travel time. The algorithm is illustrated on the simple example of transportation network. The method was implemented and tested on the real transport network in Bialystok city. Effectiveness of the method was compared with another algorithm Routes Generation Matrix Algorithm (RGMA) which is based on special transfer matrices. Computer experiments have shown that RGEA generates routes better than RGMA and significantly faster.
Archives of Transport System Telematics, 2010
A huge number of papers studies Travelling Salesman Problem (TSP) in classical version. In standa... more A huge number of papers studies Travelling Salesman Problem (TSP) in classical version. In standard TSP all cities must be visited and graph is completed. While this is indeed the case in many practical problems, there are many other practical problems where these assumptions are not valid. This paper presents a new evolutionary algorithm (EA) which solves TSP with profits and returns (TSPwPR). This version of TSP is often applied in Intelligent Transport Systems, especially in Vehicle Routing Problem (VRP). TSPwPR consists in finding a cycle which maximizes collected profit but does not exceed a given cost constraint. A graph which is considered in this problem can be not completed, salesman doesn’t have to visit all cities and he can repeat (with zero profit) cities in his tour. The method was implemented and tested on real network which consists of 160 cities in eastern and central voivodeships of Poland. The main parameter which has the highest influence on quality of obtaining ...
Information Processing and Security Systems
Survivability is the ability of system to continue operating in the presence of failures or malic... more Survivability is the ability of system to continue operating in the presence of failures or malicious attacks [4]. We present an original method for performing probabilistic analysis of survivability of network systems. We can simulate failures and intrusion events in our method and then observe the effects of the injected events. Our model is based on Markov Decision Processes which are generalization of Markov Chains and provides the analysis of probabilistic measures for network systems, such us: probability that a service that has been issued will be finished or the expected time it takes a service to finish. We illustrate the idea of our technigues by a simply example.
Journal of Automation, Electronics and Electrical Engineering, 2021
Autonomous Vessel with an Air Look, is a research project that aims to develop autonomous navigat... more Autonomous Vessel with an Air Look, is a research project that aims to develop autonomous navigation of ships. The system uses three independent sources of information i.e. radar, AIS ? Automatic Identification System and cameras, which can be located on a drone or ship?s superstructure. The article presents the results of testing of an image processing system in real conditions on m/f Wolin.
2018 Baltic Geodetic Congress (BGC Geomatics), 2018
This article presents the conception and assumptions of innovative technology under the acronym A... more This article presents the conception and assumptions of innovative technology under the acronym AVAL - Autonomous Vessel with an Air Look concerning on Unmanned Surface Vehicle (USV) which applies UAV for the collection of additional navigation data. The AVAL technology is now developed as an R & D project co-financed by the National Research and Development Center in Poland. The aim of the AVAL project [1] is developing a technology of autonomous marine vessel, which is integrated with navigation devices, autopilots and control systems of the modern ship. AVAL constitutes a breakthrough innovation in the market of maritime transport. One of them is UAV, which is responsible for observation, detection, and recognition of objects in the nearby area. Others are autonomous navigation, automatic negotiations and communication.
This paper presents a new version of Routes Generation Matri x Algorithm, called Routes Generatio... more This paper presents a new version of Routes Generation Matri x Algorithm, called Routes Generation Matrix Improved Algorithm (RGMIA ), for determining routes with optimal travel time in public transport network. The me thod was implemented and tested on the real public transport network in Warsaw city. T his network was completed with walk links and therefore resultant routes are more prac tic l and can perform various users’ preferences. Effectiveness of the improved method w as compared in two aspects: time complexity and quality of results, with another two alg orithms previous version of Routes Generation Matrix Algorithm (RGMA) and Routes Gener ation Genetic Algorithm (RGGA). RGMA and RGGA algorithms were described in previous a thor’s papers [9,10].
Biocybernetics and Biomedical Engineering, 2021
Sensors, 2020
A single anti-collision trajectory generation problem for an “own” vessel only is significantly d... more A single anti-collision trajectory generation problem for an “own” vessel only is significantly different from the challenge of generating a whole set of safe trajectories for multi-surface vehicle encounter situations in the open sea. Effective solutions for such problems are needed these days, as we are entering the era of autonomous ships. The article specifies the problem of anti-collision trajectory planning in many-to-many encounter situations. The proposed original multi-surface vehicle beam search algorithm (MBSA), based on the beam search strategy, solves the problem. The general idea of the MBSA involves the application of a solution for one-to-many encounter situations (using the beam search algorithm, BSA), which was tested on real automated radar plotting aid (ARPA) and automatic identification system (AIS) data. The test results for the MBSA were from simulated data, which are discussed in the final part. The article specifies the problem of anti-collision trajectory p...
Annual of Navigation, 2017
The paper presents a concept of the new algorithm solving Last Moment Manoeuvre problem. Last Mom... more The paper presents a concept of the new algorithm solving Last Moment Manoeuvre problem. Last Moment Manoeuvre means that action taken only by one vessel is not enough to avoid collision. This is why both vessels have to synchronize their manoeuvres to pass each other. The main focus of the proposed solution is concentrated on the procedure defining the best possible manoeuvre for each vessel when avoiding a collision is no longer possible. For simplification, the assumption that the parameters of the vessels involved in the Last Moment Manoeuvre meet Standards for Ships Manoeuvrability set out in the IMO resolution, will be adopted. The algorithm presented in the paper will be implemented and tested in the commercial system.
Annals of Operations Research, 2016
The orienteering problem (OP) is defined on a graph with scores assigned to the vertices and weig... more The orienteering problem (OP) is defined on a graph with scores assigned to the vertices and weights attached to the links. The objective of solutions to the OP is to find a route over a subset of vertices, limited in length, that maximizes the collective score of the vertices visited. In this paper we present a new, efficient method for solving the OP, called the evolution-inspired local improvement algorithm (EILIA). First, a multi-stage, hill climbing-based method is used to improve an initial random population of routes. During the evolutionary phase, both feasible and infeasible (routes that are too long) parts of the solution space are explored and exploited by the algorithm operators. Finally, infeasible routes are repaired by a repairing method. Computer testing of EILIA is conducted on popular data sets, as well as on a real transport network with 908 nodes proposed by the authors. The results are compared to an exact method (branch and cut) and to the best existing algorithms for OP. The results clearly show that EILIA outperforms existing heuristic methods in terms of the quality of its solutions. In many cases, EILIA produces the same results as the exact method.
Lecture Notes in Computer Science, 2011
A public transport route planner provides for citizens and tourists information about available p... more A public transport route planner provides for citizens and tourists information about available public transport journeys. The heart of such systems are effective methods for solving itinerary planning problem in a multi-modal urban public transportation networks. This paper describes a new evolutionary algorithm solving a certain version of this problem. The method returns the set of k-journeys that lexicographically optimize two criteria's: total travel time and number of transfers. Proposed algorithm was compared with two another solutions for itinerary planning problem. This comparison is prepared on the base of experimental results which were performed on real-life data - Warsaw city public transport network. Conducted experiments confirm high effectiveness of the proposed method in comparison with two another known solutions for considered problem.
6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07), 2007
With the increase of cars on the streets, more and more people in big cities, decide to move from... more With the increase of cars on the streets, more and more people in big cities, decide to move from one place to another by public transport, such as tram, metro or bus. Public transport users need detail informations about network connections. Therefore, some urban portals offer to use systems of optimization of public transport travel. However, finding one or several optimal routes, according to user preferences, is a difficult problem. This paper presents an original method for determining optimal paths in public transportation network. Author describes a network model with time- dependent and bi-modal links, defines the problem of finding optimal routes with users' preferences and proposes algorithm, which can be a solution of this problem.
The analysis of dependences between parameters of core on light propagation in ring-core optical ... more The analysis of dependences between parameters of core on light propagation in ring-core optical fibers is presented in this paper. Authors try to find the answer on following question: How should we establish values of gabarit parameters of optical fiber and index of refraction for core and cladding, to get desirable distribution of electric field in transverse intersecction of ring-core fiber. The answer on above mentioned important question is settled on the ground results of many computer simulations, which are implementation of two-step theoretical model for this kind of optical fibers.
Lecture Notes in Computer Science, 2011
The selective travelling salesman problem (STSP) appears in various applications. The paper prese... more The selective travelling salesman problem (STSP) appears in various applications. The paper presents a new version of this problem called the selective travelling salesman problem on a road network (R-STSP). While in the classical STSP a graph is complete and each vertex can be visited at most once, in R-STSP these two constraints are not obligatory which makes the problem more real-life and applicable. To solve the problem, the memetic algorithm (MA) is proposed. After implementing the MA, computer experiments were conducted on the real transport network in Poland. The comparative study of the MA with the genetic algorithm (GA) shows that the MA outperforms the GA.
Communications in Computer and Information Science, 2010
This paper presents a new evolutionary algorithm, called Routes Generation Evolutionary Algorithm... more This paper presents a new evolutionary algorithm, called Routes Generation Evolutionary Algorithm with Knowledge (RGEAwK), for determining routes with optimal travel time in graph which models public transport network. The method was implemented and tested on the real transport network. Effectiveness of the method was compared with Routes Generation Matrix Algorithm (RGMA) [8]. This comparison is based on experimental results which were performed on realistic data. The paper ends with some remarks about future work on improving of RGEAwK.