This comprehensive reference text discusses evolutionary optimization techniques, to find
optimal solutions for single and multi-objective problems. The text presents each …

Many combinatorial computational problems have been effectively solved by means of
hyper-heuristics. In this study, we focus on a problem proposed by Kiwi. com and solve this …

This research compares and contrasts the performance of 11 optimisation algorithms and
two new combined optimisation algorithms for solving the last mile delivery problem. The …

Prediction of the quality of the result provided by a specific solving method is an important
factor when choosing how to solve a given problem. The more accurate the prediction, the …

This paper proposes a novel discrete bio-inspired chicken swarm optimization algorithm
(CSO) to solve the problem of the traveling salesman problem (TSP) which is one of the …

In this study, a new initial solution heuristic was proposed for the traveling salesman
problem. The proposed maxS method is based on a new distance matrix obtained by …

Abstract Combinatorial Problems (NP hard Problem) have always been a hard task to be
solved to optimal level but for the efficiency and finding the best possible solution in a certain …

Travelling Salesman Problem (TSP) is considered non-deterministic polynomial time hard
(NP hard) problem that cannot be solved traditionally especially when the number of cities …

This paper presents a deterministic algorithm for approximating the solution of the
Symmetric Traveling Salesman Problem (STSP) using a multi perfect matching and …

Kiwi. com proposed a real-world NP-hard optimisation problem with a focus on air travelling
services, determining the cheapest connection between specific areas. Despite some …