research centers


Search results: Found 4

Listing 1 - 4 of 4
Sort by

Article
Hybrid Metaheuristic Technique Based Tabu Search and Simulated Annealing

Authors: I. A. AbdulJabbar --- S. M. Abdullah
Journal: Engineering and Technology Journal مجلة الهندسة والتكنولوجيا ISSN: 16816900 24120758 Year: 2017 Volume: 35 Issue: 2 Part (B) Scientific Pages: 154-160
Publisher: University of Technology الجامعة التكنولوجية

Loading...
Loading...
Abstract

This paper presents hybrid technique using two metahueristic methods; which are simulated annealing (SA) and tabu search (TS). The aim is to exhibit the facility of adaptive memory in tabu search method to resolve the long computation times of simulated annealing metaheuristic method. This can be done by keeping the best path which is found in each iteration. As a result, the proposed hybrid technique gives the optimum solution by finding the shortest path with minimum cost when applied on travelling salesman problem (TSP) since it reduces the time complexity by finding the optimum path with a few numbers of iterations when compared with SA and TS.


Article
New Improved Heuristic Method for Solving Travelling Salesman Problem

Authors: Faez Hassan Ali --- Sajad Majeed Jassim
Journal: Iraqi Journal of Science المجلة العراقية للعلوم ISSN: 00672904/23121637 Year: 2018 Volume: 59 Issue: 4C Pages: 2289-2300
Publisher: Baghdad University جامعة بغداد

Loading...
Loading...
Abstract

In this paper we will investigate some Heuristic methods to solve travelling salesman problem. The discussed methods are Minimizing Distance Method (MDM), Branch and Bound Method (BABM), Tree Type Heuristic Method (TTHM) and Greedy Method (GRM). The weak points of MDM are manipulated in this paper. The Improved MDM (IMDM) gives better results than classical MDM, and other discussed methods, while the GRM gives best time for 5≤ n ≤500, where n is the number of visited cities.


Article
Using Travelling Salesman Principle to Evaluate the Minimum Total Cost of the Iraqi Cities

Authors: Sajjad Majeed Jasim --- Faez Hassan Ali
Journal: Ibn Al-Haitham Journal For Pure And Applied Science مجلة ابن الهيثم للعلوم الصرفة والتطبيقية ISSN: 16094042 Year: 2019 Volume: 32 Issue: 3 Pages: 95-108
Publisher: Baghdad University جامعة بغداد

Loading...
Loading...
Abstract

The traveling salesman problem (TSP) is a well-known and important combinatorialoptimization problem. The goal is to find the shortest tour that visits each city in a given listexactly once and then returns to the starting city. In this paper we exploit the TSP to evaluatethe minimum total cost (distance or time) for Iraqi cities. So two main methods areinvestigated to solve this problem; these methods are; Dynamic Programming (DP) andBranch and Bound Technique (BABT). For the BABT, more than one lower and upperbounds are be derived to gain the best one. The results of BABT are completely identical toDP, with less time for number of cities (n), 5 ≤ n ≤ 25. These results proof the efficiency ofBABT compared with some good heuristic methods. We are suggesting some additionaltechniques to improve the computation time of BABT for n ≤ 80.


Article
Solve travelling sales man problem by using fuzzy multi-objective linear programming
حل مسائلة البائع المتجول tsp ) )باستخدام الدوال المتعددة الأهداف الضبابية في البرمجة الخطية

Author: عباس حسين بطيخ
Journal: journal of Economics And Administrative Sciences مجلة العلوم الاقتصادية والإدارية ISSN: 2227 703X / 2518 5764 Year: 2014 Volume: 20 Issue: 75 Pages: 432-446
Publisher: Baghdad University جامعة بغداد

Loading...
Loading...
Abstract

The main focus of this research is to examine the Travelling Salesman Problem (TSP) and the methods used to solve this problem where this problem is considered as one of the combinatorial optimization problems which met wide publicity and attention from the researches for to it's simple formulation and important applications and engagement to the rest of combinatorial problems , which is based on finding the optimal path through known number of cities where the salesman visits each city only once before returning to the city of departure n this research , the benefits of( FMOLP) algorithm is employed as one of the best methods to solve the (TSP) problem and the application of the algorithm in conjunction with one . Mathematical model has been established based on unit objective, regarding each objective of the problem, and then establishing a mathematical model, with many objectives to apply the foggy method of many objectives.

انصب اهتمام هذا البحث على دراسة مسألة البائع المتجول والطرائق المستخدمة في إيجاد الحل للمسألة، إذ تعد هذه المسألة إحدى مسائل الامثلية المركبة التي لاقت شهرة واسعة واهتمامًا كبيرًا من لدن الباحثين وذلك لصياغتها البسيطة وتطبيقاتها المهمة وارتباطها الممتع ببقية المسائل التركيبية ، إذ تقوم على إيجاد المسار لأمثل من خلال عدد معلوم من المدن بحيث يزور البائع كل مدينة مرة واحدة فقط قبل العودة إلى المدينة التي انطلق منها .تم في هذا البحث توظيف مزايا خوارزمية بناء أنموذج ضبابي متعدد الااهداف باعتبارها احد الطرائق وأدى تطبيق الخوارزمية بالارتباط مع إحدى (TSP) المثلى لحل مسألة البائع المتجول. تم بناء نموذج رياضي أحادي الأهداف خاص بكل هدف من أهداف المشكلة ثم بناء نموذج رياضي متعدد الأهداف بتطبيق الطريقة الضبابية المتعددة الأهداف تم حل النماذج واستخراج النتائج من خلال تطبيق البرنامج الجاهز ( winqsb ) الخاص بأساليب بحوث العمليات. اما بالنسبة للاستنتاجات تم التوصل الى اقصر طريق يتبعه البائع للوصول الى الحل الامثل .

Listing 1 - 4 of 4
Sort by
Narrow your search

Resource type

article (4)


Language

English (3)

Arabic and English (1)


Year
From To Submit

2019 (1)

2018 (1)

2017 (1)

2014 (1)