Continuous approximation models in freight distribution management
From MaRDI portal
Recommendations
- A continuous approximation model for the fleet composition problem on the rectangular grid
- Configuration of physical distribution networks
- Facility location models for distribution system design
- A continuous approach to the design of physical distribution systems
- scientific article; zbMATH DE number 1128820
Cites work
- scientific article; zbMATH DE number 3932819 (Why is no real title available?)
- scientific article; zbMATH DE number 2018401 (Why is no real title available?)
- scientific article; zbMATH DE number 3193293 (Why is no real title available?)
- A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One
- A Lower Bound for the Expected Travel Among $m$ Random Points
- A Routing Model for Pickups and Deliveries: No Capacity Restrictions on the Secondary Items
- A continuous approach to the design of physical distribution systems
- A distribution-free TSP tour length estimation model for random graphs
- A multiplicatively-weighted Voronoi diagram approach to logistics districting
- A tabu search heuristic and adaptive memory procedure for political districting
- A tiling and routing heuristic for the screening of cytological samples
- An Asymptotic, Probabilistic Analysis of a Routing Problem
- An optimization based heuristic for political districting
- Beardwood-Halton-Hammersley theorem for stationary ergodic sequences: a counterexample
- Complete Convergence of Short Paths and Karp's Algorithm for the TSP
- Confidence intervals for the correlation from a bivariate normal
- Designing multi-vehicle delivery tours in a grid-cell format
- Distribution Strategies that Minimize Transportation and Inventory Costs
- Dividing a territory among several vehicles
- Dynamic Location-routeing Problems
- Dynamic design of sales territories
- Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
- Fast Approximation Methods for Sales Force Deployment
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- Logistics systems analysis
- Modeling Distribution Problems with Time Windows. Part II: Two Customer Types
- Modeling Distribution Problems with Time Windows: Part I
- Models to estimate average route lengths in different geographical environments
- On the Shortest Path Through a Number of Points
- One-to-Many Distribution with Transshipments: An Analytic Model
- Operational estimators for the length of a traveling salesman tour
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- Reliable facility location design under the risk of disruptions
- Robust partitioning for stochastic multivehicle routing
- Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm
- Solving continuous location-districting problems with Voronoi diagrams
- Some variants of the method of fundamental solutions: regularization using radial and nearly radial basis functions
- Subadditive Euclidean functionals and nonlinear growth in geometric probability
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
- The Distribution of a Product from Several Sources to Numerous Localities
- The shortest path and the shortest road through n points
- Use of continuous approximations within discrete algorithms for routing vehicles: Experimental results and interpretation
- Worst-case demand distributions in vehicle routing
Cited in
(17)- Smart and sustainable city logistics: design, consolidation, and regulation
- A review of vehicle routing with simultaneous pickup and delivery
- The dynamic-demand joint replenishment problem with approximated transportation costs
- Total distance approximations for routing solutions
- Vehicle routing with stochastic demand, service and waiting times -- the case of food bank collection problems
- Comments on: continuous approximation models in freight distribution management
- Comments on: continuous approximation models in freight distribution management
- A continuous approximation model for the fleet composition problem on the rectangular grid
- Shared mobility systems: an updated survey
- Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics
- Vehicle routing with backhauls: review and research perspectives
- Continuum approximation techniques for the design of integrated package distribution systems
- A concise guide to existing and emerging vehicle routing problem variants
- Territory design for the multi-period vehicle routing problem with time windows
- Designing multi-tier, multi-service-level, and multi-modal last-mile distribution networks for omni-channel operations
- Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations
- Continuous approximation formulas for location problems
This page was built for publication: Continuous approximation models in freight distribution management
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1688432)
