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

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

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

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

90C90: Applications of mathematical programming

90C10: Integer programming

90C05: Linear programming

90C15: Stochastic programming

90B05: Inventory, storage, reservoirs

Related Items

Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution, Location-routing: issues, models and methods, 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, Stochastic vehicle routing, Combined location-routing problems: A synthesis and future research directions, Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands, Heuristic solutions to multi-depot location-routing problems, Designing multi-vehicle delivery tours in a grid-cell format, Bounds for probabilistic integer programming problems, Routing problems: A bibliography, A solution method for a two-dispatch delivery problem with stochastic customers, Solving the vehicle routing problem with stochastic demands using the cross-entropy method, Fuzzy vehicle routing model with credibility measure and its hybrid intelligent algorithm, Exact solutions to a class of stochastic generalized assignment problems, Vehicle routing with stochastic demands and restricted failures

Cites Work

• Stochastic vehicle routing: A comprehensive approach
• Stochastic vehicle routing with modified savings algorithm
• Stochastic programming
• On the solutions of stochastic traveling salesman problems
• Optimal Routing under Capacity and Distance Restrictions
• Minisum location of a traveling salesman
• Solution of a Large-Scale Traveling-Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item