• Journal of the Korea Society of Computer and Information
• /
• v.27 no.2
• /
• pp.1-8
• /
• 2022

In this paper, we design and implement a GPU-based parallel algorithm to effectively solve the traveling salesman problem through an ant color system. The repetition process of generating hundreds or thousands of tours simultaneously in TSP utilizes GPU's task-level parallelism, and the update process of pheromone trails data actively exploits data parallelism by 32x32 thread blocks. In particular, through simultaneous memory access of multiple threads, the coalesced accesses on continuous memory addresses and concurrent accesses on shared memory are supported. This experiment used 127 to 1002 city data provided by TSPLIB, and compared the performance of sequential and parallel algorithms by using Intel Core i9-9900K CPU and Nvidia Titan RTX system. Performance improvement by GPU parallelization shows speedup of about 10.13 to 11.37 times.

• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.4
• /
• pp.89-96
• /
• 2007

The amount of home deliveries are increasing day by day owing to the increment of the on-line market. This environment brings along generating many delivery companies and keen competition with each other in its customer hold Therefore, this study aims at the development of a shortest delivery route search demonstration system using Ant Algorithm. The developed system reduces the time consumption significantly in search of delivery path and time of the products for the novice delivery driver as well as experienced driver. Ultimately, the developed system will give the customer reliability and satisfaction, knowing a delivery route in advance.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.3
• /
• pp.147-152
• /
• 2008

Ant System(AS) is new meta heuristic for hard combinatorial optimization problem. It is a population based approach that uses exploitation of positive feedback as well as greedy search. It was first proposed for tackling the well known Traveling Salesman Problem. In this paper, AS is applied to the Multicast Routing Problem. Multicast Routing is modeled as the NP-complete Steiner tree problem. This is the shortest path from source node to all destination nodes. We proposed new AS to resolve this problem. The proposed method selects the neighborhood node to consider all costs of the edge and the next node in state transition rule. Also, The edges which are selected elite agents are updated to additional pheromone. Simulation results of our proposed method show fast convergence and give lower total cost than original AS and $AS_{elite}$.

• The KIPS Transactions:PartB
• /
• v.12B no.7 s.103
• /
• pp.823-828
• /
• 2005

Ant Colony System (ACS) applied to the traveling salesman problem (TSP) has demonstrated a good performance on the small TSP. However, in case of the large TSP. ACS does not yield the optimum solution. In order to overcome the drawback of the An for the large TSP, the present study employs the idea of subpath to give more irormation to ants by computing the distance of subpath with length u. in dealing with the large TSP, the experimental results indicate that the proposed algorithm gives the solution much closer to the optimal solution than does the original ACS. In comparison with the original ACS, the present algorithm has substantially improved the performance. By utilizing the proposed algorithm, the solution performance has been enhanced up to $70\%$ for some graphs and around at $30\%$ for averaging over all graphs.

• The KIPS Transactions:PartB
• /
• v.15B no.3
• /
• pp.245-252
• /
• 2008

We present a classification algorithm based on ant colony system(ACS) for classifying digital images. The ACS has been recently emerged as a useful tool for the pattern recognition, image extraction, and edge detection. The classification algorithm of digital images is very important in the application areas of digital image coding, image analysis, and image recognition because it significantly influences the quality of images. The conventional procedures usually classify digital images with the fixed value for the associated parameters and it requires postprocessing. However, the proposed algorithm utilizing randomness of ants yields the stable and enhanced images even for processing the rapidly changing images. It is also expected that, due to this stability and flexibility of the present procedure, the digital images are stably classified for processing images with various noises and error signals arising from processing of the drastically fast moving images could be automatically compensated and minimized.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.1
• /
• pp.9-15
• /
• 2009

Ant Colony System is new meta heuristic for hard combinatorial optimization problem. The original ant colony system accomplishes a pheromone updating about only the global optimal path using global updating rule. But, If the global optimal path is not searched until the end condition is satisfied, only pheromone evaporation happens to no matter how a lot of iteration accomplishment. In this paper, the length of the global optimal path does not improved within the limited iterations, we evaluates this state that fall into the local optimum and selects the next node using changed parameters in the state transition rule. This method has effectiveness of the search for a path through diversifications is enhanced by decreasing the value of parameter of the state transition rules for the select of next node, and escape from the local optima is possible. Finally, the performance of Best and Average_Best of proposed algorithm outperforms original ACS.

• International Journal of Computer Science & Network Security
• /
• v.23 no.2
• /
• pp.55-64
• /
• 2023

The travelling salesman problem (TSP) is an important combinatorial optimization problem that is used in several engineering science branches and has drawn interest to several researchers and scientists. In this problem, a salesman from an arbitrary node, called the warehouse, starts moving and returns to the warehouse after visiting n clients, given that each client is visited only once. The objective in this problem is to find the route with the least cost to the salesman. In this study, a meta-based ant colony system algorithm (ACSA) is suggested to find solution to the TSP that does not use local pheromone update. This algorithm uses the global pheromone update and new heuristic information. Further, pheromone evaporation coefficients are used in search space of the problem as diversification. This modification allows the algorithm to escape local optimization points as much as possible. In addition, 3-opt local search is used as an intensification mechanism for more quality. The effectiveness of the suggested algorithm is assessed on a several standard problem instances. The results show the power of the suggested algorithm which could find quality solutions with a small gap, between obtained solution and optimal solution, of 1%. Additionally, the results in contrast with other algorithms show the appropriate quality of competitiveness of our proposed ACSA.

• The Journal of Korean Medicine
• /
• v.32 no.3
• /
• pp.1-9
• /
• 2011

Objectives: This study was carried out to observe the foot gworeum meridian muscle from a viewpoint of human anatomy on the assumption that the meridian muscle system is basically matched to the meridian vessel system as a part of the meridian system, and further to support the accurate application of acupuncture in clinical practice. Methods: Meridian points corresponding to the foot gworeum meridian muscle at the body surface were labeled with latex, being based on Korean standard acupuncture point locations. In order to expose components related to the foot gworeum meridian muscle, the cadaver was then dissected, being respectively divided into superficial, middle, and deep layers while entering more deeply. Results: Anatomical components related to the foot gworeum meridian muscle in human are composed of muscles, fascia, ligament, nerves, etc. The anatomical components of the foot gworeum meridian muscle in cadaver are as follows: 1. Muscle: Dorsal pedis fascia, crural fascia, flexor digitorum (digit.) longus muscle (m.), soleus m., sartorius m., adductor longus m., and external abdominal oblique m. aponeurosis at the superficial layer, dorsal interosseous m. tendon (tend.), extensor (ext.) hallucis brevis m. tend., ext. hallucis longus m. tend., tibialis anterior m. tend., flexor digit. longus m., and internal abdominal oblique m. at the middle layer, and finally posterior tibialis m., gracilis m. tend., semitendinosus m. tend., semimembranosus m. tend., gastrocnemius m., adductor magnus m. tend., vastus medialis m., adductor brevis m., and intercostal m. at the deep layer. 2. Nerve: Dorsal digital branch (br.) of the deep peroneal nerve (n.), dorsal br. of the proper plantar digital n., medial br. of the deep peroneal n., saphenous n., infrapatellar br. of the saphenous n., cutaneous (cut.) br. of the obturator n., femoral br. of the genitofemoral n., anterior (ant.) cut. br. of the femoral n., ant. cut. br. of the iliohypogastric n., lateral cut. br. of the intercostal n. (T11), and lateral cut. br. of the intercostal n. (T6) at the superficial layer, saphenous n., ant. division of the obturator n., post. division of the obturator n., obturator n., ant. cut. br. of the intercostal n. (T11), and ant. cut. br. of the intercostal n. (T6) at the middle layer, and finally tibialis n. and articular br. of tibial n. at the deep layer. Conclusion: The meridian muscle system seemed to be closely matched to the meridian vessel system as a part of the meridian system. This study shows comparative differences from established studies on anatomical components related to the foot gworeum meridian muscle, and also from the methodical aspect of the analytic process. In addition, the human foot gworeum meridian muscle is composed of the proper muscles, and also may include the relevant nerves, but it is as questionable as ever, and we can guess that there are somewhat conceptual differences between terms (that is, nerves which control muscles in the foot gworeum meridian muscle and those which pass nearby) in human anatomy.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.8
• /
• pp.399-410
• /
• 2005

This paper Proposes a novel adaptive genetic algorithm (GA) extrapolated by an ant colony optimization. We first prove that the algorithm converges to the unique global optimal solution with probability arbitrarily close to one and then, by experimental studies, show that the algorithm converges faster to the optimal solution than GA with elitism and the population average fitness value also converges to the optimal fitness value. We further discuss controlling the tradeoff of exploration and exploitation by a parameter associated with the proposed algorithm.

• The Bulletin of The Korean Astronomical Society
• /
• v.46 no.2
• /
• pp.53.3-53.3
• /
• 2021

Adaptive Optics (AO) was first studied in the field of astronomy, and its applications have been extended to the field of laser, microscopy, bio, medical, and free space laser communication. AO modelling and simulation are required throughout the system development process. It is necessary not only for proper design but also for performance verification after the final system is built. In KASI, we are trying to develop the AO Python Package for AO modelling and simulation. It includes modelling classes of atmosphere, telescope, Shack-Hartmann wavefront sensor, deformable mirror, which are the components for an AO system. It also includes the ability to simulate the entire AO system over time. It is being developed in the Super Eye Bridge project to develop a segmented mirror, an adaptive optics, and an emersion grating spectrograph, which are future telescope technologies. And it is planned to be used as a performance analysis system for several telescope projects in Korea.