Clustering algorithms for consolidation of customer orders into vehicle shipments
- 31 October 1992
- journal article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 26 (5) , 365-379
- https://doi.org/10.1016/0191-2615(92)90032-r
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window ConstraintsTransportation Science, 1992
- A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windowsTransportation Research Part B: Methodological, 1986
- Solving capacitated clustering problemsEuropean Journal of Operational Research, 1984
- Multivariate Stratified Sampling by OptimizationManagement Science, 1983
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- Cluster Analysis: An Application of Lagrangian RelaxationManagement Science, 1979
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate AlgorithmsManagement Science, 1977
- Validation of subgradient optimizationMathematical Programming, 1974
- Experiences with a Sales Districting Model: Criteria and ImplementationManagement Science, 1971
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971