Next Article in Journal
Multithreading-Based Algorithm for High-Performance Tchebichef Polynomials with Higher Orders
Next Article in Special Issue
Connected and Autonomous Vehicle Scheduling Problems: Some Models and Algorithms
Previous Article in Journal
Hybrid Particle Swarm Optimization-Jaya Algorithm for Team Formation
Previous Article in Special Issue
Mixed Graph Colouring as Scheduling a Partially Ordered Set of Interruptible Multi-Processor Tasks with Integer Due Dates
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Improved Negotiation-Based Approach for Collecting and Sorting Operations in Waste Management and Recycling

by
Massimiliano Caramia
1,*,† and
Giuseppe Stecca
2,†
1
Department of Enterprise Engineering, University of Rome “Tor Vergata”, 00133 Rome, Italy
2
Institute of Systems Analysis and Computer Science “Antonio Ruberti”, National Research Council, 00185 Rome, Italy
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Algorithms 2024, 17(9), 380; https://doi.org/10.3390/a17090380
Submission received: 2 July 2024 / Revised: 7 August 2024 / Accepted: 21 August 2024 / Published: 27 August 2024
(This article belongs to the Special Issue 2024 and 2025 Selected Papers from Algorithms Editorial Board Members)

Abstract

This paper addresses the problem of optimal planning for collection, sorting, and recycling operations. The problem arises in industrial waste management, where distinct actors manage the collection and the sorting operations. In a weekly or monthly plan horizon, they usually interact to find a suitable schedule for servicing customers but with a not well-defined scheme. We proposal an improved negotiation-based approach using an auction mechanism for optimizing these operations. Two interdependent models are presented: one for waste collection by a logistics operator and the other for sorting operations at a recycling plant. These models are formulated as mixed-integer linear programs where costs associated with sorting and collection are to be minimized, respectively. We describe the negotiation-based approach involving an auction where the logistics operator bids for collection time slots, and the recycling plant selects the optimal bid based on the integration of sorting and collection costs. This approach aims to achieve an optimization of the entire waste management process. Computational experiments are presented.
Keywords: waste management; optimization; auctions; negotiation approaches waste management; optimization; auctions; negotiation approaches

Share and Cite

MDPI and ACS Style

Caramia, M.; Stecca, G. An Improved Negotiation-Based Approach for Collecting and Sorting Operations in Waste Management and Recycling. Algorithms 2024, 17, 380. https://doi.org/10.3390/a17090380

AMA Style

Caramia M, Stecca G. An Improved Negotiation-Based Approach for Collecting and Sorting Operations in Waste Management and Recycling. Algorithms. 2024; 17(9):380. https://doi.org/10.3390/a17090380

Chicago/Turabian Style

Caramia, Massimiliano, and Giuseppe Stecca. 2024. "An Improved Negotiation-Based Approach for Collecting and Sorting Operations in Waste Management and Recycling" Algorithms 17, no. 9: 380. https://doi.org/10.3390/a17090380

APA Style

Caramia, M., & Stecca, G. (2024). An Improved Negotiation-Based Approach for Collecting and Sorting Operations in Waste Management and Recycling. Algorithms, 17(9), 380. https://doi.org/10.3390/a17090380

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop