Endüstri Mühendisliği

Permanent URI for this community

https://digitalarchive.library.bogazici.edu.tr/handle/123456789/11606

Browse

Browsing Endüstri Mühendisliği by Subject "Algorithms."

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    A survey of assembly line balancing algorithms and a proposed algorithm
    (Thesis (M.S.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 1981., 1981.) Karayalçın, Alpaslan.; Evranuz, Çetin.
  • Thumbnail Image
    Item
    Four heuristic solution procedures to the travelling salesman problem and an application to the multi-depot vehicle routing problem
    (Thesis (M.S.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 1983., 1983.) Tovya, Yasef.; Ulusoy, Gündüz.
    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 conditions for the existence of a travelling salesman tour are satisfied. In case the subgraph does not contain any travelling salesman tour, Little's bcanch and bound algorithm is partially applied to the resultant cost matrix. The second algorithm, starts with the minimum cost assignment and ranks the assignment solutions in ascending costs by introducing subtour breaking constraints. The third algorithm produces some best achievable n-paths which start from a root node and end at some node incident to the root node. These paths are then completed to travelling salesman tours and the least cost tour is taken as the best achievable solution. A geometric approach to solving the TSP is described in the last algorithm. Starting with a partial tour, the algorithm determines which of the remaining nodes are to be inserted between which consecutive pair of nodes on the subtour and in what order. After all, a summary of computational results regarding both the efficiency and the computational effort of all the algorithms is presented.
  • Thumbnail Image
    Item
    New algorithms for the bin packing problem
    (Thesis (M.S.)- Bogazici University. Institute for Graduate Studies in Science and Engineering, 1988., 1988.) Ünal, Ali Tamer.; Ulusoy, Gündüz.
    Bin Packing is a well-known NP-complete problem which has many real-life applications. In this study, an extensive literature survey is followed by a number of new heuristic and optimal algorithms developed using a new general procedure called "Similar Tree Search Algorithm" to solve zero-one integer prograrrming problems. Besides, a new special case of the bin packing problem, smooth packing, is defined and algorithmS to solve this new problem are generated and tested.