Heuristic and lower bound for a stochastic location-routing problem

DOI10.1016/J.EJOR.2005.04.051zbMATH Open1163.90582OpenAlexW2072924020MaRDI QIDQ864014FDOQ864014

Authors: Maria Albareda-Sambola, G. 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

Recommendations

• Models and exact solutions for a class of stochastic location-routing problems
• A survey on stochastic location and routing problems
• scientific article; zbMATH DE number 4051316
• Location-routing: issues, models and methods
• scientific article; zbMATH DE number 1264401

zbMATH Keywords

stochastic programminglocation-routing

Mathematics Subject Classification ID

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

Cites Work

• Integer Programming Formulation of Traveling Salesman Problems
• Models and exact solutions for a class of stochastic location-routing problems
• Combined location-routing problems: A synthesis and future research directions
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• Introduction to Stochastic Programming
• A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
• Title not available (Why is that?)
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• 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
• Title not available (Why is that?)
• The stochastic generalised assignment problem with Bernoulli demands

Cited In (23)

• A taxonomical analysis, current methods and objectives on location-routing problems
• Public transportation hub location with stochastic demand: an improved approach based on multiple attribute group decision-making
• A hybrid clonal selection algorithm for the location routing problem with stochastic demands
• A survey of recent research on location-routing problems
• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study
• Location-routing: issues, models and methods
• On statistical bounds of heuristic solutions to location problems
• Models and exact solutions for a class of stochastic location-routing problems
• Robust facility location problem for hazardous waste transportation
• A compact model and tight bounds for a combined location-routing problem
• A profit-maximization location-routing-pricing problem: a branch-and-price algorithm
• The two-echelon stochastic multi-period capacitated location-routing problem
• Battery swap station location-routing problem with capacitated electric vehicles
• Stochastic hub location problems with Bernoulli demands
• A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands
• Location‐routing problem: a classification of recent research
• Distribution network design on the battlefield
• A probabilistic bi-objective model for a humanitarian location-routing problem under uncertain demand and road closure
• Location-aided routing with uncertainty in mobile ad hoc networks: a stochastic semidefinite programming approach
• A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs
• A two-stage robust approach to integrated station location and rebalancing vehicle service design in bike-sharing systems
• A survey of variants and extensions of the location-routing problem

This page was built for publication: Heuristic and lower bound for a stochastic location-routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q864014)