IMPROVED PARALLEL UNIVERSES ALGORITHM: AN EVOLUTIONARY ALGORITHM FOR COMBINATORIAL OPTIMIZATION

Authors

DOI:

https://doi.org/10.23055/ijietap.2020.27.4.3683

Keywords:

Metaheuristic, evolutional algorithms, parallel universes algorithm, vehicle routing problem, hybrid flow shop scheduling problem

Abstract

This paper presents a basic approach to parallel universes algorithm (PU), and also a new version of PU. The new version is called the improved parallel universes (IPU) algorithm and is based on focusing on the solutions with a higher probability of improvement and two other strategies. These changes caused the IPU algorithm speed and optimality beyond what is achieved by the PU algorithm. The efficiency of the IPU algorithm is evaluated with the test function. Also, to take a closer look at the ability of the proposed algorithm, its performance is studied in the "capacitated vehicle routing problem" (CVRP) and "hybrid flow shop scheduling problem" (HFS), these two problems are selected because of their different structures. The results of the proposed algorithm on these two problems are compared with the results of several metaheuristic algorithms and the results indicate that the proposed algorithm is able to compete with other metaheuristic algorithms.

Published

2021-04-13

How to Cite

Akbari Bayat, A., & Didaver, F. (2021). IMPROVED PARALLEL UNIVERSES ALGORITHM: AN EVOLUTIONARY ALGORITHM FOR COMBINATORIAL OPTIMIZATION. International Journal of Industrial Engineering: Theory, Applications and Practice, 27(4). https://doi.org/10.23055/ijietap.2020.27.4.3683

Issue

Section

Logistics and Material Handling