A multi-agent based cooperative approach to scheduling and routing

dc.contributor
University of Stirling
dc.contributor
University of Portsmouth
dc.contributor
University of Southampton
dc.contributor
University of Nottingham
dc.contributor
Queen Mary University of London
dc.contributor
Universitat Oberta de Catalunya. Internet Interdisciplinary Institute (IN3)
dc.contributor.author
Ouelhadj, Djamila
dc.contributor.author
Beullens, Patrick
dc.contributor.author
Ozcan, Ender
dc.contributor.author
Juan Pérez, Ángel Alejandro
dc.contributor.author
Burke, Edmund K.
dc.contributor.author
Martin, Simon
dc.date
2019-04-04T16:56:41Z
dc.date
2019-04-04T16:56:41Z
dc.date
2016-03-04
dc.identifier.citation
Martin, S., Ouelhadj, D., Beullens, P., Ozcan, E., Juan Pérez, A.A. & Burke, E.K. (2016). A multi-agent based cooperative approach to scheduling and routing. European Journal of Operational Research, 254(1), 169-178. doi: 10.1016/j.ejor.2016.02.045
dc.identifier.citation
0377-2217
dc.identifier.citation
2-s2.0-84992304305
dc.identifier.citation
10.1016/j.ejor.2016.02.045
dc.identifier.uri
http://hdl.handle.net/10609/92912
dc.description.abstract
In this paper, we propose a general agent-based distributed framework where each agent is implementing a different metaheuristic/local search combination. Moreover, an agent continuously adapts itself during the search process using a direct cooperation protocol based on reinforcement learning and pattern matching. Good patterns that make up improving solutions are identified and shared by the agents. This agent-based system aims to provide a modular flexible framework to deal with a variety of different problem domains. We have evaluated the performance of this approach using the proposed framework which embodies a set of well known metaheuristics with different configurations as agents on two problem domains, Permutation Flow-shop Scheduling and Capacitated Vehicle Routing. The results show the success of the approach yielding three new best known results of the Capacitated Vehicle Routing benchmarks tested, whilst the results for Permutation Flow-shop Scheduling are commensurate with the best known values for all the benchmarks tested.
dc.format
application/pdf
dc.language.iso
eng
dc.publisher
European Journal of Operational Research
dc.relation
European Journal of Operational Research, 2016, 254(1)
dc.relation
https://www.sciencedirect.com/science/article/pii/S0377221716300984?via%3Dihub
dc.relation
info:eu-repo/grantAgreement/EP/J017515/1
dc.rights
CC BY
dc.rights
<a href="http://creativecommons.org/licenses/by/3.0/es/">http://creativecommons.org/licenses/by/3.0/es/</a>
dc.subject
cooperative search
dc.subject
combinatorial optimization
dc.subject
scheduling
dc.subject
vehicle routing
dc.subject
metaheuristics
dc.subject
optimització combinatòria
dc.subject
planificació
dc.subject
ruta per a vehicles
dc.subject
metaheuristiques
dc.subject
cerca cooperativa
dc.subject
optimización combinatoria
dc.subject
planificación
dc.subject
ruta para vehículos
dc.subject
metaheurísticas
dc.subject
búsqueda cooperativa
dc.subject
Autonomous vehicles
dc.subject
Vehicles autònoms
dc.subject
Vehículos autónomos
dc.title
A multi-agent based cooperative approach to scheduling and routing
dc.type
info:eu-repo/semantics/article


Ficheros en el ítem

FicherosTamañoFormatoVer

No hay ficheros asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Articles [361]