A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs

DOI10.1002/net.22096MaRDI QIDQ6064162

Unnamed Author, Tieming Liu

Publication date: 12 December 2023

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

traveling salesman problemprecedence constraintsbranch-and-cutpickup-and-deliverylast-in-first-outhandling cost

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• The pickup and delivery problem: Faces and branch-and-cut algorithm
• The pickup and delivery traveling salesman problem with handling costs
• Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
• The precedence-constrained asymmetric traveling salesman polytope
• The Truck Dispatching Problem
• Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
• Vehicle Routing
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
• A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
• A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading

This page was built for publication: A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs