ABC-GSX: A hybrid method for solving the Traveling Salesman Problem

Abstract

An optimization problem is a problem of finding the best solution from all possible solutions. In most computer science and mathematical applications, the decision to select the best solution is not polynomially bounded. Heuristics approaches are thus often considered to solve such NP-hard problems. In our work, we focus on developing a heuristic method to… (More)
DOI: 10.1109/NABIC.2010.5716308

Topics

7 Figures and Tables

Statistics

02040201520162017
Citations per Year

Citation Velocity: 8

Averaging 8 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@article{Banharnsakun2010ABCGSXAH, title={ABC-GSX: A hybrid method for solving the Traveling Salesman Problem}, author={Anan Banharnsakun and Tiranee Achalakul and Booncharoen Sirinaovakul}, journal={2010 Second World Congress on Nature and Biologically Inspired Computing (NaBIC)}, year={2010}, pages={7-12} }