Continuous approximation models in freight distribution management
From MaRDI portal
Publication:1688432
DOI10.1007/s11750-017-0456-1zbMath1382.90010OpenAlexW2752162709MaRDI QIDQ1688432
Gilbert Laporte, Anna Franceschetti, Ola Jabali
Publication date: 5 January 2018
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-017-0456-1
traveling salesman problemasymptotic resultsvehicle routing problemfreight distributioncontinuous approximationpartitioning strategies
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Total distance approximations for routing solutions, Territory design for the multi-period vehicle routing problem with time windows, Vehicle routing with backhauls: review and research perspectives, A review of vehicle routing with simultaneous pickup and delivery, Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations, A concise guide to existing and emerging vehicle routing problem variants, Smart and sustainable city logistics: design, consolidation, and regulation, Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics, Shared mobility systems: an updated survey, The dynamic-demand joint replenishment problem with approximated transportation costs, Designing multi-tier, multi-service-level, and multi-modal last-mile distribution networks for omni-channel operations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A distribution-free TSP tour length estimation model for random graphs
- Dynamic design of sales territories
- Beardwood-Halton-Hammersley theorem for stationary ergodic sequences: a counterexample
- Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm
- Some variants of the method of fundamental solutions: regularization using radial and nearly radial basis functions
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- Solving continuous location-districting problems with Voronoi diagrams
- Subadditive Euclidean functionals and nonlinear growth in geometric probability
- Logistics systems analysis
- Operational estimators for the length of a traveling salesman tour
- A continuous approach to the design of physical distribution systems
- Worst-case demand distributions in vehicle routing
- Designing multi-vehicle delivery tours in a grid-cell format
- A tabu search heuristic and adaptive memory procedure for political districting
- Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
- A multiplicatively-weighted Voronoi diagram approach to logistics districting
- An Optimization Based Heuristic for Political Districting
- Dividing a Territory Among Several Vehicles
- Robust Partitioning for Stochastic Multivehicle Routing
- Reliable Facility Location Design Under the Risk of Disruptions
- Fast Approximation Methods for Sales Force Deployment
- A tiling and routing heuristic for the screening of cytological samples
- The shortest path and the shortest road through n points
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
- Distribution Strategies that Minimize Transportation and Inventory Costs
- Modeling Distribution Problems with Time Windows: Part I
- Modeling Distribution Problems with Time Windows. Part II: Two Customer Types
- Dynamic Location-routeing Problems
- A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One
- Complete Convergence of Short Paths and Karp's Algorithm for the TSP
- An Asymptotic, Probabilistic Analysis of a Routing Problem
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- A Routing Model for Pickups and Deliveries: No Capacity Restrictions on the Secondary Items
- One-to-Many Distribution with Transshipments: An Analytic Model
- Use of continuous approximations within discrete algorithms for routing vehicles: Experimental results and interpretation
- Models to estimate average route lengths in different geographical environments
- Confidence intervals for the correlation from a bivariate normal
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- The Distribution of a Product from Several Sources to Numerous Localities
- A Lower Bound for the Expected Travel Among $m$ Random Points
- On the Shortest Path Through a Number of Points
