Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks
type: Item
instance of: scholarly article
title: Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks
zbMATH Open document ID: 1391.90530
author: Sebastián Urrutia
author: Armando Honorio Pereira
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6901564
zbMATH Keywords: traveling salesman
zbMATH Keywords: loading constraints
zbMATH Keywords: branch-and-cut
zbMATH Keywords: pickup and delivery
zbMATH Keywords: multiple stacks
MaRDI profile type: Publication
full work available at URL: j.cor.2018.01.005
OpenAlex ID: W2782491103
cites work: The precedence-constrained asymmetric traveling salesman polytope
cites work: An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
cites work: Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
cites work: Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks
cites work: Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
cites work: A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
cites work: A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
cites work: Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
cites work: The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
cites work: The pickup and delivery traveling salesman problem with first-in-first-out loading
cites work: Routing problems with loading constraints
cites work: Optimal routing of multiple-load AGV subject to LIFO loading constraints
cites work: The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
cites work: An exact method for the double TSP with multiple stacks
cites work: Exact solutions to the double travelling salesman problem with multiple stacks
cites work: The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
cites work: Vehicle routing problems with loading constraints: state-of-the-art and future directions
cites work: New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
DOI: 10.1016/J.COR.2018.01.005
description: scientific article; zbMATH DE number 6901564