The double travelling salesman problem with multiple stacks – Formulation and heuristic solution approaches

Petersen, Hanne Løhmann; Madsen, Oli B.G.

doi:10.1016/j.ejor.2008.08.009

Cited by 88 publications

(105 citation statements)

References 16 publications

Supporting

Mentioning

104

Contrasting

Order By: Relevance

“…The double travelling salesman problem with multiple stacks (DTSPMS) was originally proposed in [12]. The problem is essentially a pickup and delivery problem where all orders are collected before any delivery takes place.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An exact method for the double TSP with multiple stacks

Lusby¹,

Larsen²,

Ehrgott

et al. 2010

Int Trans Operational Res

View full text Add to dashboard Cite

The double travelling salesman problem with multiple stacks (DTSPMS) is a pickup and delivery problem in which all pickups must be completed before any deliveries can be made. The problem originates from a real-life application where a 40 foot container (configured as 3 columns of 11 rows) is used to transport up to 33 pallets from a set of pickup customers to a set of delivery customers. The pickups and deliveries are performed in two separate trips, where each trip starts and ends at a depot and visits a number of customers. The aim of the problem is to produce a stacking plan for the pallets that minimizes the total transportation cost (ignoring the cost of transporting the container between the depots of the two trips) given that the container cannot be repacked at any stage. In this paper we present an exact solution method based on matching k-best TSP solutions for each of the separate pickup and delivery TSP problems and show that previously unsolved instances can be solved within seconds using this approach.

show abstract

Section: Introductionmentioning

confidence: 99%

“…To the authors' knowledge, the only paper that treats this problem is [12]. Here the problem is generalized to r rows and c columns, and problem instances of sizes 10 (5 rows by 2 columns), 12 (4 rows by 3 columns), 33 (11 rows by 3 columns) and 66 (11 rows by 6 columns) are introduced and solved.…”

Section: Introductionmentioning

confidence: 99%

An exact method for the double TSP with multiple stacks

Lusby¹,

Larsen²,

Ehrgott

et al. 2010

Int Trans Operational Res

View full text Add to dashboard Cite

show abstract

“…Let U = {U 0 , U 1 , U 2 , U 3 } be the partition associated with H. Since in H there are no arcs in U 3 or leaving U 3 , if C is a hamiltonian circuit, then χ C (B) ≤ H . Suppose that C 1 and C 2 are consistent hamiltonian circuits and violate (9). We may assume that χ C 1 (B) = H , and there exists v 3 ∈ U 3 such that C 1 ∩ B is a path covering U 0 ∪ U 1 ∪ U 2 ∪ {v 3 }.…”

Section: Valid Inequalitiesmentioning

confidence: 99%

“…Our problem is a relaxation of the capacitated traveling salesman with multiple stacks recently introduced by Petersen et al in [9], where, in addition, stacks may not contain more than p items. They provided a mathematical formulation and then developped a local search algorithm to heuristically solve the problem on their set of instances.…”

Section: Introductionmentioning

confidence: 99%

The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks

Borne

Grappe

Lacroix

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In the uncapacitated asymmetric traveling salesman with multiple stacks, we perform a hamiltonian circuit to pick up n items, storing them in a vehicle with k stacks satisfying last-in-first-out constraints, and then we deliver every item by performing a hamiltonian circuit. We are interested in the convex hull of the (arc-)incidence vectors of such couples of hamiltonian circuits. For the general case, we determine the dimension of this polytope, and show that every facet of the asymmetric traveling salesman polytope defines one of its facets. For the special case with two stacks, we provide an integer linear programming formulation whose linear relaxation is polynomial-time solvable, and we propose new families of valid inequalities to reinforce this linear relaxation.

show abstract

“…However, we are interested in a comparison of solution methods based on wall clock time: t max . Therefore temperature is reduced in dependence of time instead of a static parameter: T (t) = T s ( Te Ts ) t tmax [19]. The function ensures that T (0) = T s and T (t max ) = T e .…”

Section: With Next Iteration Of the Main Loop End If End For T ← Updamentioning

confidence: 99%

Scalable Grid Resource Allocation for Scientific Workflows Using Hybrid Metaheuristics

Buss

Lee

Veit

2010

Advances in Grid and Pervasive Computing

View full text Add to dashboard Cite

Abstract. Grid infrastructure is a valuable tool for scientific users, but it is characterized by a high level of complexity which makes it difficult for them to quantify their requirements and allocate resources. In this paper, we show that resource trading is a viable and scalable approach for scientific users to consume resources. We propose the use of Grid resource bundles to specify supply and demand combined with a hybrid metaheuristic method to determine the allocation of resources in a market-based approach. We evaluate this through the application domain of scientific workflow execution on the Grid.

show abstract

The double travelling salesman problem with multiple stacks – Formulation and heuristic solution approaches

Cited by 88 publications

References 16 publications

An exact method for the double TSP with multiple stacks

An exact method for the double TSP with multiple stacks

The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks

Scalable Grid Resource Allocation for Scientific Workflows Using Hybrid Metaheuristics

Contact Info

Product

Resources

About