The double traveling salesman problem with multiple stacks: A variable neighborhood search approach

Felipe, Ángel; Ortuño, M.; Tirado, Gregorio

doi:10.1016/j.cor.2009.01.015

Cited by 49 publications

(34 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For a complete feasible packing we must be able to place pallets 5 and 6 in positions (3,2) and (4,2) so that π(6) < π(5) and δ(6) < δ (5). The pallets must be placed in different columns to allow this.…”

Section: As π(2) < π(5) π(2) < π(6) π(2) > π(9) δ(2) > δ(5) δ(2) mentioning

confidence: 98%

“…[5,6], and [11] and these are, currently, the only ways to solve realworld sized problems, which can have many more customers. Instances in Ref.…”

Section: Introductionmentioning

confidence: 99%

“…[11] contain up to 66 customers, while those in Refs. [5,6] have as many as 132. Given the fact that only extremely poor lower bounds are given for such large instances, questions still remain as to the quality of the obtained solutions.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Improved exact method for the double TSP with multiple stacks

Lusby

Larsen

2011

Networks

View full text Add to dashboard Cite

The Double TSP with Multiple Stacks is a logistics problem where one must, using a container, transport a given number of orders from a set of pickup customers to a set of delivery customers at minimum cost. Each order corresponds to the movement of one pallet, all pickups must be completed before the first delivery, and the container cannot be repacked once packed. In this paper we improve the previously proposed exact method of Lusby et al. (Int Trans Oper Res 17 (2010), 637-652) through an additional preprocessing technique that uses the longest common subsequence between the respective pickup and delivery problems. The results suggest an impressive improvement, and we report, for the first time, optimal solutions to several unsolved instances from the literature containing 18 customers. Instances with 28 customers are also shown to be solvable within a few percent of optimality.

show abstract

Section: As π(2) < π(5) π(2) < π(6) π(2) > π(9) δ(2) > δ(5) δ(2) mentioning

confidence: 98%

“…[5,6], and [11] and these are, currently, the only ways to solve realworld sized problems, which can have many more customers. Instances in Ref.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Improved exact method for the double TSP with multiple stacks

Lusby

Larsen

2011

Networks

View full text Add to dashboard Cite

show abstract

“…Incidentally, the work of Felipe et al [6] is based on heuristic procedures using neighborhood searches, whereas Toulouse [12] derived an approximation scheme.…”

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

“…VNS is a general metaheuristic applicable in various areas such that it has been successfully applied in different combinatorial optimization problems such as the Traveling Salesman Problem [2], the Open Vehicle Routing problem [3], the p-Median problem [4], and the Graph problems [5].…”

Section: Introductionmentioning

confidence: 99%