The main goal of the master's thesis was to analyze travelling salesmen problem with additional limitations. The limitation of salesman's lifting force was entered during study. Possible calculation methods were analyzed. During the study genetic algorithm was applied, possible of handling current problem. Genetic operators, needed for solving travelling salesmen problem were created and applied. Besides that, local route optimization algorithms were implemented. Tests were accomplished and possible solutions found
It is very effective to solve the multi variable optimization problem by using hierarchical genetic ...
Abstract: Traveling salesman problem is quite known in the field of combinatorial optimization. Thro...
The multiple travelling salesman problem (MTSP) is one of the widely studied combinatorial optimizat...
Abstract: The Vehicle Routing Problem (VRP) is a complex combinatorial optimization problem that can...
Travelling Salesman Problem (TSP) is a well known problem in the combinatorial optimization area. Th...
The multiple travelling salesman problem (MTSP), an extension of the well-known travelling salesman ...
We use an interactive genetic algorithm to divide and conquer large traveling salesperson problems. ...
The multiple traveling salesmen problem (mTSP) considers the m salesmen to visit n cities. This prob...
Abstract — This paper presents the literature survey review of Travelling Salesman Problem (TSP). TS...
Genetic Algorithms use life as their model to solve difficult problems in computer science. They use...
Ovaj se rad bavi istraživanjem višekriterijskom optimizacijom na primjeru problema više trgovačkih p...
Ovaj se rad bavi istraživanjem višekriterijskom optimizacijom na primjeru problema više trgovačkih p...
This paper presents a case study of determining vehicles’ routes. The case is taken from a pharmaceu...
In delivering packages, goods, and in doing a business, location is a critical variable to control. ...
It is very effective to solve the multi variable optimization problem by using hierarchical genetic ...
It is very effective to solve the multi variable optimization problem by using hierarchical genetic ...
Abstract: Traveling salesman problem is quite known in the field of combinatorial optimization. Thro...
The multiple travelling salesman problem (MTSP) is one of the widely studied combinatorial optimizat...
Abstract: The Vehicle Routing Problem (VRP) is a complex combinatorial optimization problem that can...
Travelling Salesman Problem (TSP) is a well known problem in the combinatorial optimization area. Th...
The multiple travelling salesman problem (MTSP), an extension of the well-known travelling salesman ...
We use an interactive genetic algorithm to divide and conquer large traveling salesperson problems. ...
The multiple traveling salesmen problem (mTSP) considers the m salesmen to visit n cities. This prob...
Abstract — This paper presents the literature survey review of Travelling Salesman Problem (TSP). TS...
Genetic Algorithms use life as their model to solve difficult problems in computer science. They use...
Ovaj se rad bavi istraživanjem višekriterijskom optimizacijom na primjeru problema više trgovačkih p...
Ovaj se rad bavi istraživanjem višekriterijskom optimizacijom na primjeru problema više trgovačkih p...
This paper presents a case study of determining vehicles’ routes. The case is taken from a pharmaceu...
In delivering packages, goods, and in doing a business, location is a critical variable to control. ...
It is very effective to solve the multi variable optimization problem by using hierarchical genetic ...
It is very effective to solve the multi variable optimization problem by using hierarchical genetic ...
Abstract: Traveling salesman problem is quite known in the field of combinatorial optimization. Thro...
The multiple travelling salesman problem (MTSP) is one of the widely studied combinatorial optimizat...