Browsing M.S. Theses by Subject "Traveling-salesman problem."

Now showing items 1-3 of 3

A heuristic solution procedure for the constrained node routing problem and an implementation to hazardous solid waste collection

Akyüz, Ali Tümer. (Thesis (M.S.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 1992., 1992.)

Constrained Node Routing is a well known Vehicle Routing Problem which has many real-life applications. In this study, first the general VRP is introduced together with solution procedures and its application to Solid Waste ...
Four heuristic solution procedures to the travelling salesman problem and an application to the multi-depot vehicle routing problem

Tovya, Yasef. (Thesis (M.S.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 1983., 1983.)

This study consists of two parts. In the first part, four heuristic algorithms for solving the Travelling Salesman Problem (TSP) is developed. Given a graph, the first algorithm forms a subgraph in which the necessary ...
Solving the profitable tour problem using ant colony system

Açıl, Aykun. (Thesis (M.S.)-Bogazici University. Institute for Graduate Studies in Science and Engineering, 2008., 2008.)

The Traveling Salesman Problem (TSP) is one of the most widely studied combinatorial optimization problems. Many heuristic algorithms such as tabu search, genetic algorithm, and simulated annealing are applicable to this ...

Search Digital Archive