Genetic Algorithms and the Traveling Salesman Problem by Kylie Bryant helps solve the problem of finding the right salesman for the right customer.Expand

The book presents an overview of the most fundamental aspects of the theory that underlies the Relational Database Model, and provides exact definitions of widely accepted concepts, making the book very suitable in classes on database theory.Expand

A simple, graph-oriented database model, supporting object-identity, is presented and it is shown that the transformation language supports both set-operations (except for the powerset operator) and recursive functions.Expand

This work proposes a graph-based data model, which shares many features wrth exrstmg data models, but which better facrhtates the rigorous study of graphical database end-user interfaces.Expand

It is shown that the flat relational algebra is rich enough to extract the same “flat information” from a flat database as the nested algebra does, which implies that recursive queries such as the transitive closure of a binary relation cannot be expressed in the nestedgebra.Expand

The authors will concentrate on the application of genetic algorithms to the traveling salesman problem, where they can be successfully implemented on parallel machines, resulting in considerable speedup.Expand

Both coordinate-based and point-based query languages that are complete in the sense that they can express precisely all computable queries that are generic with respect to certain classes of transformations of space, corresponding to certain geometric interpretations of spatial data are introduced.Expand