Skip to main navigation Skip to search Skip to main content

A Parallel Memetic Algorithm for the Pickup and Delivery Problem with Time Windows

  • Silesian University of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Citations (Scopus)

Abstract

Solving the pickup and delivery problem with time windows (PDPTW) is a vital research topic due to its NP-hardness and its numerous practical applications. In this paper, we propose an island-model parallel memetic algorithm for minimizing the distance in the PDPTW. In this algorithm, the processes execute the same memetic algorithm and co-operate to guide the optimization efficiently. An extensive experimental study revealed that the MPI implementation of the proposed approach retrieves very high-quality routing schedules. The analysis is coupled with appropriate statistical tests.

Original languageEnglish
Title of host publicationProceedings - 2017 25th Euromicro International Conference on Parallel, Distributed and Network-Based Processing, PDP 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1-8
Number of pages8
ISBN (Electronic)9781509060580
DOIs
Publication statusPublished - 26 Apr 2017
Event25th Euromicro International Conference on Parallel, Distributed and Network-Based Processing, PDP 2017 - St. Petersburg, Russian Federation
Duration: 6 Mar 20178 Mar 2017

Publication series

NameProceedings - 2017 25th Euromicro International Conference on Parallel, Distributed and Network-Based Processing, PDP 2017

Conference

Conference25th Euromicro International Conference on Parallel, Distributed and Network-Based Processing, PDP 2017
Country/TerritoryRussian Federation
CitySt. Petersburg
Period6/03/178/03/17

Keywords

  • PDPTW
  • Parallel algorithm
  • memetic algorithm

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Information Systems and Management

Fingerprint

Dive into the research topics of 'A Parallel Memetic Algorithm for the Pickup and Delivery Problem with Time Windows'. Together they form a unique fingerprint.

Cite this