𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient hybrid genetic algorithm for the traveling salesman problem

✍ Scribed by Kengo Katayama; Hiroyuki Narihisa

Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
321 KB
Volume
84
Category
Article
ISSN
1042-0967

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A branch-and-cut algorithm for the undir
A branch-and-cut algorithm for the undirected selective traveling salesman problem
✍ Gendreau, Michel; Laporte, Gilbert; Semet, FrοΏ½dοΏ½ric πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 120 KB πŸ‘ 2 views

The Selective Traveling Salesman Problem (STSP) is defined on a graph in which profits are associated with vertices and costs are associated with edges. Some vertices are compulsory. The aim is to construct a tour of maximal profit including all compulsory vertices and whose cost does not exceed a p

Approximation algorithms for the capacit
Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
✍ Shoshana Anily; Julien Bramel πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 100 KB

We consider the Capacitated Traveling Salesman Problem with Pickups and Deliveries (CTSPPD). This problem is characterized by a set of n pickup points and a set of n delivery points. A single product is available at the pickup points which must be brought to the delivery points. A vehicle of limited

An efficient representation for radar sc
An efficient representation for radar scattering with the use of the genetic algorithm
✍ D. X. Jin; S. M. Cui; D. G. Fang πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 102 KB

Computed and measured radiation patterns for the coupled even-sum NRD mode are in good agreement, and illustrates the usefulness of such coupled NRD guides in the design of linear antenna arrays. The single-mode theoretical approach to analysis is a considerable simplification over other existing me