Book ChapterDOI
The Travelling Salesman Problem
Stefan Näher
- pp 383-391
Reads0
Chats0
TLDR
The author explains how a so-called “approximation algorithm” can find a tour that is maybe not the shortest one but one whose length usually is quite close to the optimum.Abstract:
In this chapter the author considers how to work out the shortest round-trip through a number of cities, a hard problem for which we do not know how to find an optimal solution. The author first demonstrates why a “brute-force” approach is disastrous, and he then shows how dynamic programming offers a significant improvement in running time. Finally he explains how a so-called “approximation algorithm” can find a tour that is maybe not the shortest one but one whose length usually is quite close to the optimum.read more
Citations
More filters
Book ChapterDOI
Ant Colony Optimization: Overview and Recent Advances
Marco Dorigo,Thomas Stützle +1 more
TL;DR: This chapter reviews developments in ACO and gives an overview of recent research trends, including the development of high-performing algorithmic variants and theoretical understanding of properties of ACO algorithms.
Journal ArticleDOI
A Survey of Mobile Cloud Computing Application Models
TL;DR: The mobile cloud architecture, offloading decision affecting entities, application models classification, the latest mobile cloud application models, their critical analysis and future research directions are presented.
Journal ArticleDOI
Editorial survey: swarm intelligence for data mining
TL;DR: This paper surveys the intersection of two fascinating and increasingly popular domains: swarm intelligence and data mining, and provides a unifying framework that categorizes the swarm intelligence based data mining algorithms into two approaches: effective search and data organizing.
Book ChapterDOI
An Introduction to Ant Colony Optimization
Marco Dorigo,Krzysztof Socha +1 more
TL;DR: This paper presents a meta-analyses of approximation algorithms and their applications in the context of discrete-time decision-making and shows promising results in several domains including reinforcement learning and reinforcement learning.
Journal ArticleDOI
Methodology for Path Planning and Optimization of Mobile Robots: A Review
Mohd. Nayab Zafar,J. C. Mohanta +1 more
TL;DR: The present research on mobile robotics addresses the problems which are mainly on path planning algorithm and optimization in static as well as dynamic environments with a focus on meta-heuristic methods.