A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem

Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Cites Work

Title not available (Why is that?)
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
Local branching
The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
Variable neighborhood search
Matheuristics
Exploring relaxation induced neighborhoods to improve MIP solutions
Greedy randomized adaptive search procedures
Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
The swapping problem
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
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
The General Pickup and Delivery Problem
On extended formulations for the precedence constrained asymmetric traveling salesman problem
A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
An algorithm for the traveling salesman problem with pickup and delivery customers
A heuristic for the pickup and delivery traveling salesman problem
Models for the single-vehicle preemptive pickup and delivery problem
The traveling salesman problem with backhauls

Cited In (8)

The multi-commodity pickup-and-delivery traveling salesman problem
A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem
An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
Load-dependent and precedence-based models for pickup and delivery problems
A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery
An ILP-based local search procedure for the VRP with pickups and deliveries
A survey on matheuristics for routing problems

Uses Software

TSPLIB

This page was built for publication: A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2359136)