Designing delivery districts for the vehicle routing problem with stochastic demands
From MaRDI portal
Publication:872114
DOI10.1016/j.ejor.2005.11.070zbMath1121.90021OpenAlexW2014621992MaRDI QIDQ872114
Dag Haugland, Gilbert Laporte, Sin C. Ho
Publication date: 27 March 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.11.070
Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Shadow prices in territory division, Geometric partitioning and robust ad-hoc network design, Towards a stochastic programming modeling framework for districting, A single vehicle routing problem with pickups and deliveries, continuous random demands and predefined customer order, Territory design for the multi-period vehicle routing problem with time windows, Satisficing measure approach for vehicle routing problem with time windows under uncertainty, On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows, Local search heuristics for sectoring routing in a household waste collection context, Integrating territory design and routing problems, Dynamic design of sales territories, Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm, An optimization-based approach for the healthcare districting under uncertainty, Visual attractiveness in vehicle routing via bi-objective optimization, A sample approximation solution procedure for chance-constrained districting problems, Demand management for attended home delivery -- a literature review, Territorial design for customers with demand frequency, Wasserstein Distance and the Distributionally Robust TSP, A stochastic single vehicle routing problem with a predefined sequence of customers and collection of two similar materials, Integrated districting, fleet composition, and inventory planning for a multi-retailer distribution system, A GRASP-Tabu heuristic approach to territory design for pickup and delivery operations for large-scale instances, The capacitated vehicle routing problem with stochastic demands and time windows, A novel model for arc territory design: promoting Eulerian districts, Dividing a Territory Among Several Vehicles, A survey on metaheuristics for stochastic combinatorial optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving a large scale districting problem: A case report
- Stochastic vehicle routing
- Future paths for integer programming and links to artificial intelligence
- A tabu search heuristic and adaptive memory procedure for political districting
- Path relinking for the vehicle routing problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
- Fast Approximation Methods for Sales Force Deployment
- Parallel iterative search methods for vehicle routing problems
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A unified tabu search heuristic for vehicle routing problems with time windows
- Solving a home-care districting problem in an urban setting
- A simulated annealing approach to police district design
