A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands

DOI10.1016/S0305-0548(00)00009-5zbMath1027.90034OpenAlexW1995477767WikidataQ127960080 ScholiaQ127960080MaRDI QIDQ5953168

William B. Carter, Yupo Chan, Michael D. Burnes

Publication date: 9 April 2002

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00009-5

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22)

Related Items

Multi-level supply chain network design with routing ⋮ Distribution network design on the battlefield ⋮ Location-routing: issues, models and methods ⋮ A solution method for a two-layer sustainable supply chain distribution model ⋮ Battery swap station location-routing problem with capacitated electric vehicles ⋮ Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking ⋮ A two-phase heuristic algorithm for the common frequency routing problem with vehicle type choice in the milk run ⋮ A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study ⋮ Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands ⋮ A Branch-and-Cut method for the Capacitated Location-Routing Problem ⋮ Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut ⋮ Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data ⋮ Integrated supply chain planning under uncertainty using an improved stochastic approach ⋮ A stochastic programming approach for Shelter location and evacuation planning ⋮ Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network ⋮ Ant colony optimization with clustering for solving the dynamic location routing problem ⋮ A hybrid evolutionary algorithm for the periodic location-routing problem ⋮ Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem ⋮ A robust location-arc routing problem under uncertainty: mathematical model with lower and upper bounds ⋮ Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem ⋮ A new approach on auxiliary vehicle assignment in capacitated location routing problem ⋮ Lower and upper bounds for a capacitated plant location problem with multicommodity flow ⋮ Facility location and supply chain management. A review ⋮ Sustainable multi-depot emergency facilities location-routing problem with uncertain information ⋮ A taxonomical analysis, current methods and objectives on location-routing problems ⋮ The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Integer linear programming formulation for a vehicle routing problem
• Dual decomposition in stochastic integer programming
• The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem
• A remark on ``Integer linear programming formulation for a vehicle routing problem by N. R. Achutan and L. Caccetta, or how to use the Clark \(\&\) Wright savings to write such integer linear programming formulations
• A new heuristic algorithm for probabilistic optimization
• Integer linear programming formulation for vehicle routing problems
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Stochastic decomposition. A statistical method for large scale stochastic linear programming
• Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
• Solving stochastic programs with simple recourse
• Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
• A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks
• Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers
• Savings by Split Delivery Routing
• A Priori Optimization of the Probabilistic Traveling Salesman Problem
• Introduction to Stochastic Programming
• Traveling Salesman Facility Location Problems
• A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• A Priori Optimization