Now showing items 1-2 of 2
Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
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
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 ...
Share this page