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

DOI10.1016/j.ejor.2008.05.009zbMath1176.90055OpenAlexW2007496263MaRDI QIDQ1041945

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

Publication date: 7 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.05.009

zbMATH Keywords

traveling salesmanbranch-and-cutdial-a-ridepickup-and-delivery

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (22)

A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem ⋮ Notes on the single route lateral transhipment problem ⋮ A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem ⋮ Stronger multi-commodity flow formulations of the capacitated vehicle routing problem ⋮ A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem ⋮ Single liner shipping service design ⋮ Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem ⋮ Load-dependent and precedence-based models for pickup and delivery problems ⋮ The arc-item-load and related formulations for the cumulative vehicle routing problem ⋮ A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem ⋮ An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows ⋮ The drone-assisted pickup and delivery problem: an adaptive large neighborhood search metaheuristic ⋮ An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation ⋮ A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases ⋮ An ILP-based local search procedure for the VRP with pickups and deliveries ⋮ The multi-pickup and delivery problem with time windows ⋮ Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem ⋮ Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery ⋮ The multi-commodity pickup-and-delivery traveling salesman problem ⋮ An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP

Cites Work

• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• An algorithm for the traveling salesman problem with pickup and delivery customers
• Exact solution of multicommodity network optimization problems with general step cost functions
• The travelling salesman problem with pick-up and delivery
• The pickup and delivery problem: Faces and branch-and-cut algorithm
• Routing a vehicle of capacity greater than one
• A new extension of local search applied to the Dial-A-Ride problem
• A heuristic for the pickup and delivery traveling salesman problem
• Projections of the capacitated network loading problem
• A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
• Perturbation heuristics for the pickup and delivery traveling salesman problem
• The precedence-constrained asymmetric traveling salesman polytope
• Dioïds and semirings: Links to fuzzy sets and other applications
• The dial-a-ride problem: Models and algorithms
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM
• Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
• The swapping problem
• A generalization of max flow—min cut
• Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming
• Network Design Using Cut Inequalities
• On extended formulations for the precedence constrained asymmetric traveling salesman problem

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