Further results on the probabilistic traveling salesman problem
From MaRDI portal
Publication:2368298
DOI10.1016/0377-2217(93)90145-DzbMath0776.90082MaRDI QIDQ2368298
Louis H. Howell, Dimitris J. Bertsimas
Publication date: 24 August 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
The probabilistic travelling salesman problem with crowdsourcing ⋮ Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling ⋮ Solving a generalized traveling salesperson problem with stochastic customers ⋮ A hybrid scatter search for the probabilistic traveling salesman problem ⋮ A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands ⋮ A concentration inequality for the facility location problem ⋮ Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods ⋮ A vehicle routing problem with multiple service agreements ⋮ The traveling purchaser problem with stochastic prices: exact and approximate algorithms ⋮ 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 ⋮ Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem ⋮ Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem ⋮ Challenges and Advances in A Priori Routing ⋮ Recent Developments in Dynamic Vehicle Routing Systems ⋮ Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines ⋮ Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem ⋮ Aggregation for the probabilistic traveling salesman problem ⋮ Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms ⋮ Solving the probabilistic TSP with ant colony optimization ⋮ A new bi-objective periodic vehicle routing problem with maximization market share in an uncertain competitive environment ⋮ Designing multi-vehicle delivery tours in a grid-cell format ⋮ Stochastic vehicle routing ⋮ A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subadditive Euclidean functionals and nonlinear growth in geometric probability
- An O(N log N) planar travelling salesman heuristic based on spacefilling curves
- Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
- A Dynamic Programming Approach to Sequencing Problems
- The probabilistic minimum spanning tree problem
- Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- Computer Solutions of the Traveling Salesman Problem
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
