## Search

Now showing items 1-7 of 7

#### Formulations and branch-and-cut algorithms for the generalized vehicle routing problem

(Informs, 2011-08)

The generalized vehicle routing problem (GVRP) consists of finding a set of routes for a number of capacitated vehicles on a graph where the vertices are partitioned into clusters with given demands, such that the total ...

#### Modelling and solving an m-location, n-courier, priority-based planning problem on a network

(Springer Nature, 2012-01)

In this paper, we study an m-location, n-courier, priority-based planning problem on a network, which we refer to as the Courier Planning Problem (CPP). The CPP arises on a daily basis in the context of planning the ...

#### 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 ...

#### Two classes of quadratic assignment problems that are solvable as linear assignment problems

(Elsevier, 2011-08)

The Quadratic Assignment Problem is one of the hardest combinatorial optimization problems known. We present two new classes of instances of the Quadratic Assignment Problem that can be reduced to the Linear Assignment ...

#### 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