New neighborhood structures for the Double Traveling Salesman Problem with Multiple Stacks

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

doi:10.1007/s11750-009-0080-9

Cited by 20 publications

(12 citation statements)

References 17 publications

(20 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the route‐based approaches, depending on the number of stacks, the major part of the solution space is composed of infeasible solutions. This fact leads to the development of complex move operators to avoid the evaluation of infeasible solutions (Felipe et al., , ).…”

Section: Optimal Routes From Loading Plan Via Dpmentioning

confidence: 99%

See 1 more Smart Citation

A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks

Urrutia

Milanés

Løkketangen

2013

Int Trans Operational Res

View full text Add to dashboard Cite

The double traveling salesman problem with multiple stacks consists in determining a pair of routes (pickup and delivery) for a unique vehicle in two different and disjoint networks. It models a realistic transportation problem with loading/unloading constraints imposed by having a set of last-in-first-out (LIFO) stacks used for storing the goods being transported. The arrangement of the items in the container determines the loading plan that in terms constrains both routes. In this paper, we propose a novel local search approach. The local search heuristic is applied to the loading plan instead of working directly on the routes. A dynamic programming algorithm is used to map the loading plan solution into corresponding optimal routes. Computational results show that the proposed approach is competitive with state-of-the-art heuristics for the problem.

show abstract

Section: Optimal Routes From Loading Plan Via Dpmentioning

confidence: 99%

“…Four complex route operators (and their associated neighborhoods) as well as a variable neighborhood search heuristic are introduced in Felipe et al. (, ). A new approach by the same authors is presented in Felipe et al.…”

Section: Introductionmentioning

confidence: 99%

A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks

Urrutia

Milanés

Løkketangen

2013

Int Trans Operational Res

View full text Add to dashboard Cite

show abstract

“…A VNS algorithm for the DTSPMS was proposed by Felipe et al (2009). Lusby et al (2010) presented an exact algorithm, which generates the k best solutions for each of the two separate routes, and looks for the lowest cost pair (if any) that allows a feasible stacking plan.…”

Section: The Double Traveling Salesman Problem With Multiple Stacksmentioning

confidence: 99%

Routing problems with loading constraints

Iori

Martello

2010

TOP

190

103

View full text Add to dashboard Cite

We consider difficult combinatorial optimization problems arising in transportation logistics when one is interested in optimizing both the routing of vehicles and the loading of goods into them. The separate problems (routing and loading) are already NP-hard, and very difficult to solve in practice. A fortiori their combination is extremely challenging and stimulating. Although the specific literature is still quite limited, a first attempt to a systematic view of this field can be useful both to academic researchers and to practitioners. We review vehicle routing problems with twoand three-dimensional loading constraints. Other combinations of routing and special loading constraints arising from industrial applications are also considered

show abstract

“…[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%

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

New neighborhood structures for the Double Traveling Salesman Problem with Multiple Stacks

Abstract: Traveling Salesman Problem, Metaheuristics, Neighborhood structures, Precedence constraints, LIFO loading, 90C27,

Cited by 20 publications

References 17 publications

A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks

A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks

Routing problems with loading constraints

Improved exact method for the double TSP with multiple stacks

Contact Info

Product

Resources

About