A Priori Optimization

From MaRDI portal
Revision as of 05:02, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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




Related Items (57)

A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problemA New Approach for Vehicle Routing with Stochastic Demand: Combining Route Assignment with Process FlexibilityA survey on combinatorial optimization in dynamic environmentsOn-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windowsSolving multiobjective vehicle routing problem with stochastic demand via evolutionary computationA branch-and-price approach for a multi-period vehicle routing problemFaster rollout search for the vehicle routing problem with stochastic demands and restockingThe probabilistic orienteering problemRouting problems: A bibliographySolving a generalized traveling salesperson problem with stochastic customersOn the longest path of a randomly weighted tournamentApproximation algorithms for the a priori traveling repairmanA hybrid scatter search for the probabilistic traveling salesman problemArc routing under uncertainty: introduction and literature reviewA concise guide to existing and emerging vehicle routing problem variantsProbabilistic combinatorial optimization problems on graphs: A new domain in operational researchThe probabilistic minimum dominating set problemOn the probabilistic min spanning tree problemPartial-route inequalities for the multi-vehicle routing problem with stochastic demandsThe Vehicle Routing Problem with Stochastic Demands and Split DeliveriesAsymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failuresAn integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demandsTechnical Note—Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic DemandsAlgorithms for the universal and a priori TSPRoute stability in vehicle routing decisions: a bi-objective approach using metaheuristicsLocal search heuristics for the probabilistic dial-a-ride problemDiversified local search strategy under scatter search framework for the probabilistic traveling salesman problemChallenges and Advances in A Priori RoutingRecent Developments in Dynamic Vehicle Routing SystemsAn exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policyRuntime reduction techniques for the probabilistic traveling salesman problem with deadlinesDifferent initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problemDynamic journeying under uncertaintyScheduling with uncertainties on new computing platformsHybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clusteringMetaheuristics for the dynamic stochastic dial-a-ride problem with expected return transportsThe capacitated vehicle routing problem with stochastic demands and time windowsAggregation for the probabilistic traveling salesman problemOn the probabilistic minimum coloring and minimum \(k\)-coloringEstimation-based metaheuristics for the probabilistic traveling salesman problemLocal search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithmsSolving the probabilistic TSP with ant colony optimizationOptimal search path for service in the presence of disruptionsSensitivity analysis of scheduling algorithmsA multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demandsA priori optimization for the probabilistic maximum independent set problemProbabilistic graph-coloring in bipartite and split graphsDesigning Networks with Good Equilibria under UncertaintyOn the one-commodity pickup-and-delivery traveling salesman problem with stochastic demandsStochastic vehicle routingA stochastic and dynamic routing policy using branching processes with state dependent immigrationPlanning models for freight transportationAdaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problemVertex-Uncertainty in Graph-ProblemsExactly Solvable Hierarchical Optimization Problem Related to PercolationA taxonomical analysis, current methods and objectives on location-routing problemsEstimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers




This page was built for publication: A Priori Optimization