TSP Race: Minimizing completion time in time-sensitive applications | Conference Paper individual record
abstract

In this paper, we present an approach for parallelizing computation and implementation time for problems where the objective is to complete the solution as soon after receiving the problem instance as possible. We demonstrate the approach on the TSP. We define the TSP race problem, present a computation-implementation parallelized (CIP) approach for solving it, and demonstrate CIP’s effectiveness on TSP Race instances. We also demonstrate a method for determining a priori when CIP will be effective. Although in this paper we focus on TSP, our general CIP approach can be effective on other problems and applications with similar time sensitivity.

authors
author list (cited authors)
Çavdar, B., & Sokol, J.
publication date
2015
publisher
Elsevier BV Publisher
keywords
  • Tsp Race
  • Computation-implementation Parallelization
  • Tsp
  • Heuristic
identifier
412990SE
Digital Object Identifier (DOI)
start page
47
end page
54
volume
244
issue
1