Abstract
This research introduces the Caravan Trading Problem (CTP) which is a routing problem with an additional economic model, and attempts to optimize two different objectives, namely profit and distance, using Genetic Algorithm (GA). A hybrid GA solution using a combination of Greedy Algorithm and a tournament-based Lamarckism heuristic was developed, which was named Tournament-Based Lamarckian Genetic Algorithm (TBLGA). The result was that the proposed method was able to improve the evolutionary process by reducing the occurrence of local minima. We conclude that Lamarckian Evolution can be used to guide local search in multi objective optimization problems such as CTP.
