The University of Southampton
University of Southampton Institutional Repository

A variable neighbourhood search algorithm for the constrained task allocation problem

A variable neighbourhood search algorithm for the constrained task allocation problem
A variable neighbourhood search algorithm for the constrained task allocation problem
A variable neighbourhood search algorithm that employs new neighbourhoods is proposed for solving a task allocation problem whose main characteristics are: (i) each task requires a certain amount of resources and each processor has a capacity constraint which limits the total resource of the tasks that are assigned to it; (ii) the cost of solution includes fixed costs when using processors, task assignment costs, and communication costs between tasks assigned to different processors. A computational study shows that the algorithm performs well in terms of time and solution quality relative to other local search procedures that have been proposed.
task allocation problem, variable neighbourhood search, local search
0160-5682
812-822
Lusa, A.
795d7976-01e1-4aa1-97e2-271c2735cbee
Potts, C.N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Lusa, A.
795d7976-01e1-4aa1-97e2-271c2735cbee
Potts, C.N.
58c36fe5-3bcb-4320-a018-509844d4ccff

Lusa, A. and Potts, C.N. (2008) A variable neighbourhood search algorithm for the constrained task allocation problem. Journal of the Operational Research Society, 59 (6), 812-822. (doi:10.1057/palgrave.jors.2602413).

Record type: Article

Abstract

A variable neighbourhood search algorithm that employs new neighbourhoods is proposed for solving a task allocation problem whose main characteristics are: (i) each task requires a certain amount of resources and each processor has a capacity constraint which limits the total resource of the tasks that are assigned to it; (ii) the cost of solution includes fixed costs when using processors, task assignment costs, and communication costs between tasks assigned to different processors. A computational study shows that the algorithm performs well in terms of time and solution quality relative to other local search procedures that have been proposed.

Text
VNSTAPE-Prints.doc - Accepted Manuscript
Download (908kB)

More information

e-pub ahead of print date: 4 April 2007
Published date: June 2008
Keywords: task allocation problem, variable neighbourhood search, local search
Organisations: Operational Research

Identifiers

Local EPrints ID: 149857
URI: http://eprints.soton.ac.uk/id/eprint/149857
ISSN: 0160-5682
PURE UUID: c927296b-3159-438a-a696-7fad00665ac7

Catalogue record

Date deposited: 04 May 2010 08:22
Last modified: 09 Dec 2019 20:27

Export record

Altmetrics

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×