Please use this identifier to cite or link to this item:
http://hdl.handle.net/10609/92912
Title: | A multi-agent based cooperative approach to scheduling and routing |
Author: | Ouelhadj, Djamila Beullens, Patrick Ozcan, Ender Juan Pérez, Ángel Alejandro Burke, Edmund K. Martin, Simon |
Others: | University of Stirling University of Portsmouth University of Southampton University of Nottingham Queen Mary University of London Universitat Oberta de Catalunya. Internet Interdisciplinary Institute (IN3) |
Keywords: | cooperative search combinatorial optimization scheduling vehicle routing metaheuristics |
Issue Date: | 4-Mar-2016 |
Publisher: | European Journal of Operational Research |
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 |
Project identifier: | info:eu-repo/grantAgreement/EP/J017515/1 |
Also see: | https://www.sciencedirect.com/science/article/pii/S0377221716300984?via%3Dihub |
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. |
Language: | English |
URI: | http://hdl.handle.net/10609/92912 |
ISSN: | 0377-2217MIAR |
Appears in Collections: | Articles cientÍfics Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
multiagent.pdf | 888,76 kB | Adobe PDF | ![]() View/Open |
Share:


This item is licensed under a Creative Commons License