Skip to main navigation Skip to search Skip to main content

A parallel algorithm for minimizing the fleet size in the pickup and delivery problem with time windows

  • ABB IT

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

1 Citation (Scopus)

Abstract

In this paper, we propose a parallel guided ejection search algorithm to minimize the eet size in the NP-hard pickup and delivery problem with time windows. The parallel processes co-operate periodically to enhance the quality of results and to accelerate the convergence of computations. The experimental study shows that the parallel algorithm retrieves very high-quality results. Finally, we report 13 (22% of all considered benchmark tests) new world's best solutions.

Original languageEnglish
Title of host publicationProceedings of the 22nd European MPI Users' Group Meeting, EuroMPI 2015
PublisherAssociation for Computing Machinery
ISBN (Electronic)9781450337953
DOIs
Publication statusPublished - 21 Sept 2015
Event22nd European MPI Users' Group Meeting, EuroMPI 2015 - Bordeaux, France
Duration: 21 Sept 201523 Sept 2015

Publication series

NameACM International Conference Proceeding Series
Volume21-23-September-2015

Conference

Conference22nd European MPI Users' Group Meeting, EuroMPI 2015
Country/TerritoryFrance
CityBordeaux
Period21/09/1523/09/15

Keywords

  • Heuristics
  • MPI
  • PDPTW

ASJC Scopus subject areas

  • Software
  • Human-Computer Interaction
  • Computer Vision and Pattern Recognition
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'A parallel algorithm for minimizing the fleet size in the pickup and delivery problem with time windows'. Together they form a unique fingerprint.

Cite this