An efficient probability-based VNS algorithm for delivery territory design
From MaRDI portal
Cites work
- A comparison of \(p\)-dispersion heuristics
- A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization
- A reactive GRASP for a commercial territory design problem with multiple balancing requirements
- An effective VNS for the capacitated \(p\)-median problem
- Clustering to minimize the maximum intercluster distance
- scientific article; zbMATH DE number 1075641 (Why is no real title available?)
- Large-scale pickup and delivery work area design
- Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
- Multiobjective scatter search for a commercial territory design problem
- New models for commercial territory design
- Political districting: from classical models to recent approaches
- School redistricting: embedding GIS tools with integer programming
- Solving the capacitated clustering problem with variable neighborhood search
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- Variable neighborhood search
- Variable neighborhood search: basics and variants
- Variable neighborhood search: the power of change and simplicity
This page was built for publication: An efficient probability-based VNS algorithm for delivery territory design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979385)
