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

Authors:
I. Rodríguez-Martín;Juan José Salazar-González
Affiliations:
DEIOC, Universidad de La Laguna, Spain;DEIOC, Universidad de La Laguna, Spain
Venue:
INOC'11 Proceedings of the 5th international conference on Network optimization
Year:
2011

Citing 7
Cited 0

A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints

Computational Optimization and Applications
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem

INFORMS Journal on Computing
Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem

Transportation Science
Exploring relaxation induced neighborhoods to improve MIP solutions

Mathematical Programming: Series A and B
A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery

Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
On extended formulations for the precedence constrained asymmetric traveling salesman problem

Networks
Matheuristics: Hybridizing Metaheuristics and Mathematical Programming

Matheuristics: Hybridizing Metaheuristics and Mathematical Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses an extension of the TSP where a vehicle with a limited capacity must transport certain commodities from their origins to their destinations. Each commodity has a weight, and the objective is to find a minimum length Hamiltonian tour satisfying all the transportation requests without ever violating the capacity constraint.We propose for this problem a heuristic approach that combines mathematical programming and metaheuristic techniques. The method is able to improve the best known solutions for a set of instances from the literature in a reasonable amount of computation time.