Suchergebnisse

Routing vehicles is a generic decision-making problem of strategic management in any business serving customers in distributed locations with a limited fleet including municipal solid waste collection. This paper introduces an approach tailored for optimizing waste collection routes in small towns and rural areas where dead-end streets are typical in the road network. Leveraging the Traveling Salesperson Problem (TSP), the approach employs optimal route determination taking advantage of the specific character of a road network with many dead-end streets. The service area for waste collection was aggregated, so the graph representing the map results in a relatively small data instance. This facilitated the application of the exact method, i.e. Mixed-Integer Programming using the OpenSolver tool in Excel. Conducted in collaboration with a municipal agency in southeastern Poland, this study outlines a comprehensive methodology, emphasizing the reduction of complex dead-end streets into singular nodes within the graph for effective route optimization. A comprehensive methodology is outlined alongside the solutions attained. Computational experiments focused on minimizing total travel distance during waste collection operations, demonstrating the methodology's success. Beyond efficiency gains, optimized routes hold potential for significant environmental impact reduction. The reduced travel distances result in decreased fuel consumption and emissions, aligning with sustainability goals. Developing an Excel-based decision support tool for municipal solid waste management is a significant contribution, particularly for decision-makers less familiar with Operations Research. The tool's compatibility within the spreadsheet environment streamlines waste management processes for municipal units, enhancing decision-making efficiency in optimizing waste collection routes.

Nowadays, in the European Union selective solid waste management be-longs to important responsibilities of municipalities. In Solid Waste Management (SWM) the main operational task is to set a schedule for solid waste collection and to find optimal routes for garbage trucks so that the total costs of solid waste collection service can be minimized subject to a series of constraints which guarantee not only fulfillment of SWM's obligations but also desirable level of quality of that service. Optimization problem of garbage trucks routing is a special case of rich Vehicle Routing Problem as it has to cover following constraints: pickup nodes (clients) must be visited during their predefined time windows; the number and capacity of depots and specialized sorting units can-not be exceeded; each garbage truck can be assigned to at most one depot; each route should be dedicated to collecting one type of segregated solid waste, and the route must be served by a garbage truck which can collect that type of solid waste; availability of garbage trucks and their drivers must be respected; each garbage truck must be drained at a specialized sorting unit before going back to the depot. This paper contributes with a new Mixed-Integer Programming (MIP) model for the Selective Solid Waste Collection Routing Problem (SS-WCRP) with time windows, limited heterogeneous fleet, and different types of segregated solid waste to be collected separately. Utilization of MIP for solving small-sized instance of the Fleet Optimization Problem for Selective Solid Waste Collection (FOPSSWC) is and obtained results are reported.

This book constitutes the proceedings of the BPM Forum held at the 21st International Conference on Business Process Management, BPM 2023, which took place in Utrecht, The Netherlands, in September 2023. The Blockchain Forum provided a platform for exploring and discussing innovative ideas on the intersection of BPM and blockchain technology. The RPA Forum focused on the use of the Robotic Process Automation (RPA) in the field of Business Process Management. The Educators Forum brought together educators within the BPM community for sharing resources to improve the practice of teaching BPM-related topics. The 18 full papers included in this volume were carefully reviewed and selected from a total of 39 submissions.