We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...
Consider a truck running along a road. It picks up a load Li at point i and delivers it at i, carrying at most one load at a time. The speed on the various parts of the road in on...
Abstract: 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 picku...
: This paper addresses the optimization of a dynamic Traveling Salesman Problem using the Ant Colony Optimization algorithm. Ants are social insects with limited skills that live i...