Parallel tabu search for a pickup and delivery problem under track contention

Caricato, Pierpaolo; Ghiani, Gianpaolo; Grieco, A; Guerriero, Emanuela

doi:10.1016/s0167-8191(03)00046-2

Cited by 15 publications

(5 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…ILP formulations [30] have also been proposed. Typically this line of work ignores coordination costs, though some methods [5] reason about it once candidate solutions are obtained.…”

Section: Related Workmentioning

confidence: 99%

Fast, High-Quality Dual-Arm Rearrangement in Synchronous, Monotone Tabletop Setups

Shome

Solovey

et al. 2018

Preprint

View full text Add to dashboard Cite

Rearranging objects on a planar surface arises in a variety of robotic applications, such as product packaging. Using two arms can improve efficiency but introduces new computational challenges. This paper studies the structure of dual-arm rearrangement for synchronous, monotone tabletop setups and develops an optimal mixed integer model. It then describes an efficient and scalable algorithm, which first minimizes the cost of object transfers and then of moves between objects. This is motivated by the fact that, asymptotically, object transfers dominate the cost of solutions. Moreover, a lazy strategy minimizes the number of motion planning calls and results in significant speedups. Theoretical arguments support the benefits of using two arms and indicate that synchronous execution, in which the two arms perform together either transfers or moves, introduces only a small overhead. Experiments support these points and show that the scalable method can quickly compute solutions close to the optimal for the considered setup.

show abstract

“…ILP formulations [30] have also been proposed. Typically this line of work ignores coordination costs, though some methods [5] reason about it once candidate solutions are obtained.…”

Section: Related Workmentioning

confidence: 99%

Fast, High-Quality Dual-Arm Rearrangement in Synchronous, Monotone Tabletop Setups

Shome

Solovey

et al. 2018

Preprint

View full text Add to dashboard Cite

show abstract

“…Recent studies offer a variety of approaches to solve the VRPPD, including tabu search (Toth and Vigo, 1997;Nanry and Barnes, 2000;Caricato et al, 2003;Attanasio et al, 2004;Montane and Galvao, 2006;Melachrinoudis et al, 2007), genetic algorithms (Rekiek et al, 2006;Ganesh and Narendran, 2007), simulated annealing (Hart, 1996;Li and Lim, 2001), ant colony optimization (Doerner et al, 2001) and hybrid heuristics (Bent and van Hentenryck, 2006). We refer the interested reader to the extensive reviews by Parragh et al (2008aParragh et al ( , 2008b of the problem classifications, formulations, exact and metaheuristic solution approaches.…”

Section: Literature Reviewmentioning

confidence: 99%

An Adaptive Large Neighborhood Search for an E-grocery Delivery Routing Problem

Emeç

Çatay

Bozkaya

2016

Computers & Operations Research

View full text Add to dashboard Cite

“…For the initial solution of the i th repetition, we use the route generated for the i th column of the RLPM. We use a tabu list constructed in the before search as in Caricato et al (2003) while we reduce its size to 3 = 10 κ instead of 1 = 30 κ after the first search. Note that a tabu search's bottleneck is where all routes included in a neighboring value are accurately estimated.…”

Section: Tabu Searchmentioning

confidence: 99%

A Scalable Heuristic for Pickup-and-Delivery of Splittable Loads and Its Application to Military Cargo-Plane Routing

Park¹,

Lee²

2012

Management Science and Financial Engineering

View full text Add to dashboard Cite

This paper is motivated by a military cargo-plane routing problem which is a pickup-and-delivery problem in which load splits and node revisits are allowed (PDPLS). Although this recent evolution of a VRP-model enhances the efficiency of routing, a solution method is more of a challenge since the node revisits entail closed walks in modeling vehicle routes. For such a case, even a compact IP-formulation is not available and an effective method had been lacking until Nowak et al. (2008b) proposed a heuristic based on a tabu search. Their method provides very reasonable solu-tions as demonstrated by the experiments not only in their paper (Nowak et al., 2008b) but also in ours. However, the computation time seems intensive especially for the class of problems with dynamic transportation requests, including the military cargo-plane routing problem. This paper proposes a more scalable algorithm hybridizing a tabu search for pricing subproblem paused as a single-vehicle routing problem, with a column generation approach based on Dantzig-Wolfe decomposition. As tested on a wide variety of instances, our algorithm produces, in average, a solution of an equiva-lent quality in 10~20% of the computation time of the previous method.

show abstract

Parallel tabu search for a pickup and delivery problem under track contention

Cited by 15 publications

References 5 publications

Fast, High-Quality Dual-Arm Rearrangement in Synchronous, Monotone Tabletop Setups

Fast, High-Quality Dual-Arm Rearrangement in Synchronous, Monotone Tabletop Setups

An Adaptive Large Neighborhood Search for an E-grocery Delivery Routing Problem

A Scalable Heuristic for Pickup-and-Delivery of Splittable Loads and Its Application to Military Cargo-Plane Routing

Contact Info

Product

Resources

About