A Multi-Agent Approach to the Multi-Echelon Capacitated Vehicle Routing Problem

9Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The paper presents a concept and application of a multi-agent approach to modeling and optimization the Multi-Echelon Capacitated Vehicle Routing Problem. Two environments (mathematical programming (MP) and constraint logic programming (CLP)) and two types of agents were integrated. The strengths of MP and CLP, in which constraints are treated in a different way and different methods are implemented, were combined to use the strengths of both. The proposed approach is particularly important for the decision models with an objective function and many discrete decision variables added up in multiple constraints. The Two-Echelon Capacitated Vehicle Routing Problem (2E-CVRP) is an extension of the classical Capacitated Vehicle Routing Problem (CVRP) where the delivery depot-customers pass through intermediate depots (called satellites). Multi-echelon distribution systems are quite common in supply-chain and logistic systems. The presented multi-agent approach will be compared with classical mathematical programming on the same data sets. © Springer International Publishing Switzerland 2014.

Cite

CITATION STYLE

APA

Sitek, P., Wikarek, J., & Grzybowska, K. (2014). A Multi-Agent Approach to the Multi-Echelon Capacitated Vehicle Routing Problem. Communications in Computer and Information Science, 430, 121–132. https://doi.org/10.1007/978-3-319-07767-3_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free