Heuristics for the mixed swapping problem
Computers and Operations Research
A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem
Discrete Applied Mathematics
The capacitated traveling salesman problem with pickups and deliveries on a tree
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
The uncapacitated swapping problem on a line and on a circle
Discrete Applied Mathematics
| Hi-index | 0.00 |
We consider the problem of optimally swapping objects between N workstations, which we refer to as nodes, located on a line. There are m types of objects, and the set of object-types is denoted by S = {1, ..., m}. Object-type 0 is a dummy type, the null object. Each node v contains one unit of a certain object-type $a_v \in S \cup \{0\}$ and requires one unit of object-type $b_v \in S \cup \{0\}$. We assume that the total supply equals the total demand for each of the object-types separately. A vehicle of unit capacity ships the objects so that the requirements of all nodes are satisfied. The set of object-types is partitioned into two sets: objects that may be temporarily dropped at intermediate nodes before reaching their destination and objects that have to be shipped directly from their origin to their destination. The objective is to design a route that starts and ends at the depot and a feasible assignment of object-types to the route's arcs so that the total distance is minimized. We propose an O(N 2) algorithm to compute the optimal solution for this problem.