Large-scale pickup and delivery work area design
DOI10.1016/J.COR.2012.03.014zbMATH Open1349.90092OpenAlexW2009872775MaRDI QIDQ339655FDOQ339655
Authors: Ahmad I. Jarrah, Jonathan F. Bard
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
Recommendations
- Design of the federal express large package sort facility
- Manufacturing facilities layout design considering pick up/ drop-off positions
- Mixed-width aisle configurations for order picking in distribution centers
- Models for the design and analysis of a large package sort facility
- Ergonomic workplace design in the fast pick area
- Optimal facility layout and material handling network design
- An integrated approach for facility layout, P/D location and material handling system design
- Dispatching vehicles in a mega container terminal
- Large-scale, less-than-truckload service network design
clusteringaggregationheuristicscolumn generationlarge-scale set coveringpickup and delivery operations
Case-oriented studies in operations research (90B90) Transportation, logistics and supply chain management (90B06)
Cites Work
- An optimization based heuristic for political districting
- Selected Topics in Column Generation
- A column generation approach to capacitated \(p\)-median problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Column Generation
- Column generation based heuristic for tactical planning in multi-period vehicle routing
- Fast Approximation Methods for Sales Force Deployment
- Solving capacitated clustering problems
- A reactive GRASP for a commercial territory design problem with multiple balancing requirements
- The node capacitated graph partitioning problem: A computational study
- Min-cut clustering
- A Periodic Inventory Routing Problem at a Supermarket Chain
- Cliques and clustering: A combinatorial approach
- A global optimization RLT-based approach for solving the hard clustering problem
- The capacitated centred clustering problem
- An optimization approach to partitional data clustering
- Title not available (Why is that?)
- A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
- Guided construction search metaheuristics for the capacitated p-median problem with single source constraint
- Genetic clustering algorithms.
- Validating vehicle routing zone construction using Monte Carlo simulation
Cited In (13)
- A GRASP-Tabu heuristic approach to territory design for pickup and delivery operations for large-scale instances
- Visual attractiveness in routing problems: a review
- Simultaneous node and link districting in transportation networks: model, algorithms and railway application
- 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
- A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
- An optimization-based approach for the healthcare districting under uncertainty
- A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution
- Validating vehicle routing zone construction using Monte Carlo simulation
- A new approach to freight consolidation for a real-world pickup-and-delivery problem
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
- Districting for arc routing
This page was built for publication: Large-scale pickup and delivery work area design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339655)