The multi-commodity pickup-and-delivery traveling salesman problem

DOI10.1002/net.21521zbMath1338.90340OpenAlexW2012108078MaRDI QIDQ2811323

Hipólito Hernández-Pérez, Juan-José Salazar-González

Publication date: 10 June 2016

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21521

zbMATH Keywords

traveling salesmanbranch-and-cutmulti-commodity flowpickup-and-delivery

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (7)

A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer ⋮ A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ Coordinating technician allocation and maintenance routing for offshore wind farms ⋮ Green split multiple-commodity pickup and delivery vehicle routing problem ⋮ An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation ⋮ Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem

Cites Work

• A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
• Dynamic pickup and delivery problems
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• Heuristics for the traveling salesman problem with pickup and delivery
• The travelling salesman problem with pick-up and delivery
• The traveling salesman problem with delivery and backhauls
• Projections of the capacitated network loading problem
• A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
• The precedence-constrained asymmetric traveling salesman polytope
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
• A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Approximating Capacitated Routing and Delivery Problems
• Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming
• An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
• Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
• The General Pickup and Delivery Problem
• A branch‐and‐cut algorithm for the nonpreemptive swapping problem
• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
• On extended formulations for the precedence constrained asymmetric traveling salesman problem

This page was built for publication: The multi-commodity pickup-and-delivery traveling salesman problem