Large-scale pickup and delivery work area design
From MaRDI portal
Publication:339655
DOI10.1016/j.cor.2012.03.014zbMath1349.90092OpenAlexW2009872775MaRDI QIDQ339655
Jonathan F. Bard, Ahmad I. Jarrah
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.03.014
aggregationheuristicscolumn generationclusteringlarge-scale set coveringpickup and delivery operations
Transportation, logistics and supply chain management (90B06) Case-oriented studies in operations research (90B90)
Related Items (9)
Visual attractiveness in routing problems: a review ⋮ The mixed capacitated arc routing problem with non-overlapping routes ⋮ Territory design for the multi-period vehicle routing problem with time windows ⋮ Local search heuristics for sectoring routing in a household waste collection context ⋮ 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 ⋮ Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem ⋮ Simultaneous node and link districting in transportation networks: model, algorithms and railway application
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving capacitated clustering problems
- A reactive GRASP for a commercial territory design problem with multiple balancing requirements
- Validating vehicle routing zone construction using Monte Carlo simulation
- Cliques and clustering: A combinatorial approach
- The node capacitated graph partitioning problem: A computational study
- Min-cut clustering
- A column generation approach to capacitated \(p\)-median problems
- A global optimization RLT-based approach for solving the hard clustering problem
- The capacitated centred clustering problem
- Column generation based heuristic for tactical planning in multi-period vehicle routing
- An Optimization Based Heuristic for Political Districting
- Fast Approximation Methods for Sales Force Deployment
- An optimization approach to partitional data clustering
- A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
- Guided construction search metaheuristics for the capacitated p-median problem with single source constraint
- Column Generation
- A Periodic Inventory Routing Problem at a Supermarket Chain
- Selected Topics in Column Generation
- Genetic clustering algorithms.
This page was built for publication: Large-scale pickup and delivery work area design