Skip to main navigation Skip to search Skip to main content

Temporally adaptive co-operation schemes

  • Silesian University of Technology

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

5 Citations (Scopus)

Abstract

Selecting an appropriate co-operation scheme in parallel evolutionary algorithms is an important task and it should be undertaken with care. In this paper, we introduce the temporally adaptive schemes, and apply them in our parallel memetic algorithm for solving the vehicle routing problem with time windows. The experimental results revealed that this approach allows for retrieving better solutions in much shorter time compared with other cooperation schemes. The analysis is backed up with the statistical tests, which gave the clear evidence that the results are important. We report one new world’s best solution to the benchmark problem obtained using our adaptive co-operation scheme.

Original languageEnglish
Title of host publicationLecture Notes on Data Engineering and Communications Technologies
PublisherSpringer Science and Business Media Deutschland GmbH
Pages145-156
Number of pages12
DOIs
Publication statusPublished - 2017

Publication series

NameLecture Notes on Data Engineering and Communications Technologies
Volume1
ISSN (Print)2367-4512
ISSN (Electronic)2367-4520

Keywords

  • Co-operation
  • Memetic algorithm
  • Parallel algorithm
  • VRPTW

ASJC Scopus subject areas

  • Media Technology
  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Computer Networks and Communications
  • Information Systems

Fingerprint

Dive into the research topics of 'Temporally adaptive co-operation schemes'. Together they form a unique fingerprint.

Cite this