𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Tabu Search Approach for the Prize Collecting Traveling Salesman Problem

✍ Scribed by Pedro, Odivaney; Saldanha, Rodney; Camargo, Ricardo

Book ID
120419950
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
196 KB
Volume
41
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A tabu search heuristic for the undirect
A tabu search heuristic for the undirected selective travelling salesman problem
✍ Michel Gendreau; Gilbert Laporte; FrΓ©dΓ©ric Semet πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 677 KB

The undirected Selective Travelling Salesman Problem (STSP) is defined on a graph G= ( V, E) with positive profits associated with vertices, and distances associated with edges. The STSP consists of determining a maximal profit Hamiltonian cycle over a subset of V whose length does not exceed a pres

A branch-and-cut algorithm for the undir
A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
✍ Jean-FranΓ§ois BΓ©rubΓ©; Michel Gendreau; Jean-Yves Potvin πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 130 KB πŸ‘ 1 views

## Abstract Given an undirected graph with edge costs and vertex prizes, the aim of the Prize Collecting Traveling Salesman Problem (PCTSP) is to find a simple cycle minimizing the total edge cost while collecting at least a minimum amount of prizes. In this article, we present a branch‐and‐cut alg

A tabu search heuristic using genetic di
A tabu search heuristic using genetic diversification for the clustered traveling salesman problem
✍ Gilbert Laporte; Jean-Yves Potvin; Florence Quilleret πŸ“‚ Article πŸ“… 1997 πŸ› Springer US 🌐 English βš– 736 KB

The clustered traveling salesman problem is an extension of the classical traveling salesman problem where the set of vertices is partitioned into clusters. The objective is to find a least cost Hamiltonian Cycle such that the vertices of each cluster are visited contiguously and the clusters are vi