A Distributed Non-elitist Evolutionary Scalable Asynchronous Rebuilding Algorithm for Solving Pickup and Delivery Problems with Time Windows

The pickup and delivery problem with time windows (PDPTW) is an NP-hard problem. It is a conundrum challenge to solve this problem that consistently produces near-optimal results with the least difference in magnitude. This paper presents a distributed non-elitist evolutionary scalable asynchronous rebuilding algorithm (DNESARA) to solve PDPTW. This algorithm allows the non-elitist evolutionary algorithm to perform scalable asynchronous rebuilding algorithms for a speedy attainment of high-performance solutions and take advantage of divergence and convergence power of the non-elitist evolutionary and asynchronous rebuilding algorithm. Our experiments use comprehensive Li and Lim instances and benchmarks against published algorithms and best-known solutions. The high-quality results produced by DNESARA outperform the best-known solutions, three published algorithms.