A reactive GRASP for a commercial territory design problem with multiple balancing requirements
From MaRDI portal
Publication:955609
DOI10.1016/j.cor.2007.10.024zbMath1157.90515OpenAlexW2118217692MaRDI QIDQ955609
Roger Z. Ríos-Mercado, Elena Fernández
Publication date: 20 November 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2007.10.024
combinatorial optimizationmetaheuristicsterritory designreactive GRASPmultiple balancing requirements
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
An overview of graph covering and partitioning ⋮ The mixed capacitated arc routing problem with non-overlapping routes ⋮ Local search heuristics for sectoring routing in a household waste collection context ⋮ The synchronized arc and node routing problem: application to road marking ⋮ A redistricting problem applied to meter reading in power distribution networks ⋮ Dynamic design of sales territories ⋮ Large-scale pickup and delivery work area design ⋮ Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm ⋮ Districting for Arc Routing ⋮ A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution ⋮ An optimization-based approach for the healthcare districting under uncertainty ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ Primal and dual bounds for the vertex \(p\)-median problem with balance constraints ⋮ A sample approximation solution procedure for chance-constrained districting problems ⋮ Tabu search with strategic oscillation for improving collection assignment plans of waste electric and electronic equipment ⋮ A guided reactive GRASP for the capacitated multi-source Weber problem ⋮ Approximation schemes for districting problems with probabilistic constraints ⋮ New models for commercial territory design ⋮ Connected graph partitioning with aggregated and non‐aggregated gap objective functions ⋮ Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands ⋮ Exact approaches for solving a covering problem with capacitated subtrees ⋮ Workload equity in vehicle routing: the impact of alternative workload resources ⋮ Multiobjective scatter search for a commercial territory design problem ⋮ A dual bounding scheme for a territory design problem ⋮ Validating vehicle routing zone construction using Monte Carlo simulation ⋮ A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization ⋮ Simultaneous node and link districting in transportation networks: model, algorithms and railway application ⋮ A novel model for arc territory design: promoting Eulerian districts ⋮ Risk-balanced territory design optimization for a micro finance institution
Cites Work
- Solving a large scale districting problem: A case report
- Optimal political districting
- Districting for salt spreading operations
- Greedy randomized adaptive search procedures
- A tabu search heuristic and adaptive memory procedure for political districting
- Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
- An Optimization Based Heuristic for Political Districting
- Sales Territory Alignment: A Review and Model
- Fast Approximation Methods for Sales Force Deployment
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Turfing
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- School redistricting: embedding GIS tools with integer programming
- Solving a home-care districting problem in an urban setting
- Optimal Political Districting by Implicit Enumeration Techniques
- Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
- A simulated annealing approach to police district design
