Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem

DOI10.1002/rnc.1701zbMath1244.90032OpenAlexW2124273608MaRDI QIDQ2903995

Sivakumar Rathinam, Riddhi Doshi, Sai Yadlapalli, Swaroop Darbha

Publication date: 4 August 2012

Published in: International Journal of Robust and Nonlinear Control (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1969.1/ETD-TAMU-2010-08-7736

zbMATH Keywords

heuristicsvehicle routingapproximation algorithmsHamiltonian pathheterogeneous vehicles

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Cooperative control of autonomous systems ⋮ Heuristics for routing heterogeneous unmanned vehicles with fuel constraints

Uses Software

• LKH
• Blossom V
• Boost

Cites Work

• Unnamed Item
• Unnamed Item
• Blossom V: A new implementation of a minimum cost perfect matching algorithm
• General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
• Analysis of Christofides' heuristic: some paths are more difficult than cycles
• Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• The traveling salesman problem and its variations
• \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem
• An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
• Integer linear programming formulations of multiple salesman problems and its variations
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Integer Programming Formulation of Traveling Salesman Problems
• An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
• A Cutting Planes Algorithm for the m-Salesmen Problem
• The Traveling Salesman Problem with Distances One and Two
• Paths, Trees, and Flowers
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem