Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNeumann, F.en
dc.contributor.authorWitt, C.en
dc.identifier.citationProceedings of the 24th International Joint Conference on Artificial Intelligence, 2015 / Yang, Q., Wooldridge, M. (ed./s), vol.2015-January, pp.3742-3748en
dc.description.abstractEvolutionary algorithms have been frequently used for dynamic optimization problems. With this paper, we contribute to the theoretical understanding of this research area. We present the first computational complexity analysis of evolutionary algorithms for a dynamic variant of a classical combinatorial optimization problem, namely makespan scheduling. We study the model of a strong adversary which is allowed to change one job at regular intervals. Furthermore, we investigate the setting of random changes. Our results show that randomized local search and a simple evolutionary algorithm are very effective in dynamically tracking changes made to the problem instance.en
dc.description.statementofresponsibilityFrank Neumann and Carsten Witten
dc.publisherAAAI Pressen
dc.rightsCopyright © 2015 International Joint Conferences on Artificial Intelligence All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the publisher.en
dc.titleOn the runtime of randomized local search and simple evolutionary algorithms for dynamic makespan schedulingen
dc.typeConference paperen
dc.contributor.conference24th International Joint Conference on Artificial Intelligence (IJCAI 2015) (25 Jul 2015 - 31 Jul 2015 : Buenos Aires, Argentina)en
pubs.library.collectionComputer Science publicationsen
dc.identifier.orcidNeumann, F. [0000-0002-2721-3618]en
Appears in Collections:Computer Science publications

Files in This Item:
File Description SizeFormat 
RA_hdl_109197.pdfRestricted Access307.58 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.