The Single Machine Scheduling with Changeover Costs problem is found in many different workshops. In this case, the main criterion is the sequence-dependent changeover-costs or setup times. This Scheduling problem can be modeled as a Traveling Salesman Problem (TSP) and when time constraints are inserted into the model such as due-dates, the resulting problem is known as the Time Dependent Trav...

The Traveling salesman problem (TSP) is to find a tour of a given number of cities (visiting each city exactly once) where the length of this tour is minimized. Testing every possibility for an N city tour would be N! Math additions. Genetic algorithms (GA) and Memetic algorithms (MA) are a relatively new optimization technique which can be applied to various problems, including those that are ...

A component-based approach to model Ant Colony System (ACS) for the Traveling Salesman Problem (TSP) is shown in this paper. The used components to solve the TSP with ACS technique and the collaboration rules between components are also described. The internal reasoning about the ant colony component-based system for the TSP gives a better perception of solving this problem using ant-based tech...

The multiple Traveling Salesman Problem (mTSP) is a complex combinatorial optimization problem, which is a generalization of the well-known Traveling Salesman Problem (TSP), where one or more salesmen can be used in the solution. The optimization task can be described as follows: given a fleet of vehicles, a common depot and several requests by the customers, find the set of routes with overall...

09:30 Tristan Cazenave, Marek Cornu, Daniel Vanderpooten A two-phase meta-heuristic applied to the Multi-objective Traveling Salesman Problem Recently, a number of hybrid meta-heuristics have been successfully applied on different problems like the MO Traveling Salesman Problem (TSP), the MO Multidimensional Knapsack Problem and the MO Flow-shop Scheduling Problem. We present a method providing...

This paper treats of a generalization of the Traveling Salesman Problem (TSP) called Multi-commodity one-to-one Pickup-and-Delivery Traveling Salesman Problem (m-PDTSP) in which cities corresponds to customers providing or requiring known amounts of m different objects, and the vehicle has a given upper-limit capacity. Each object has exactly one origin and one destination, and the vehicle must...

Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent generalization of TSP which we call Moving-Target TSP, where a pursuer must intercept in minimum time a set of targets which move with constant velocities. We propose approximate and exact algorithms for several natur...

Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent generalization of TSP which we call Moving-Target TSP, where a pursuer must intercept in minimum time a set of targets which move with constant velocities. We propose approximate and exact algorithms for several natur...

In the Single-Double Balanced Traveling Salesman Problem (SDB-TSP), the customers must be visited over a period of two days: some must be visited daily, and the others on alternate days (even or odd days). The salesman’s objective is to minimize the total distance travelled over the two tours; moreover, the number of customers visited in every tour must be ‘balanced’, i.e the difference between...

The Quota Traveling Salesman Problem is a generalization of the well known Traveling Salesman Problem. The goal of the traveling salesman is, in this case, to reach a given quota of the sales, minimizing the amount of time. In this paper we address the on-line version of the problem, where requests are given over time. We present algorithms for various metric spaces, and analyze their performan...