A multi-agent based cooperative approach to scheduling and routing

Other authors

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)

Publication date

2019-04-04T16:56:41Z

2019-04-04T16:56:41Z

2016-03-04



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.

Document Type

Article

Language

English

Publisher

European Journal of Operational Research

Related items

European Journal of Operational Research, 2016, 254(1)

https://www.sciencedirect.com/science/article/pii/S0377221716300984?via%3Dihub

info:eu-repo/grantAgreement/EP/J017515/1

Recommended 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

0377-2217

2-s2.0-84992304305

10.1016/j.ejor.2016.02.045

This item appears in the following Collection(s)

Articles [361]