This thesis proposes an optimum semi-staticvirtual circuit routing method in connection-orientedcommunication network using Heuristic Algorithm,developed from Genetic Algorithm, Tabu Search, andEvolutionary Computing. The routing constraints are theprobability of packet loss in virtual circuit due tothe blocking of packet at the switch output buffer. This thesis also proposes a method to assigninitial solution, used to search the optimum point ofHeuristic Algorithm. The initial solution is assignedby either a set of virtual circuit route, obtained fromminimum hop route technique or from least load routeone. The tested result of optimum virtual circuitrouting using the proposed Heuristic Algorithm for anynetwork sizes shows that the routes obtained are betterthan those obtained from minimum hop route and leastload route techniques. In this thesis, the comparisonresults of the number of iteration in calculation forHeuristic Algorithm which the number of mother vectorsand the number of sun vectors are assigned by severalvalues show that increasing the number of mothervectors and the number of sun vectors, the number ofiteration is decreased.