A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks

DOI10.1287/OPRE.36.3.478MaRDI QIDQ3792508zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• The Capacitated Traveling Salesman Location Problem
• Minisum location of a traveling salesman
• Traveling Salesman Facility Location Problems
• Heuristics and bounds for the travelling salesman location problem on the plane
• The Traveling Salesman Location Problem on Stochastic Networks

Cited in

(29)

• Reference policies for non-myopic sequential network design and timing problems
• A taxonomical analysis, current methods and objectives on location-routing problems
• Location of alternative-fuel stations using the flow-refueling location model and dispersion of candidate sites on arcs
• Traveling Salesman Facility Location Problems
• Facility location models for distribution system design
• The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic
• Location-routing: issues, models and methods
• Capacitated facility location/network design problems.
• An exact algorithm for maximum electric vehicle flow coverage problem with heterogeneous chargers, nonlinear charging time and route deviations
• Combined location-routing problems: A synthesis and future research directions
• A reliable budget-constrained FL/ND problem with unreliable facilities
• Solution approaches for the stochastic capacitated traveling salesmen location problem with recourse
• Minisum location of a travelling salesman on simple networks
• Optimal deployment of alternative fueling stations on transportation networks considering deviation paths
• Heuristics and bounds for the travelling salesman location problem on the plane
• Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty
• A network location-allocation model trading off flow capturing and \(p\)- median objectives
• Minisum location of a traveling salesman
• A branch and price approach for routing and refueling station location model
• Multi-depot traveling salesmen location problems on networks with special structure
• Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model
• The Traveling Salesman Location Problem on Stochastic Networks
• A particle swarm optimization algorithm with path relinking for the location routing problem
• Heuristics for the stochastic Eulerian tour problem
• A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands
• Distribution network design on the battlefield
• scientific article; zbMATH DE number 3869068 (Why is no real title available?)
• An efficient heuristic algorithm for the bottleneck traveling salesman problem
• The probabilistic uncapacitated open vehicle routing location problem

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

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