An Improved Meta-Heuristic Approach for Solving Large Scale Combinatorial Optimization Problems

Abstract

Metaheuristics approach for solving for solving combinatorial optimization problems is a rapidly
growing field of research. This is the due to the NP-completeness of many combinatorial optimization
problems and growing importance of combinatorial optimization problems in the industrial world.
This paper proposes an improved metaheuristics approach for solving large scale combinatorial
optimization problems, called vehicle routing problems.