A Priori Optimization
From MaRDI portal
Publication:5753749
DOI10.1287/opre.38.6.1019zbMath0721.90062OpenAlexW2143466467WikidataQ89227053 ScholiaQ89227053MaRDI QIDQ5753749
Amedeo R. Odoni, Patrick Jaillet, Dimitris J. Bertsimas
Publication date: 1990
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0e056994b53bbb692582a5e4693aad2f1b774bba
vehicle routingtraveling salesmanfacility locationminimum spanning treea priori optimizationreoptimizationpolynomial time heuristics
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Stochastic programming (90C15) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem, A New Approach for Vehicle Routing with Stochastic Demand: Combining Route Assignment with Process Flexibility, A survey on combinatorial optimization in dynamic environments, On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows, Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation, A branch-and-price approach for a multi-period vehicle routing problem, Faster rollout search for the vehicle routing problem with stochastic demands and restocking, The probabilistic orienteering problem, Routing problems: A bibliography, Solving a generalized traveling salesperson problem with stochastic customers, On the longest path of a randomly weighted tournament, Approximation algorithms for the a priori traveling repairman, A hybrid scatter search for the probabilistic traveling salesman problem, Arc routing under uncertainty: introduction and literature review, 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 Vehicle Routing Problem with Stochastic Demands and Split Deliveries, Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures, An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands, Technical Note—Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic Demands, Algorithms for the universal and a priori TSP, 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, Challenges and Advances in A Priori Routing, Recent Developments in Dynamic Vehicle Routing Systems, An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy, 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, Dynamic journeying under uncertainty, Scheduling with uncertainties on new computing platforms, Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering, Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports, The capacitated vehicle routing problem with stochastic demands and time windows, Aggregation for the probabilistic traveling salesman problem, On the probabilistic minimum coloring and minimum \(k\)-coloring, 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, Optimal search path for service in the presence of disruptions, Sensitivity analysis of scheduling algorithms, A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands, A priori optimization for the probabilistic maximum independent set problem, Probabilistic graph-coloring in bipartite and split graphs, Designing Networks with Good Equilibria under Uncertainty, On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands, Stochastic vehicle routing, A stochastic and dynamic routing policy using branching processes with state dependent immigration, Planning models for freight transportation, Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem, Vertex-Uncertainty in Graph-Problems, Exactly Solvable Hierarchical Optimization Problem Related to Percolation, A taxonomical analysis, current methods and objectives on location-routing problems, Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
