Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers

DOI10.1287/trsc.22.2.148zbMath0653.90082OpenAlexW2017530399MaRDI QIDQ3799835

David Simchi-Levi, Oded Berman

Publication date: 1988

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.22.2.148

zbMATH Keywords

branch and boundnetworkslower boundtransportation problemprobabilistic traveling salesmana priori tourmultistop locationmultistop routingtour with a minimum expected length

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15) Inventory, storage, reservoirs (90B05) Graph theory (05C99)

Related Items (16)

A hybrid clonal selection algorithm for the location routing problem with stochastic demands ⋮ Further results on the probabilistic traveling salesman problem ⋮ Distribution network design on the battlefield ⋮ The probabilistic travelling salesman problem with crowdsourcing ⋮ Stochastic hub location problems with Bernoulli demands ⋮ Location-routing: issues, models and methods ⋮ Location and layout planning. A survey ⋮ Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures ⋮ Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem ⋮ Challenges and Advances in A Priori Routing ⋮ Aggregation for the probabilistic traveling salesman problem ⋮ Exact solutions to a class of stochastic generalized assignment problems ⋮ Optimal search path for service in the presence of disruptions ⋮ A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands ⋮ Stochastic vehicle routing ⋮ A taxonomical analysis, current methods and objectives on location-routing problems

This page was built for publication: Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers