Void Vertex Genetic Algorithm for Production-Distribution Supply Chain with GTSP Model

Abstract

In some instances of production supply chain problems, triangular inequality constraint does not hold for the cost functions. This study aims at solving a special case of these problems, where the triangular inequality constraint still remains valid for the delivery cost within districts. After transforming the particular problem \u00a0to \u00a0the \u00a0second \u00a0kind \u00a0of \u00a0Generalized \u00a0Travelling \u00a0Salesman \u00a0Problem \u00a0(GTSP), \u00a0an \u00a0innovative \u00a0genetic algorithm using generalized chromosomes with void vertices is employed to solve the special GTSP problem. Case \u00a0study \u00a0of \u00a0simulation \u00a0for \u00a0benchmark \u00a0test \u00a0problems \u00a0shows \u00a0that \u00a0the \u00a0proposed \u00a0algorithm \u00a0is \u00a0considerably successful.