Miroslaw Blocho, Jakub Nalepa

This website provides a ready-to-use feasibility checker for PDPTW solutions. The software is free to use for research, non-commercial purposes, provided that the following papers are cited in the works that exploit the checker.


  1. J. Nalepa, M. Blocho Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows,” Soft Computing, DOI: 10.1007/s00500-015-1642-4, pp. 1-19, 2015.
  2. J. Nalepa, M. Blocho Co-operation in the parallel memetic algorithm,” International Journal of Parallel Programming, DOI: 10.1007/s10766-014-0343-4, pp. 1-28, 2014.

    3. The software is available here, and the exemplary solution file can be accessed here.

Updated: April 27, 2015