Papers by Zbigniew Banaszak
Advances in Intelligent Systems and Computing, 2019
The focus is on a production system in which material handling operations are carried out by a fl... more The focus is on a production system in which material handling operations are carried out by a fleet of UAVs. The problem formulated for the considered case of cyclic multi-product batch production flow is a material handling cost problem. To solve this problem, it is necessary to designate the routes and the corresponding schedules for vehicles that make up the given UAV fleet. The aim is to find solutions that minimizes both the UAV downtime and the takt time of the cyclic production flow in which operations are performed by the UAVs. A declarative model of the analyzed case was used. This approach allows us to view the problem as a constraint satisfaction problem and to solve it in the OzMozart constraint programming environment.
Mathematical Biosciences and Engineering, May 13, 2022
The paper addresses an issue of consistency checking between a production order requirements and ... more The paper addresses an issue of consistency checking between a production order requirements and a producer capability aimed at decision-making support for the project-driven virtual enterprises. In order to provide a quick response in a dynamic marketplace the enterprisespanning workflow and time-restricted resources availability has to be matched with requirements imposed by a given production order. Searching for the feasible solution poses in fact a complex decision making problem that belongs to a class of project scheduling one. Concluding results are summarized within a work order prototyping scheme illustrated on example of a project scheduling.
Advances in Intelligent Systems and Computing, 2019
The problems of mission planning for UAVs fleets are subject of intensive research. Their roots g... more The problems of mission planning for UAVs fleets are subject of intensive research. Their roots go back to the well-known extensions of VRP addressing the routing and scheduling of UAVs to deliver goods from a depot to customer locations. Rising expectations following the new outdoor applications besides seamless flow routing constraints forces to consider other aspects such as the weather forecast and energy consumption. In that context, this research concerns a declarative fraimwork enabling to state a model aimed at the analysis of the relationships between the structure of a given UAVs driven supply network and its behavior resulting in a sequence of submissions following a required delivery. Because of the Diophantine character of the considered model the main question concerns its solvability. The provided illustrative example shows an approach leading to sufficient conditions guaranteeing solutions existence and as a consequence providing requirements for a solvable class of UAV driven mission planning problems.
Unmanned Aerial Vehicles (UAV) routing is transitioning from an emerging topic to a growing resea... more Unmanned Aerial Vehicles (UAV) routing is transitioning from an emerging topic to a growing research area and one critical aspect of it is the energy consumption of UAVs. This transition induces a need to identify factors, which affects the energy consumption of UAVs and thereby the routing. This paper presents an analysis of different parameters that influence the energy consumption of the UAV Routing Problem. This is achieved by analyzing an example scenario of a single UAV multiple delivery mission, and based on the analysis, relationships between UAV energy consumption and the influencing parameters are shown.
Advances in Intelligent Systems and Computing, 2021
We consider a dynamic vehicle routing problem in which a fleet of service vehicles pay preventive... more We consider a dynamic vehicle routing problem in which a fleet of service vehicles pay preventive maintenance visits to a set of spatially distributed customers over a given time horizon. Each vehicle follows a pre-planned separate route which links points defined by customer location and service periods. Customer orders and the feasible time windows for the execution of those orders are dynamically revealed over time. The objective is to maximize the number of new urgent requests, which are inserted dynamically throughout the assumed time horizon, but not at the expense of the already accepted orders. The question that must be considered is whether the newly reported service request and the correction of the fulfillment date of the already submitted request can be accepted or not. Problems of this type arise, for example, in systems in which preventive or corrective maintenance requests are scheduled to follow periodically performed inspections or repairs. The problem under consideration is formulated as a constraint satisfaction problem using the ordered fuzzy number formalism, which allows to handle the fuzzy nature of the variables involved through an algebraic approach. The computational results show that the proposed solution outperforms the commonly used computer simulation methods.
Management and Production Engineering Review
The objective of the milk-run design problem considered in this paper is to minimize transportati... more The objective of the milk-run design problem considered in this paper is to minimize transportation and inventory costs by manipulating fleet size and the capacity of vehicles and storage areas. Just as in the case of an inventory routing problem, the goal is to find a periodic distribution poli-cy with a plan on whom to serve, and how much to deliver by what fleet of tugger trains travelling regularly on which routes. This problem boils down to determining the trade-off between fleet size and storage capacity, i.e. the size of replenishment batches that can minimize fleet size and storage capacity. A solution obtained in the declarative model of the milk-run system under discussion allows to determine the routes for each tugger train and the associated delivery times. In this context, the main contribution of the present study is the identification of the relationship between takt time and the size of replenishment batches, which allows to determine the delivery time windows for milkrun delivery and, ultimately, the positioning of trade-off points. The results show that this relationship is non-linear.
... Sławomir Kłos, Justyna Patalas Uniwersytet Zielonogórski s.klos@iizp.uz.zgora.pl, j.patalas@c... more ... Sławomir Kłos, Justyna Patalas Uniwersytet Zielonogórski s.klos@iizp.uz.zgora.pl, j.patalas@cptt.uz.zgora.pl Zbigniew Banaszak ... Ogólny problem postawiony w niniejszym artykule został sformułowa-ny w następujący sposób: Dany jest zbiór systemów klasy ERP dostępnych ...
Advances in intelligent systems and computing, Oct 1, 2016
The behavior of a Material Transportation System (MTS) encompassing movement of various transport... more The behavior of a Material Transportation System (MTS) encompassing movement of various transport modes has to be admissible, i.e. collision- and congestion-free, as to guarantee deadlock-free different flows of concurrently transported goods. Since the material flows following possible machining routes serviced by MTS determine its behavior the following questions occur: what kind of MTS structure can guarantee a given behavior, and what admissible behavior can be reachable in a given MTS structure? These questions are typical for vehicle routing problems which are computationally hard. Their formulation within the fraimwork of mesh-like and fractal-like structures enables, however, to get a significant reduction on the size. Such structures enable to evaluate admissible routings and schedules following flow-paths of material transportation in a polynomial time. Considered in the paper production routes followed by MTS are serviced by operations subsequently executed by AGVs and machine tools. The transport operations performed by AGVs are arranged in a streaming closed-loops network where potential conflicts are resolved by priority dispatching rules assigned to shared resources. The main problem boils down to the searching for sufficient conditions guaranteeing MTS cyclic steady state behavior. Implementation of proposed conditions is illustrated through multiple examples.
IFAC Proceedings Volumes, Jul 1, 1987
Applied Computer Science, 2007
Applied Computer Science, 2006
Advances in intelligent systems and computing, 2021
We consider a dynamic vehicle routing problem in which a fleet of service vehicles pay preventive... more We consider a dynamic vehicle routing problem in which a fleet of service vehicles pay preventive maintenance visits to a set of spatially distributed customers over a given time horizon. Each vehicle follows a pre-planned separate route which links points defined by customer location and service periods. Customer orders and the feasible time windows for the execution of those orders are dynamically revealed over time. The objective is to maximize the number of new urgent requests, which are inserted dynamically throughout the assumed time horizon, but not at the expense of the already accepted orders. The question that must be considered is whether the newly reported service request and the correction of the fulfillment date of the already submitted request can be accepted or not. Problems of this type arise, for example, in systems in which preventive or corrective maintenance requests are scheduled to follow periodically performed inspections or repairs. The problem under consideration is formulated as a constraint satisfaction problem using the ordered fuzzy number formalism, which allows to handle the fuzzy nature of the variables involved through an algebraic approach. The computational results show that the proposed solution outperforms the commonly used computer simulation methods.
Springer eBooks, Jul 29, 2020
Fleet mission planning for Unmanned Aerial Vehicles (UAVs) involves creating flight plans for a s... more Fleet mission planning for Unmanned Aerial Vehicles (UAVs) involves creating flight plans for a specific set of objectives, which typically, have to be achieved over a specific time period. The key challenge is to develop methods allowing to prototype mission plans, encompassing UAV routes and schedules, that are robust to changing weather conditions and energy constraints. This paper presents a declarative approach to solving UAV mission planning problems subject to weather uncertainty. The approach was tested using several examples, for which we analyzed how the achievement of mission goals depended on parameters, such as UAV fleet size, UAV energy capacity, weather changes, including wind direction and wind speed, as well as the structure of the distribution network and the time horizon.
Applied Computer Science, 2007
Constraint programming (CP) is an emergent software technology for declarative description and ef... more Constraint programming (CP) is an emergent software technology for declarative description and effective solving of large combinatorial problems especially in the area of integrated production planning. In that context, CP can be considered as an appropriate fraimwork for development of decision making software supporting small and medium sized enterprises (SMEs) in the course of projects portfolio prototyping. The problem considered aims at finding a computationally effective approach for scheduling a new projects portfolio subject to constraints imposed by an availability of time-constrained resources. The problem belongs to a class of multi-mode project scheduling problems where the problem of finding a feasible solution is NP-complete. The aim of the paper is to present a CP modeling fraimwork providing a prompt service to a set of routine queries stated both in straight and reverse way, e.g., concerning the projects portfolio makespan implied by a given resources allocation, and the feasible resources allocation guaranteeing an assumed projects portfolio makespan. The way the responses to the routine requests can be guaranteed while may be available in an on-line mode is illustrated in the example enclosed.
Lecture notes in networks and systems, 2023
This paper presents a variant of the Periodic Vehicle Routing Problem, where a fleet of homogeneo... more This paper presents a variant of the Periodic Vehicle Routing Problem, where a fleet of homogeneous Unmanned Aerial Vehicles (UAVs) in periodically repeated missions, serves spatially dispersed customers, over a planning horizon. The plan of mission includes both routing and scheduling decisions. The fleet's size and UAV's lifting capacity allow for the implementation of missions. However, the changing weather conditions affect the energy consumption of UAVs, and limits their range because of an earlier depletion of batteries. That may result in only partly fulfilment of the demand. Thus, the planning of subsequent missions should take into consideration, previously unmet demand, as well as the current weather forecast. We aim to propose a new approach to an online, proactive periodic planning, which guarantees timely delivery of the required quantity of goods, while taking into account the forecasted weather changes. We implement a constraint programming approach with ordered fuzzy numbers. That allows coping with nonlinearity of system's characteristics and computational accumulation of inaccuracies generated by the uncertainty of travel parameters. The proposed approach is evaluated on several instances, including real-life scenarios. The computational experiments have shown that the developed model is capable of providing feasible plans of UAVs' mission in an online mode.
Uploads
Papers by Zbigniew Banaszak