An Improved Heuristic for the Probabilistic Traveling Salesman Problem with Deadlines Based on GPGPU

Dennis Weyland; Roberto Montemanni; Luca Maria Gambardella

doi:10.1007/978-3-642-53856-8_42

ScienceGate Book Chapters

BOOK-CHAPTER

An Improved Heuristic for the Probabilistic Traveling Salesman Problem with Deadlines Based on GPGPU

Dennis Weyland Roberto Montemanni Luca Maria Gambardella

Year: 2013 Lecture notes in computer science Pages: 332-339 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-642-53856-8_42

Get Full-Text PDF Get Analytical Report

Keywords:

Travelling salesman problem Heuristics Computer science Graphics processing unit Heuristic Mathematical optimization Combinatorial optimization Probabilistic logic Quadratic assignment problem Stochastic optimization Lin–Kernighan heuristic Traveling purchaser problem Extremal optimization 2-opt Focus (optics) Optimization problem Algorithm Artificial intelligence Parallel computing Mathematics Multi-swarm optimization

Metrics

Cited By

1.17

FWCI (Field Weighted Citation Impact)

Refs

0.79

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Vehicle Routing Optimization Methods

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Transportation and Mobility Innovations

Physical Sciences → Engineering → Automotive Engineering

Transportation Planning and Optimization

Social Sciences → Social Sciences → Transportation

An Improved Heuristic for the Probabilistic Traveling Salesman Problem with Deadlines Based on GPGPU

Metrics

Citation History

Topics

Related Documents

Probabilistic Traveling Salesman Problem with Deadlines

Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines

Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines

A heuristic for the probabilistic traveling salesman problem

Heuristic Approaches for the Probabilistic Traveling Salesman Problem