A Priori Optimization of the Probabilistic Traveling Salesman Problem
From MaRDI portal
Publication:4305756
DOI10.1287/opre.42.3.543zbMath0810.90124OpenAlexW2044009541MaRDI QIDQ4305756
Gilbert Laporte, François V. Louveaux, Hélène Mercure
Publication date: 15 September 1994
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.42.3.543
Programming involving graphs or networks (90C35) Integer programming (90C10) Stochastic programming (90C15)
Related Items
The probabilistic travelling salesman problem with crowdsourcing, Stochastic hub location problems with Bernoulli demands, 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 vehicle routing problem with multiple service agreements, Solving the multidepot vehicle routing problem with limited depot capacity and 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, Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures, Routing Courier Delivery Services with Urgent Demand, Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem, 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, Challenges and Advances in A Priori Routing, Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios, The Benders decomposition algorithm: a literature review, Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines, 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, Solving the vehicle routing problem with stochastic demands using the cross-entropy method, Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports, Aggregation for the probabilistic traveling salesman problem, Estimation-based metaheuristics 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 cutting plane method for risk-constrained traveling salesman problem with random arc costs, A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands, The dynamic dispatch waves problem for same-day delivery, The double exponential runtime is tight for 2-stage stochastic ILPs, The double exponential runtime is tight for 2-stage stochastic ILPs, On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands, Stochastic vehicle routing, A survey on metaheuristics for stochastic combinatorial optimization, Improving the Integer L-Shaped Method, A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem, Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty
