The traveling salesman problem with backhauls

DOI10.1016/0305-0548(95)00036-4zbMath0847.90135OpenAlexW2125375576MaRDI QIDQ1915968

Gilbert Laporte, Alain Hertz, Michel Gendreau

Publication date: 1 July 1996

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(95)00036-4

zbMATH Keywords

heuristicstraveling salesmanleast cost Hamiltonian tour

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem, The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), Routing problems: A bibliography, Variable neighborhood search, Self-organizing feature maps for the vehicle routing problem with backhauls, An approximation algorithm for the clustered path travelling salesman problem, An approximation algorithm for the clustered path travelling salesman problem, Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search, Model and algorithm for inventory/routing decision in a three-echelon logistics system, A Heuristic Approach for Cluster TSP, An exact algorithm for the clustered travelling salesman problem, Vehicle routing problems with simultaneous pick-up and delivery service., One-to-Many-to-One Single Vehicle Pickup and Delivery Problems, Variable neighborhood search: Principles and applications, A heuristic for the pickup and delivery traveling salesman problem, Heuristic approaches to vehicle routing with backhauls and time windows, A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service, Perturbation heuristics for the pickup and delivery traveling salesman problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• The symmetric clustered traveling salesman problem
• An algorithm for the traveling salesman problem with pickup and delivery customers
• The vehicle routing problem with backhauls
• Procedures for travelling salesman problems with additional constraints
• A new branching strategy for time constrained routing problems with application to backhauling
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• An Algorithm for the Traveling Salesman Problem