Abstract

The objective of vehicle routing problem (VRP) is to deliver a set of customers with known demands on minimum-cost routes originating and terminating at the same depot. Similar to most GA that a chromosome S is a permutation of n positive integers, such that each integer is corresponding to a customer without trip delimiters. Christian Prins proposed an optimal splitting procedure to get the best solution, respecting to a given chromosome. In this paper, application of this splitting procedure to get the best solution, respecting to a sequence of vertices, produced by the heuristic approaches(or a new chromosome produced by the mutation procedure), is considered.