Heuristic computational intelligence techniques are widely used in combinatorial
optimization problems, essentially in large size configurations. Bio-inspired heuristics such …

Abstract The Traveling Salesman Problem (TSP) is one of the standard test problems used
in performance analysis of discrete optimization algorithms. The Ant Colony Optimization …

This paper provides a detailed review of metaheuristic applications on discrete facility
location problems. The objective of this paper is to provide a concise summary of solution …

Abstract Symbiotic Organisms Search (SOS) algorithm is an effective new metaheuristic
search algorithm, which has recently recorded wider application in solving complex …

This article presented a parallel cooperative hybrid algorithm for solving traveling salesman
problem. Although heuristic approaches and hybrid methods obtain good results in solving …

The traveling salesman problem (TSP) is a classical problem in discrete or combinatorial
optimization and belongs to the NP-complete classes, which means that it may be require an …

This paper presents a novel two-stage hybrid swarm intelligence optimization algorithm
called GA–PSO–ACO algorithm that combines the evolution ideas of the genetic algorithms …

Short and reliable delivery lead times are crucial for many buying decisions, making
efficiently operated order picking systems a critical contributor to a company's …

This paper applies a hybrid simulated annealing–tabu search algorithm to solve the
Traveling Salesman Problem (TSP). Fully considering the characteristics of the hybrid …

We propose an efficient hybrid algorithm, known as ACOSS, for solving resource-
constrained project scheduling problems (RCPSP) in real-time. The ACOSS algorithm …