A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery

Hernández-Pérez, Hipólito; Salazar-González, Juan-José

doi:10.1016/j.dam.2003.09.013

Cited by 170 publications

(95 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Chalasani and Motwani [6] presented another heuristic for the 1-PDTSP where the 1-PDTSP is renamed the Q-delivery TSP with Q the capacity of the vehicle. Hernandez-Perez and SalazarGonzalez [10] presented a branch-and-cut algorithm for the exact solution of 1-PDTSP instances with up to 75 customers. Henderson et al [9] presented a simulated annealing metaheuristic to solve the 1-PDTSP approximately for the special case when the vehicle capacity is one unit, namely the shortest route cut and fill problem.…”

Section: Introductionmentioning

confidence: 99%

The one‐commodity pickup and delivery travelling salesman problem on a path or a tree

Wang

Lim

2006

Networks

View full text Add to dashboard Cite

Optimization algorithms for both path and tree topology classes of the one-commodity pickup and delivery travelling salesman problem (1-PDTSP) are proposed in this article, which focus on minimizing the route distance to transport products among pickup and delivery customers by a single vehicle with a limited capacity of k . Each pickup customer provides one unit volume of the product while each delivery customer requires one unit volume of the product. For the path case, we propose an O(n 2 / min (k , n)) algorithm for any arbitrary k , and two O(n) algorithms for k = 1 and k = ∞. For the tree case, O(n 2 ) and O(n) algorithms are proposed for k = 1 and k = ∞, respectively. Moreover, when k is arbitrary, the problem becomes NP-hard in the strong sense.

show abstract

Section: Introductionmentioning

confidence: 99%

The one‐commodity pickup and delivery travelling salesman problem on a path or a tree

Wang

Lim

2006

Networks

View full text Add to dashboard Cite

show abstract

“…A similar problem has been introduced in [8,9] where there are two kinds of customers: delivery customer, who requires a non-zero amount of the product, and pickup customers, who provides a non-zero amount of the product. Nevertheless, the problem in these papers calls for a minimum distance tour visiting each customer only once.…”

Section: Previous Work and Resultsmentioning

confidence: 99%

Balancing the stations of a self service “bike hire” system

Benchimol¹,

Benchimol²,

Chappert³

et al. 2011

RAIRO-Oper. Res.

212

View full text Add to dashboard Cite

“…Finally, we mention the One-Commodity Pickup-andDelivery TSP investigated by Hernández-Pérez and SalazarGonzález [11,12]. In this problem, each vertex has a nonnegative supply or demand of a single product.…”

Section: Introductionmentioning

confidence: 99%

A branch‐and‐cut algorithm for the nonpreemptive swapping problem

Bordenave

Gendreau

Laporte

2009

Naval Research Logistics

View full text Add to dashboard Cite

Abstract:In the Swapping Problem (SP), we are given a complete graph, a set of object types, and a vehicle of unit capacity. An initial state specifies the object type currently located at each vertex (at most one type per vertex). A final state describes where these object types must be repositioned. In general, there exist several identical objects for a given object type, yielding multiple possible destinations for each object. The SP consists of finding a shortest vehicle route starting and ending at an arbitrary vertex, in such a way that each object is repositioned in its final state. This article exhibits some structural properties of optimal solutions and proposes a branch-and-cut algorithm based on a 0-1 formulation of the problem. Computational results on random instances containing up to 200 vertices and eight object types are reported.

show abstract

A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery

Cited by 170 publications

References 10 publications

The one‐commodity pickup and delivery travelling salesman problem on a path or a tree

The one‐commodity pickup and delivery travelling salesman problem on a path or a tree

Balancing the stations of a self service “bike hire” system

A branch‐and‐cut algorithm for the nonpreemptive swapping problem

Contact Info

Product

Resources

About