Search
Now showing items 1-4 of 4
The attractive traveling salesman problem
(Elsevier, 2010-05-16)
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 the facility vertices. Profit is computed ...
Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
(Elsevier, 2012-05)
This paper studies the Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs. The subproblem of minimizing the handling cost for a fixed route is analyzed in detail. It is solved by means of an exact ...
The traveling salesman problem with pickups, deliveries, and handling costs
(Informs, 2010-08)
This paper introduces a new variant of the one-to-many-to-one single vehicle pickup and delivery problems (SVPDP) that incorporates the handling cost incurred when rearranging the load at the customer locations. The ...
A branch-and-cut algorithm for solving the non-preemptive capacitated swapping problem
(Elsevier, 2010-08-06)
This paper models and solves a capacitated version of the Non-Preemptive Swapping Problem. This problem is defined on a complete digraph , at every vertex of which there may be one unit of supply of an item, one unit of ...
Share this page