A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q5326770): Difference between revisions

Latest revision as of 18:09, 6 July 2024

scientific article; zbMATH DE number 6195665

Language	Label	Description	Also known as
English	A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks	scientific article; zbMATH DE number 6195665

Statements

instance of

scholarly article

0 references

title

A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (English)

0 references

zbMATH Open document ID

0 references

0 references

0 references

0 references

0 references

0 references

Maria Grazia Speranza

0 references

published in

Networks

0 references

publication date

6 August 2013

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

traveling salesman

0 references

pickup

0 references

delivery

0 references

loading

0 references

multiple stacks

0 references

describes a project that uses

CVRPSP

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1002/net.21459

0 references

OpenAlex ID

W2156398306

0 references

cites work

The precedence-constrained asymmetric traveling salesman polytope

0 references

A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks

0 references

Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading

0 references

A Branch-and-Cut Algorithm for the Dial-a-Ride Problem

0 references

Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading

0 references

A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading

0 references

Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks

0 references

Metaheuristics for the vehicle routing problem with loading constraints

0 references

The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm

0 references

The pickup and delivery traveling salesman problem with first-in-first-out loading

0 references

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

0 references

Ant colony optimization for the two-dimensional loading vehicle routing problem

0 references

Metaheuristics for vehicle routing problems with three-dimensional loading constraints

0 references

A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints

0 references

Routing problems with loading constraints

0 references

Optimal routing of multiple-load AGV subject to LIFO loading constraints

0 references

An exact method for the double TSP with multiple stacks

0 references

Reachability cuts for the vehicle routing problem with time windows

0 references

A new branch-and-cut algorithm for the capacitated vehicle routing problem

0 references

Integer Programming Formulation of Traveling Salesman Problems

0 references

Exact solutions to the double travelling salesman problem with multiple stacks

0 references

The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches

0 references

Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows

0 references

The pickup and delivery problem: Faces and branch-and-cut algorithm

0 references

On the Complexity of the Multiple Stack TSP, kSTSP

0 references

Heuristic and exact algorithms for the multi-pile vehicle routing problem

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5326770

@@ Property / author @@
-Claudia Archetti
@@ Property / author: Claudia Archetti / rank @@
-Normal rank
@@ Property / author @@
-Q286991
@@ Property / author: Q286991 / rank @@
-Normal rank
@@ Property / author @@
+Claudia Archetti
@@ Property / author: Claudia Archetti / rank @@
+Normal rank
@@ Property / author @@
+Maria Grazia Speranza
@@ Property / author: Maria Grazia Speranza / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+CVRPSP
@@ Property / describes a project that uses: CVRPSP / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.21459
@@ Property / full work available at URL: https://doi.org/10.1002/net.21459 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2156398306
@@ Property / OpenAlex ID: W2156398306 / rank @@
+Normal rank
@@ Property / cites work @@
+The precedence-constrained asymmetric traveling salesman polytope
+Normal rank
@@ Property / cites work @@
+A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks
+Normal rank
@@ Property / cites work @@
+Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
+Normal rank
@@ Property / cites work @@
+Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
+Normal rank
@@ Property / cites work @@
+Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
+Normal rank
@@ Property / cites work @@
+Metaheuristics for the vehicle routing problem with loading constraints
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
+Normal rank
@@ Property / cites work @@
+The pickup and delivery traveling salesman problem with first-in-first-out loading
+Normal rank
@@ Property / cites work @@
+The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
+Normal rank
@@ Property / cites work @@
+Ant colony optimization for the two-dimensional loading vehicle routing problem
+Normal rank
@@ Property / cites work @@
+Metaheuristics for vehicle routing problems with three-dimensional loading constraints
+Normal rank
@@ Property / cites work @@
+A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
+Normal rank
@@ Property / cites work @@
+Routing problems with loading constraints
@@ Property / cites work: Routing problems with loading constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal routing of multiple-load AGV subject to LIFO loading constraints
+Normal rank
@@ Property / cites work @@
+An exact method for the double TSP with multiple stacks
+Normal rank
@@ Property / cites work @@
+Reachability cuts for the vehicle routing problem with time windows
+Normal rank
@@ Property / cites work @@
+A new branch-and-cut algorithm for the capacitated vehicle routing problem
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulation of Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Exact solutions to the double travelling salesman problem with multiple stacks
+Normal rank
@@ Property / cites work @@
+The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
+Normal rank
@@ Property / cites work @@
+Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
+Normal rank
@@ Property / cites work @@
+The pickup and delivery problem: Faces and branch-and-cut algorithm
+Normal rank
@@ Property / cites work @@
+On the Complexity of the Multiple Stack TSP, kSTSP
+Normal rank
@@ Property / cites work @@
+Heuristic and exact algorithms for the multi-pile vehicle routing problem
+Normal rank