The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
type: Item
instance of: scholarly article
title: The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
zbMATH Open document ID: 1162.90353
author: M. T. Ortuño
author: Gregorio Tirado
author: Angel Felipe
published in: Computers \& Operations Research
publication date: 2009-06-18T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 5566390
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: variable neighborhood search
zbMATH Keywords: LIFO loading
MaRDI profile type: Publication
full work available at URL: j.cor.2009.01.015
OpenAlex ID: W2068330535
cites work: Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
cites work: Variable neighborhood search 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 LIFO loading
cites work: Q4532231
cites work: Metaheuristics for the vehicle routing problem with loading constraints
cites work: The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
cites work: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
cites work: Variable neighborhood search: Principles and applications
cites work: Q4434988
cites work: The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
cites work: Variable neighborhood search
cites work: The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
DOI: 10.1016/J.COR.2009.01.015
Recommended article: New neighborhood structures for the double traveling salesman problem with multiple stacks
Recommended article: The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
Recommended article: A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks
Recommended article: Approximation of the double traveling salesman problem with multiple stacks
Recommended article: Efficient algorithms for the double traveling salesman problem with multiple stacks
Recommended article: Exact solutions to the double travelling salesman problem with multiple stacks
Recommended article: A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks
Recommended article: A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks
Recommended article: A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks
Recommended article: Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
description: scientific article; zbMATH DE number 5566390