A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
From MaRDI portal
Publication:3818145
DOI10.1287/opre.36.6.929zbMath0665.90096OpenAlexW2129557546MaRDI QIDQ3818145
Publication date: 1988
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5da7c9bd4cc12d71e15ae04f6b84979f4c0bab1f
closed form expressionsroutingexpected lengthtour of minimum lengthProbabilistic Traveling Salesman Problem
Related Items
Uncertain multiobjective traveling salesman problem, A New Approach for Vehicle Routing with Stochastic Demand: Combining Route Assignment with Process Flexibility, A survey on combinatorial optimization in dynamic environments, Routing problem for unmanned aerial vehicle patrolling missions -- a progressive hedging algorithm, The probabilistic travelling salesman problem with crowdsourcing, Stochastic hub location problems with Bernoulli demands, A branch-and-price approach for a multi-period vehicle routing problem, The probabilistic orienteering problem, Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm, Routing problems: A bibliography, Heuristic and lower bound for a stochastic location-routing problem, Solving a generalized traveling salesperson problem with stochastic customers, A hybrid scatter search for the probabilistic traveling salesman problem, A concise guide to existing and emerging vehicle routing problem variants, Probabilistic combinatorial optimization problems on graphs: A new domain in operational research, The probabilistic minimum dominating set problem, On the probabilistic min spanning tree problem, Partial-route inequalities for the multi-vehicle routing problem with stochastic demands, The traveling purchaser problem with stochastic prices: exact and approximate algorithms, Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints, A bi-criteria moving-target travelling salesman problem under uncertainty, Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem, Minimizing worst-case and average-case makespan over scenarios, The dynamic bowser routing problem, Algorithms for the universal and a priori TSP, Dynamic VRP in pharmaceutical distribution -- a case study, Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics, Local search heuristics for the probabilistic dial-a-ride 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, A customized genetic algorithm for bi-objective routing in a dynamic network, Challenges and Advances in A Priori Routing, Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios, A general framework for assessing the value of social data for disaster response logistics planning, Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines, The integer \(L\)-shaped method for stochastic integer programs with complete recourse, Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem, EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM, An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays, Aggregation for the probabilistic traveling salesman problem, New policies for the dynamic traveling salesman problem, On the probabilistic minimum coloring and minimum \(k\)-coloring, Estimation-based metaheuristics for the probabilistic traveling salesman problem, A cutting plane method for risk-constrained traveling salesman problem with random arc costs, Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints, Hybrid metaheuristics for the vehicle routing problem with stochastic demands, The dynamic dispatch waves problem for same-day delivery, A new bi-objective periodic vehicle routing problem with maximization market share in an uncertain competitive environment, Probabilistic graph-coloring in bipartite and split graphs, Routing Optimization Under Uncertainty, On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands, Stochastic vehicle routing, A genetic algorithm for service level based vehicle scheduling, A stochastic and dynamic routing policy using branching processes with state dependent immigration, A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem, Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty, A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands, Vertex-Uncertainty in Graph-Problems, Planning Strategies for Home Health Care Delivery, Hybrid metaheuristics for stochastic constraint programming, Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers, Adaptive Tunning of All Parameters in a Multi-Swarm Particle Swarm Optimization Algorithm: An Application to the Probabilistic Traveling Salesman Problem
