Models and exact solutions for a class of stochastic location-routing problems

From MaRDI portal

Publication:1123112

Jump to:navigation, search

DOI10.1016/0377-2217(89)90354-8zbMath0676.90019OpenAlexW2027980371MaRDI QIDQ1123112

François V. Louveaux, Hélène Mercure, Gilbert Laporte

Publication date: 1989

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90354-8

zbMATH Keywords

vehicle routing logistics integer linear programs vehicle fleet size depot location stochastic location-routing

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Linear programming (90C05) Stochastic programming (90C15) Inventory, storage, reservoirs (90B05)

Related Items

Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows, A solution method for a two-dispatch delivery problem with stochastic customers, Distribution network design on the battlefield, Robust facility location problem for hazardous waste transportation, The mixed capacitated general routing problem under uncertainty, Satisficing measure approach for vehicle routing problem with time windows under uncertainty, Exact Algorithms for the Chance-Constrained Vehicle Routing Problem, Location-routing: issues, models and methods, Vehicle routing with probabilistic capacity constraints, Routing problems: A bibliography, Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking, Heuristic and lower bound for a stochastic location-routing problem, On a facility location problem with applications to tele-diagnostic, Metaheuristic approaches for solving truck and trailer routing problems with stochastic demands: a case study in dairy industry, Column generation based heuristics for a generalized location routing problem with profits arising in space exploration, Approximating the chance-constrained capacitated vehicle routing problem with robust optimization, The location routing problem with facility sizing decisions, A Branch-and-Cut method for the Capacitated Location-Routing Problem, Location‐routing problem: a classification of recent research, The two-echelon stochastic multi-period capacitated location-routing problem, Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut, The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands, Stochastic single vehicle routing problem with delivery and Pick up and a predefined customer sequence, A stochastic programming approach for Shelter location and evacuation planning, Ant colony optimization with clustering for solving the dynamic location routing problem, Challenges and Advances in A Priori Routing, Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution, Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines, A hybrid evolutionary algorithm for the periodic location-routing problem, Solving the vehicle routing problem with stochastic demands using the cross-entropy method, The capacitated vehicle routing problem with stochastic demands and time windows, Fuzzy vehicle routing model with credibility measure and its hybrid intelligent algorithm, Exact solutions to a class of stochastic generalized assignment problems, Exact algorithms for the chance-constrained vehicle routing problem, Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns, Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem, Designing multi-vehicle delivery tours in a grid-cell format, Stochastic vehicle routing, An approximate dynamic programming approach for the vehicle routing problem with stochastic demands, Vehicle routing with stochastic demands and restricted failures, A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem, Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands, Combined location-routing problems: A synthesis and future research directions, Bounds for probabilistic integer programming problems, A taxonomical analysis, current methods and objectives on location-routing problems, Heuristic solutions to multi-depot location-routing problems, Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1123112&oldid=13171293"