ABC-GSX: A hybrid method for solving the traveling salesman problem

Conference proceedings article

ผู้เขียน/บรรณาธิการ

กลุ่มสาขาการวิจัยเชิงกลยุทธ์

ไม่พบข้อมูลที่เกี่ยวข้อง

รายละเอียดสำหรับงานพิมพ์

รายชื่อผู้แต่ง: Banharnsakun A., Achalakul T., Sirinaovakul B.

ผู้เผยแพร่: Hindawi

ปีที่เผยแพร่ (ค.ศ.): 2010

หน้าแรก: 7

หน้าสุดท้าย: 12

จำนวนหน้า: 6

ISBN: 9781424473762

นอก: 0146-9428

eISSN: 1745-4557

URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-79952757872&doi=10.1109%2fNABIC.2010.5716308&partnerID=40&md5=5947db5e1576803548ee709deb5fef76

ภาษา: English-Great Britain (EN-GB)

ดูบนเว็บไซต์ของสำนักพิมพ์

บทคัดย่อ

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 solve a combinatorial optimization problem known as the Traveling Salesman Problem or TSP. Our technique implements the Artificial Bee Colony algorithm, which is inspired by the decision making process of the honey bees in finding optimal food sources. We extend the ABC algorithm with Greedy Subtour Crossover to improve the precision. In this hybrid procedure, the exploitation process in the ABC algorithm is improved upon by the Greedy Subtour Crossover method. The new proposed method is called ABC-GSX. We then empirically assess performance of our proposed work using functions from a standard TSP library. Experimental results show improvements in both precision and computational time compared to techniques presented in recent literatures. ฉ 2010 IEEE.

คำสำคัญ

Greedy subtour crossover, Traveling salesman problem