The goal of the TSP is to find the shortest possible route that visits each city exactly once and returns to the origin city. In this project, we apply multiple methods to find the optimal or ...

Recently it has been shown how various results on the behaviour of exact and approximate primal algorithms for certain discrete location problems can be obtained by studying the more general problem ...

Abstract: A problem of optimal capacity planning of the process production lines (foundry for example) in accordance with a given output plan is considered as a discrete location problem on a network.

Traveling Salesman Problem: Given a set of cities and distance between every pair of cities, find the shortest tour that visits every city exactly ones and returns to the starting point. It turns out ...

Abstract: The Greedy Permuting Method (GPM) is a method introduced for initial population generation in the Genetic Algorithm (GA). For a test problem with 280 cities, the generated initial population ...