Heuristic and lower bound for a stochastic location-routing problem

DOI10.1016/j.ejor.2005.04.051zbMath1163.90582OpenAlexW2072924020MaRDI QIDQ864014

Maria Albareda-Sambola, Gilbert Laporte, Elena Fernández

Publication date: 12 February 2007

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.04.051

zbMATH Keywords

stochastic programminglocation-routing

Mathematics Subject Classification ID

Stochastic programming (90C15) Discrete location and assignment (90B80)

Related Items

A hybrid clonal selection algorithm for the location routing problem with stochastic demands, Distribution network design on the battlefield, A survey of recent research on location-routing problems, Robust facility location problem for hazardous waste transportation, A survey of variants and extensions of the location-routing problem, Stochastic hub location problems with Bernoulli demands, Location-routing: issues, models and methods, Battery swap station location-routing problem with capacitated electric vehicles, A profit-maximization location-routing-pricing problem: a branch-and-price algorithm, A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study, A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands, 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, A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs, Public transportation hub location with stochastic demand: an improved approach based on multiple attribute group decision-making, A two-stage robust approach to integrated station location and rebalancing vehicle service design in bike-sharing systems, A taxonomical analysis, current methods and objectives on location-routing problems

Cites Work

• Unnamed Item
• Unnamed Item
• Models and exact solutions for a class of stochastic location-routing problems
• Combined location-routing problems: A synthesis and future research directions
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Integer Programming Formulation of Traveling Salesman Problems
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
• A Priori Optimization of the Probabilistic Traveling Salesman Problem
• Introduction to Stochastic Programming
• A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
• The stochastic generalised assignment problem with Bernoulli demands