Ant Colony Optimization (ACO) has been applied successfully in solving the Traveling Salesman Problem. Marco Dorigo et al. used Ant System (AS) to explore the Symmetric Traveling Salesman Problem and found that the use of a small number of elitist ants can improve algorithm performance. The elitist ants take advantage of global knowledge of the best tour found to date and reinforce this tour wi...

Non-crossing knight‟s tour in 3-dimension is a new field of research. The author has shown its possibility in small cuboids and in cubes up to 8x8x8 size. It can also be extended to larger size cubes and cuboids. The author has achieved jumps of length 15, 46, 88, 159, 258 and 395 in cubes of size 3x3x3, 4x4x4, 5x5x5, 6x6x6, 7x7x7 and 8x8x8 respectively. This amounts to covering 59%, 73%, 71%, ...

In this paper, a hub covering location problem is considered. Hubs, which are the most congested part of a network, are modeled as M/M/C queuing system and located in placeswhere the entrance flows are more than a predetermined value.A fuzzy constraint is considered in order to limit the transportation time between all origin-destination pairs in the network.On modeling, a nonlinear mathematica...

The One-Commodity Pickup-and-Delivery Travelling Salesman Problem (1-PDTSP) is defined on a directed graph as follows. A node of the graph represents a depot and the other nodes represent customers. Every customer has a positive or negative demand of a product. The product is the same for all customers. Customers with positive demand are called pickups and customers with negative demand are cal...

This article describes a Hopfield-Tank model of the Euclidean traveling salesman problem (using Aiyer’s subspace approach) that incorporates a “fuzzy” interpretation of the rows of the activation array. This fuzzy approach is used to explain the network’s behavior. The fuzzy interpretation consists of computing the center of mass of the positive activations in each row. This produces real numbe...