Dynamic design of sales territories

DOI10.1016/j.cor.2014.11.008zbMath1348.90106OpenAlexW2073228814MaRDI QIDQ337456

Hongtao Lei, Gilbert Laporte, Tao Zhang, Ya-Jie Liu

Publication date: 10 November 2016

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

Full work available at URL: https://doi.org/10.1016/j.cor.2014.11.008

zbMATH Keywords

traveling salesmanadaptive large neighbourhood searchdistricting

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Towards a stochastic programming modeling framework for districting, Territory design for the multi-period vehicle routing problem with time windows, Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm, 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, A survey of adaptive large neighborhood search algorithms and applications, Continuous approximation models in freight distribution management, A multi‐period multi‐criteria districting problem applied to primary care scheme with gradual assignment, Territorial design for customers with demand frequency, Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics, Wasserstein Distance and the Distributionally Robust TSP, 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, A hybrid heuristic for the maximum dispersion problem

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• The dial-A-ride problem with transfers
• The multi-district team orienteering problem
• An adaptive large neighborhood search for a vehicle routing problem with multiple routes
• The capacitated vehicle routing problem with stochastic demands and time windows
• A general heuristic for vehicle routing problems
• Designing delivery districts for the vehicle routing problem with stochastic demands
• A general vehicle routing problem
• Solving continuous location-districting problems with Voronoi diagrams
• A reactive GRASP for a commercial territory design problem with multiple balancing requirements
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• An improved LNS algorithm for real-time vehicle routing problem with time windows
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
• A tabu search heuristic and adaptive memory procedure for political districting
• The bi-objective pollution-routing problem
• Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
• An Optimization Based Heuristic for Political Districting
• Dividing a Territory Among Several Vehicles
• Robust Partitioning for Stochastic Multivehicle Routing
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Fast Approximation Methods for Sales Force Deployment
• Solving a home-care districting problem in an urban setting
• Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning
• A simulated annealing approach to police district design
• The Vehicle Routing Problem with Stochastic Demands and Split Deliveries