A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks

DOI10.1287/OPRE.36.3.478zbMath0647.90097OpenAlexW2170228269MaRDI QIDQ3792508

David Simchi-Levi, Oded Berman

Publication date: 1988

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.36.3.478

zbMATH Keywords

networkheuristicasymptotic resultsworst case analysisrepair vehicletraveling salesman location problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Inventory, storage, reservoirs (90B05)

Related Items (20)

Reference policies for non-myopic sequential network design and timing problems ⋮ A reliable budget-constrained FL/ND problem with unreliable facilities ⋮ Distribution network design on the battlefield ⋮ Optimal deployment of alternative fueling stations on transportation networks considering deviation paths ⋮ Heuristics and bounds for the travelling salesman location problem on the plane ⋮ A branch and price approach for routing and refueling station location model ⋮ Location of alternative-fuel stations using the flow-refueling location model and dispersion of candidate sites on arcs ⋮ Location-routing: issues, models and methods ⋮ Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model ⋮ Multi-depot traveling salesmen location problems on networks with special structure ⋮ The probabilistic uncapacitated open vehicle routing location problem ⋮ Solution approaches for the stochastic capacitated traveling salesmen location problem with recourse ⋮ A network location-allocation model trading off flow capturing and \(p\)- median objectives ⋮ Capacitated facility location/network design problems. ⋮ A particle swarm optimization algorithm with path relinking for the location routing problem ⋮ Facility location models for distribution system design ⋮ A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands ⋮ Combined location-routing problems: A synthesis and future research directions ⋮ A taxonomical analysis, current methods and objectives on location-routing problems ⋮ Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty

This page was built for publication: A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks