This page has only limited features, please log in for full access.
Improving the effectiveness of route planning, especially in road transport deliveries is a challenge we need to face in the context of advancing climate change and the sustainable development goals. The main aim of the paper is to demonstrate the above average and utilitarian significance of the multiple probabilistic traveling salesman problem (MPTSP) in the coordination and modeling of sustainable product transportation, which is a novelty at the theoretical, conceptual, methodological and empirical level. We propose a new, hybrid algorithm of solving MPTSP instances (it connects harmony search, k-means and 2-opt), which can be successfully used in economic practice for coordination and modeling of Industry 4.0. The effectiveness of proposed approach is tested using a case study of drugs distribution services and datasets obtained from the transportation enterprise located in Poland. The study focuses on the issue of planning routes, with particular emphasis on the changing demand of customers. It should be stressed that this work may be of interest to researchers but also to management practitioners. The value added of this research lies in the innovative modeling the coordination of sustainable drug transportation as an instance of MPTSP and proposing an effective method to solve it. The main research results confirm that proposed method contributes to overall sustainability of studied supply chain.
Sebastian Twaróg; Krzysztof Szwarc; Martyna Wronka-Pośpiech; Małgorzata Dobrowolska; Anna Urbanek. Multiple probabilistic traveling salesman problem in the coordination of drug transportation—In the context of sustainability goals and Industry 4.0. PLOS ONE 2021, 16, e0249077 .
AMA StyleSebastian Twaróg, Krzysztof Szwarc, Martyna Wronka-Pośpiech, Małgorzata Dobrowolska, Anna Urbanek. Multiple probabilistic traveling salesman problem in the coordination of drug transportation—In the context of sustainability goals and Industry 4.0. PLOS ONE. 2021; 16 (3):e0249077.
Chicago/Turabian StyleSebastian Twaróg; Krzysztof Szwarc; Martyna Wronka-Pośpiech; Małgorzata Dobrowolska; Anna Urbanek. 2021. "Multiple probabilistic traveling salesman problem in the coordination of drug transportation—In the context of sustainability goals and Industry 4.0." PLOS ONE 16, no. 3: e0249077.
The article discusses the utilitarian problem of the mobile collection of waste electrical and electronic equipment. Due to its $$\mathcal {NP}$$ NP -hard nature, implies the application of approximate methods to discover suboptimal solutions in an acceptable time. The paper presents the proposal of a novel method of designing the Evolutionary and Memetic Algorithms, which determine favorable route plans. The recommended methods are determined using quality evaluation indicators for the techniques applied herein, subject to the limits characterizing the given company. The proposed Memetic Algorithm with Tabu Search provides much better results than the metaheuristics described in the available literature.
Krzysztof Szwarc; Piotr Nowakowski; Urszula Boryczka. An evolutionary approach to the vehicle route planning in e-waste mobile collection on demand. Soft Computing 2021, 25, 6665 -6680.
AMA StyleKrzysztof Szwarc, Piotr Nowakowski, Urszula Boryczka. An evolutionary approach to the vehicle route planning in e-waste mobile collection on demand. Soft Computing. 2021; 25 (8):6665-6680.
Chicago/Turabian StyleKrzysztof Szwarc; Piotr Nowakowski; Urszula Boryczka. 2021. "An evolutionary approach to the vehicle route planning in e-waste mobile collection on demand." Soft Computing 25, no. 8: 6665-6680.
This paper presents a modification of the Harmony Search algorithm (HS) adjusted to an effective solving of instances of the Asymmetric Traveling Salesman Problem. The improvement of the technique spans the application of a pheromone, which, by serving the role of long-term memory, enables the improvement of the quality of determined results, especially for tasks characterized by a significant number of vertices. The publication includes the results of tests that suggest the achievement of effectiveness improvement through the modification of the HS and recommendations concerning the proper configuration of the algorithm.
Krzysztof Szwarc; Urszula Boryczka. The Pheromone-Based Harmony Search Algorithm for the Asymmetric Traveling Salesman Problem. Applied Sciences 2020, 10, 6422 .
AMA StyleKrzysztof Szwarc, Urszula Boryczka. The Pheromone-Based Harmony Search Algorithm for the Asymmetric Traveling Salesman Problem. Applied Sciences. 2020; 10 (18):6422.
Chicago/Turabian StyleKrzysztof Szwarc; Urszula Boryczka. 2020. "The Pheromone-Based Harmony Search Algorithm for the Asymmetric Traveling Salesman Problem." Applied Sciences 10, no. 18: 6422.
Mobile collection of waste electrical and electronic equipment is a collection method that is convenient for residents and companies. New opportunities to use mobile apps and internet applications facilitate the ordering of waste pickups from households and preparation of a collection plan for a waste collection company. It improves the secondary raw materials collection in a circular economy approach after recycling waste equipment. This study presents a combined methodology for improving the efficiency of e-waste collection. An online e-waste collection supporting system uses a Harmony Search algorithm for route optimization of waste collection vehicles. The results of the optimization are better compared to other artificial intelligence algorithms presented in the literature and the number of visited collection points is higher from 1.2%–6.6% depending on the compared algorithm. To increase the efficiency of waste loading and packing, a novel collection vehicle body construction is presented. The design includes the convenient loading of waste from both sides of the vehicle and the rear side being equipped with a hydraulic lift. The proposed vehicle model can be used for e-waste collection in places with limited parking spaces or where the parking time is limited, such as in densely populated city centers. The waste equipment packing efficiency increases and eliminates the necessity of including a container loading problem in the algorithm and allows increasing waste equipment number loaded in a collection vehicle.
Piotr Nowakowski; Krzysztof Szwarc; Urszula Boryczka. Combining an artificial intelligence algorithm and a novel vehicle for sustainable e-waste collection. Science of The Total Environment 2020, 730, 138726 .
AMA StylePiotr Nowakowski, Krzysztof Szwarc, Urszula Boryczka. Combining an artificial intelligence algorithm and a novel vehicle for sustainable e-waste collection. Science of The Total Environment. 2020; 730 ():138726.
Chicago/Turabian StylePiotr Nowakowski; Krzysztof Szwarc; Urszula Boryczka. 2020. "Combining an artificial intelligence algorithm and a novel vehicle for sustainable e-waste collection." Science of The Total Environment 730, no. : 138726.
This paper describes an improvement to the Harmony Search algorithm, which has been adjusted to effectively solve a problem with indisputable practical significance, i.e. Asymmetric Traveling Salesman Problem (ATSP). We modify the technique structure, enabling the value of PAR parameter to be changed dynamically, which has an impact on the frequency of greedy movements during the construction of another harmony. The article demonstrates the effectiveness of the described approach and presents a comparative study of three sets of characteristic PAR values used during the method execution. The research was conducted on a ‘test bed’ consisting of nineteen instances of the ATSP.
Krzysztof Szwarc; Urszula Boryczka. Harmony Search Algorithm with Dynamic Adjustment of PAR Values for Asymmetric Traveling Salesman Problem. Transactions on Petri Nets and Other Models of Concurrency XV 2020, 226 -238.
AMA StyleKrzysztof Szwarc, Urszula Boryczka. Harmony Search Algorithm with Dynamic Adjustment of PAR Values for Asymmetric Traveling Salesman Problem. Transactions on Petri Nets and Other Models of Concurrency XV. 2020; ():226-238.
Chicago/Turabian StyleKrzysztof Szwarc; Urszula Boryczka. 2020. "Harmony Search Algorithm with Dynamic Adjustment of PAR Values for Asymmetric Traveling Salesman Problem." Transactions on Petri Nets and Other Models of Concurrency XV , no. : 226-238.
This paper demonstrates the utilitarian significance of the Probabilistic Traveling Salesman Problem (PTSP) in planning travel routes by companies which provide distribution services for pharmacies, with a particular consideration of variable customer demand. The optimization problem was solved using the Harmony Search (HS) algorithm, thus verifying its utility based on one real instance of PTSP (representing the problem of pharmacy supply reliability) and three tasks from the public TSPLIB library (adjusted to PTSP). As a result of the conducted research, significant utility of the hybrid approach was identified, assuming the combination of HS with popular 2‑opt method, which enabled achievement of good results within acceptable period (in practical applications).
Sebastian Twaróg; Jacek Szołtysek; Krzysztof Szwarc; Urszula Boryczka. Probabilistic Traveling Salesman Problem and Harmony Search Algorithms in Pharmacy Supply Optimization. Acta Universitatis Lodziensis. Folia Oeconomica 2019, 6, 111 -125.
AMA StyleSebastian Twaróg, Jacek Szołtysek, Krzysztof Szwarc, Urszula Boryczka. Probabilistic Traveling Salesman Problem and Harmony Search Algorithms in Pharmacy Supply Optimization. Acta Universitatis Lodziensis. Folia Oeconomica. 2019; 6 (345):111-125.
Chicago/Turabian StyleSebastian Twaróg; Jacek Szołtysek; Krzysztof Szwarc; Urszula Boryczka. 2019. "Probabilistic Traveling Salesman Problem and Harmony Search Algorithms in Pharmacy Supply Optimization." Acta Universitatis Lodziensis. Folia Oeconomica 6, no. 345: 111-125.
This article is part of a study aiming to adapt the Harmony Search (HS) algorithm to the asymmetric travelling salesman problem. The population-based approach of the HS algorithm and its weak exploitation mechanism constituted a good reason for starting the research on improving the method, by applying the approach found in other population-based metaheuristics characterized by the same imperfection. The proposed HS is supplemented with the mechanism allowing the efficiency of the exploitation process to be increased by combining the algorithm with hill climbing. The proposed approach assumes modifying the solutions at three different places, affecting the HS exploration and exploitation mechanism in different ways. As a result, the appropriate approach to the effective design of hybrid harmony search is recommended. In addition, by measuring the actual time of the method's execution, the recommended ratio of time devoted to local search and the creation of harmonies was determined.
Urszula Boryczka; Krzysztof Szwarc. An effective hybrid harmony search for the asymmetric travelling salesman problem. Engineering Optimization 2019, 52, 218 -234.
AMA StyleUrszula Boryczka, Krzysztof Szwarc. An effective hybrid harmony search for the asymmetric travelling salesman problem. Engineering Optimization. 2019; 52 (2):218-234.
Chicago/Turabian StyleUrszula Boryczka; Krzysztof Szwarc. 2019. "An effective hybrid harmony search for the asymmetric travelling salesman problem." Engineering Optimization 52, no. 2: 218-234.
The present article summarizes two techniques allowing to avoid premature convergence in Harmony Search algorithm, which was adapted for solving the instances of the Asymmetric Traveling Salesman Problem (ATSP). The efficiency of both approaches was demonstrated on the basis of the results of statistical test and ‘test bed’ consisting of nineteen instances of ATSP. The conclusion was that the best results were obtained in case of applying mechanisms which enable to reset the components of harmony memory at the moment of reaching stagnation. This process is controlled by parameters which are depended on the problem size.
Krzysztof Szwarc; Urszula Boryczka. A Comparative Study of Techniques for Avoiding Premature Convergence in Harmony Search Algorithm. Computer Vision 2019, 203 -214.
AMA StyleKrzysztof Szwarc, Urszula Boryczka. A Comparative Study of Techniques for Avoiding Premature Convergence in Harmony Search Algorithm. Computer Vision. 2019; ():203-214.
Chicago/Turabian StyleKrzysztof Szwarc; Urszula Boryczka. 2019. "A Comparative Study of Techniques for Avoiding Premature Convergence in Harmony Search Algorithm." Computer Vision , no. : 203-214.
This article proposes three approaches to designing the Parallel Harmony Search Algorithm, adjusted to effectively solve the Asymmetric Traveling Salesman Problem. The paper contains a comparative study of the developed models, based on 19 varied instances of the problem, as well as recommendations concerning their appropriate configuration. The quality of developed models was assessed through determination of the percentage difference between the surplus of the values of objective function of solutions and the values describing the sequential algorithm variant. Each of the examined Parallel Harmony Search variants created better results than the sequential Harmony Search algorithm.
Krzysztof Szwarc; Urszula Boryczka. Analysis of Different Approaches to Designing the Parallel Harmony Search Algorithm for ATSP. Computer Vision 2019, 215 -227.
AMA StyleKrzysztof Szwarc, Urszula Boryczka. Analysis of Different Approaches to Designing the Parallel Harmony Search Algorithm for ATSP. Computer Vision. 2019; ():215-227.
Chicago/Turabian StyleKrzysztof Szwarc; Urszula Boryczka. 2019. "Analysis of Different Approaches to Designing the Parallel Harmony Search Algorithm for ATSP." Computer Vision , no. : 215-227.
The article aims to address a research gap concerning the adequate configuration of a Memetic Algorithm adapted to solve the Job-Shop Scheduling Problem. The goal was accomplished by means of conducting a comparative study of 16 variants of a Memetic Algorithm, characterised with different places of hybridisation and local search methods applied. The study involved the solution of eleven instances of JSP and the comparison of the results with the results achieved with an Evolutionary Algorithm lacking the mechanism of hybridisation and selected local search methods. The utilitarian significance of the problem also involved the use of assessment measures intended for both practical applications and research purposes.
Urszula Boryczka; Krzysztof Szwarc. Selected variants of a Memetic Algorithm for JSP – a comparative study. International Journal of Production Research 2019, 57, 7142 -7157.
AMA StyleUrszula Boryczka, Krzysztof Szwarc. Selected variants of a Memetic Algorithm for JSP – a comparative study. International Journal of Production Research. 2019; 57 (22):7142-7157.
Chicago/Turabian StyleUrszula Boryczka; Krzysztof Szwarc. 2019. "Selected variants of a Memetic Algorithm for JSP – a comparative study." International Journal of Production Research 57, no. 22: 7142-7157.
This article constitutes the continuation of the work on adapting the Harmony Search algorithm to effectively solve the Asymmetric Traveling Salesman Problem (ATSP) instances. The author’s modification suggested in this work enables the improvement of harmony memory during the time of running the technique, making it possible to increase the effectiveness of the technique by almost 59% (the summary average error was reduced from 13.42% to 5.54%) and to eliminate the imperfectness revealed in the previous research. The article includes a description of the approach and a comparative study spanning various variants of implementing the improvement, conducted on 19 instances of ATSP, described by means of the occurrence of 17 to 443 nodes. The achieved results were also compared with the results found in reference articles, showing a significant effectiveness of the modification.
Urszula Boryczka; Krzysztof Szwarc. The Harmony Search algorithm with additional improvement of harmony memory for Asymmetric Traveling Salesman Problem. Expert Systems with Applications 2018, 122, 43 -53.
AMA StyleUrszula Boryczka, Krzysztof Szwarc. The Harmony Search algorithm with additional improvement of harmony memory for Asymmetric Traveling Salesman Problem. Expert Systems with Applications. 2018; 122 ():43-53.
Chicago/Turabian StyleUrszula Boryczka; Krzysztof Szwarc. 2018. "The Harmony Search algorithm with additional improvement of harmony memory for Asymmetric Traveling Salesman Problem." Expert Systems with Applications 122, no. : 43-53.
The paper is an extended version of the conference article, which presents a modification of the Harmony Search algorithm, adapted to the effective resolution of the asymmetric case of the Traveling Salesman Problem. The efficacy of the proposed approach was measured with benchmarking tests and in a comparative study based on the results obtained with the Nearest Neighbor Algorithm, Greedy Local Search and Hill Climbing. The discussion also embraced the study of the convergence of the proposed algorithm and the analysis of the impact of the pitch adjustment place on the quality of the solutions.
Urszula Boryczka; Krzysztof Szwarc. The adaptation of the harmony search algorithm to the ATSP with the evaluation of the influence of the pitch adjustment place on the quality of results. Journal of Information and Telecommunication 2018, 3, 2 -18.
AMA StyleUrszula Boryczka, Krzysztof Szwarc. The adaptation of the harmony search algorithm to the ATSP with the evaluation of the influence of the pitch adjustment place on the quality of results. Journal of Information and Telecommunication. 2018; 3 (1):2-18.
Chicago/Turabian StyleUrszula Boryczka; Krzysztof Szwarc. 2018. "The adaptation of the harmony search algorithm to the ATSP with the evaluation of the influence of the pitch adjustment place on the quality of results." Journal of Information and Telecommunication 3, no. 1: 2-18.
Mobile collection of e-waste on demand is one of the methods that can contribute to an increase in the collection rate of waste. In this method, a person requests the waste pick up from a household at a preferred time. To support such a collection method an efficient algorithm and information system for convenient waste disposal for residents has to be applied. Our study investigates using artificial intelligence algorithms for solving the vehicle routing problem with time windows for a heterogeneous fleet of waste collection vehicles. We present an algorithm and a productive model of the online system enabling comprehensive communication for people that request waste equipment for collection, registering of data and solving the VRPTW. The system includes parametric models of four algorithms (simulated annealing, tabu search, greedy, bee colony optimization). The result of the optimization is the assignment of a minimal number of collection vehicles, a vehicle routing plan, timely collection of waste from a household and collection cost reduction. The study includes the simulation of e-waste collection requests in Tokyo, Philadelphia and Warsaw to compare algorithms for various urban arrangements of streets and buildings. The results show that the best of the four algorithms, to facilitate e-waste mobile collection on demand, is simulated annealing and the worst is tabu search. The proposed model and algorithm can bring significant improvement in planning the routes of the vehicles in the e-waste collection, including a positive social impact on the new method of waste collection, especially in urban areas.
Piotr Nowakowski; Krzysztof Szwarc; Urszula Boryczka. Vehicle route planning in e-waste mobile collection on demand supported by artificial intelligence algorithms. Transportation Research Part D: Transport and Environment 2018, 63, 1 -22.
AMA StylePiotr Nowakowski, Krzysztof Szwarc, Urszula Boryczka. Vehicle route planning in e-waste mobile collection on demand supported by artificial intelligence algorithms. Transportation Research Part D: Transport and Environment. 2018; 63 ():1-22.
Chicago/Turabian StylePiotr Nowakowski; Krzysztof Szwarc; Urszula Boryczka. 2018. "Vehicle route planning in e-waste mobile collection on demand supported by artificial intelligence algorithms." Transportation Research Part D: Transport and Environment 63, no. : 1-22.
The paper presents a modification of the Harmony Search algorithm, adapted to the effective resolution of the asymmetric case of the traveling salesman problem. The efficacy of the proposed approach was measured with benchmarking tests and in a comparative study based on the results obtained with the Nearest Neighbor Algorithm, Greedy Local Search and Hill Climbing. The publication also includes the comparison of the results with solutions proposed in literature, which were developed with different metaheuristic techniques.
Urszula Boryczka; Krzysztof Szwarc. The Adaptation of the Harmony Search Algorithm to the ATSP. Privacy Enhancing Technologies 2018, 341 -351.
AMA StyleUrszula Boryczka, Krzysztof Szwarc. The Adaptation of the Harmony Search Algorithm to the ATSP. Privacy Enhancing Technologies. 2018; ():341-351.
Chicago/Turabian StyleUrszula Boryczka; Krzysztof Szwarc. 2018. "The Adaptation of the Harmony Search Algorithm to the ATSP." Privacy Enhancing Technologies , no. : 341-351.
In this paper we present a computational study of how different local search methods and the choice of an algorithm stage in which they are applied affect the performance of Memetic Algorithm (MA) solving Asymmetric Traveling Salesman Problem (ATSP). This study contains a comparison of quality of solutions obtained (both in terms of the value of the objective function and the performance time of the method) by sixteen variants of the Memetic Algorithm. Considerable amount of a given problem’s instance and Wilcoxon Signed-Rank Test were used to ensure the impartiality of gained results.
Krzysztof Szwarc; Urszula Boryczka. A Comparative Study of Different Variants of a Memetic Algorithm for ATSP. Computer Vision 2017, 10449, 76 -86.
AMA StyleKrzysztof Szwarc, Urszula Boryczka. A Comparative Study of Different Variants of a Memetic Algorithm for ATSP. Computer Vision. 2017; 10449 ():76-86.
Chicago/Turabian StyleKrzysztof Szwarc; Urszula Boryczka. 2017. "A Comparative Study of Different Variants of a Memetic Algorithm for ATSP." Computer Vision 10449, no. : 76-86.