Multi-agent Negotiation for the Multi-Objective Vehicle Routing Problem with Time Windows and Privacy Constraints
Luiza Pellin Biasoto (Universidade de São Paulo)
Vinicius Renan de Carvalho (Universidade de São Paulo)
Pradeep K. Murukannaiah (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Jaime Simão Sichman (Universidade de São Paulo)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
We present a novel approach to address the Multi-Objective Vehicle Routing Problem with Time Windows (VRPTW) and Privacy Constraints in supply chain optimization. While conventional vehicle routing models are limited to a single objective, such as cost minimization, real-world applications involve multiple, often conflicting, criteria such as demand prioritization, inventory cost reduction, and service level maximization. A significant challenge arises as customers often conceal these objectives to maintain strategic negotiating positions. To address this, we propose a hybrid multi-agent framework that integrates a multi-objective optimization algorithm with a negotiation system. Within this framework, a supplier agent generates a set of Pareto-optimal solutions through a Multi-Objective Evolutionary Algorithm (MOEA). Subsequently, customer agents negotiate using the Multiple Offers Protocol for Multilateral Negotiations with Partial Consensus (MOPaC) to systematically identify a solution that maximizes collective utility. The efficacy and viability of this approach were validated using the Solomon benchmark instances. The proposed framework is modular, enabling the integration of various optimization algorithms and negotiation protocols to solve complex multi-agent optimization problems under privacy constraints.
Files
File under embargo until 17-04-2027