A two-stage vehicle routing model for large-scale bioterrorism emergencies
From MaRDI portal
Publication:3057125
DOI10.1002/net.20337zbMath1203.90051OpenAlexW4253334418MaRDI QIDQ3057125
Zhihong Shen, Fernando Ordóñez, Maged M. Dessouky
Publication date: 24 November 2010
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20337
Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)
Related Items (13)
Models, solutions and enabling technologies in humanitarian logistics ⋮ Modeling and solving profitable location and distribution problems ⋮ Risky traveling salesman problem ⋮ The robust vehicle routing problem with time windows: solution by branch and price and cut ⋮ Combined location and routing problems for drug distribution ⋮ Incomplete information imputation in limited data environments with application to disaster response ⋮ A general framework for assessing the value of social data for disaster response logistics planning ⋮ Vehicle routing problems with split deliveries ⋮ Reliable routing of road-rail intermodal freight under uncertainty ⋮ Relief distribution networks: a systematic review ⋮ A new approach on auxiliary vehicle assignment in capacitated location routing problem ⋮ Sustainable multi-depot emergency facilities location-routing problem with uncertain information ⋮ Solving the humanitarian multi-trip cumulative capacitated routing problem via a grouping metaheuristic algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
- The selective travelling salesman problem
- Multi-objective meta-heuristics for the traveling salesman problem with profits
- Stochastic vehicle routing: A comprehensive approach
- Stochastic vehicle routing with modified savings algorithm
- Stochastic vehicle routing
- The team orienteering problem
- A fast and effective heuristic for the orienteering problem
- An optimal solution procedure for the multiple tour maximum collection problem using column generation
- A heuristic for the multiple tour maximum collection problem
- Vehicle routing with split deliveries
- Strong linear programming relaxations for the orienteering problem
- A minimal algorithm for the multiple-choice knapsack problem
- A tabu search heuristic for the undirected selective travelling salesman problem
- Using artificial neural networks to solve the orienteering problem
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- A guided local search metaheuristic for the team orienteering problem
- An exact algorithm for team orienteering problems
- Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem
- Stochastic Vehicle Routing Problem with Restocking
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
- Split delivery routing
- Generalized Dynamic Programming for Stochastic Combinatorial Optimization
- Shiing-shen Chern: 1911–2004
- A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
- The orienteering problem
- Savings by Split Delivery Routing
- A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem
- The Vehicle Routing Problem with Stochastic Travel Times
- An Optimal Algorithm for the Orienteering Tour Problem
- A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- Solving the Orienteering Problem through Branch-and-Cut
- Algorithms for a stochastic selective travelling salesperson problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
- The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Vehicle Routing Problem with Stochastic Demand
This page was built for publication: A two-stage vehicle routing model for large-scale bioterrorism emergencies
