𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Foreword: Heuristic, Genetic and Tabu Search

✍ Scribed by S.Selcuk Erenguc; Hasan Pirkul

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
87 KB
Volume
21
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Heuristic concentration and Tabu search:
Heuristic concentration and Tabu search: A head to head comparison
✍ K.E. Rosing; C.S. ReVelle; E. Rolland; D.A. Schilling; J.R. Current πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 471 KB

Earlier this year two papers applying the metaheuristics Tabu search (TS) and Heuristic concentration (HC) to the pmedian problem were published in consecutive volumes of this journal. Here we apply the method of HC to some of the data sets which were used for computational experience in the paper o

A tabu search heuristic for the Steiner
A tabu search heuristic for the Steiner Tree Problem
✍ Gendreau, Michel; Larochelle, Jean-Francois; SansοΏ½, Brunilde πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 342 KB πŸ‘ 2 views

The Steiner Tree Problem (STP) in graphs is a well-known NP-hard problem. It has regained attention due to the introduction of new telecommunication technologies, such as ATM, since it appears as the inherent mathematical structure behind multicast communications. In this paper, we present a tabu se

A tabu search heuristic for periodic and
A tabu search heuristic for periodic and multi-depot vehicle routing problems
✍ Cordeau, Jean-FranοΏ½ois; Gendreau, Michel; Laporte, Gilbert πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 142 KB πŸ‘ 1 views

We propose a tabu search heuristic capable of solving three well-known routing problems: the periodic vehicle routing problem, the periodic traveling salesman problem, and the multi-depot vehicle routing problem. Computational experiments carried out on instances taken from the literature indicate t