In this research, a special form of Automated Guided Vehicle (AGV) routing problem is investigated. The objective is to ®nd the shortest tour for a single, free-ranging AGV that has to carry out multiple pick and deliver (P&D) requests. This problem is an incidence of the asymmetric traveling salesman problem which is known to be NP-complete. An arti®cial neural network algorithm based on Kohon...

We study a generalization of the well-known traveling salesman problem (TSP) where each customer provides or requires a given non-zero amount of product, and the vehicle in a depot has a given capacity. Each customer and the depot must be visited exactly once by the vehicle supplying the demand while minimizing the total travel distance. We assume that the product collected from pickup customer...

This paper studies the double traveling salesman problem with two stacks. A number of requests have to be served where each request consists in the pickup and delivery of an item. All the pickup operations have to be performed before any delivery can take place. A single vehicle is available that starts from a depot, performs all the pickup operations and returns to the depot. Then, it performs...

Nested Rollout Policy Adaptation (NRPA) is a Monte Carlo search algorithm for single player games. In this paper we propose to generalize NRPA with temperature and bias analyze theoretically the algorithms. The generalized named GNRPA. Experiments show it improves on different application domains: SameGame Traveling Salesman Problem Time Windows.

The Traveling Salesman Problem (TSP) and its allied problems like Vehicle Routing Problem (VRP) are one of the most widely studied problems in combinatorial optimization. It has long been known to be NP-hard and hence research on developing algorithms for the TSP has focused on approximate methods in addition to exact methods. Tabu search is one of the most widely applied metaheuristic for solv...

This paper concentrates on a new framework for a post-market reassignment of requests in a Collaborative Carrier Network (CCN). While the framework was applied to a pickup and delivery scenario in [BB07] we now use it for the vehicle routing of a carrier network offering LTL pickup services leading to a set of interdependent capacitated traveling salesman tours.

In the stochastic and dynamic multi-stage vehicle routing problem, a set of vehicles collectively transports and services demands which require service at multiple spatially separated locations. Arrival times and service locations of individual demands are not known until the demand’s arrival, and vehicles are assumed to have infinite capacity and to travel with bounded velocity. The objective ...

We consider a delivery problem on a network one is given a network in which nodes have supplies or demands for certain products, and arcs have lengths satisfying the Triangle Inequality. A vehicle of innnite capacity, travels through the network, carrying products to their destinations, and is limited in that it can carry only a single type of product at a time. The general problem asks for a s...

In this paper, we propose a solution method for the Generalized Traveling Salesman Problem (GTSP) based on a Memetic Algorithm (Genetic Algorithm plus Local Search, see, e.g., [7]). The GTSP is a generalization of the well-known Traveling Salesman Problem (TSP). The main contribution of the paper stands in the crossover operator based on the exploration of a large neighborhood around the father...