Demand dispersion and logistics costs in one-to-many distribution systems

European Journal of Operational Research

Volumn 223, Issue 2, 2012, Pages 499-507

  Turkensteen, Marcel ^a   Klose, Andreas ^b  

^a AARHUS SCHOOL OF BUSINESS   (Denmark)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

Geographical dispersion; Logistics costs; One to many distribution systems; Segmentation

Indexed keywords

AVERAGE DISTANCE; CANDIDATE TARGET; CENTRAL FACILITIES; DISTRIBUTION SYSTEMS; EXPECTED COSTS; GEOGRAPHICAL DISPERSIONS; LOGISTICS COSTS; MARKET SEGMENTATION; MUTUAL DISTANCES; TARGET GROUP;

DISPERSIONS; IMAGE SEGMENTATION;

COSTS;

EID: 84864579688     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2012.06.008     Document Type: Article

References (38)

1. F. Baita, W. Ukovich, R. Pesenti, and D. Favaretto Dynamic routing-and-inventory problems: a review Transportation Research A 8 1998 585 598 (Pubitemid 29040938)
2. R. Ballou Unresolved issues in supply chain network design Information Systems Frontiers 3 4 2001 417 426 (Pubitemid 33676635)
3. T. Bektas, and G. Laporte The pollution-routing problem Transportation Research Part B 45 8 2011 1232 1250
4. p-norm in estimating actual road distances European Journal of Operational Research 34 1988 39 43 (Pubitemid 18567080)
5. p-norm European Journal of Operational Research 67 1993 287 294
6. p-distances Operations Research 41 6 1993 1153 1163
7. p norm: Some empirical results Journal of Transport Geography 15 2007 62 72 (Pubitemid 44896959)
8. M. Brusco, and D. Steinley A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning Psykometrika 72 4 2007 583 600
9. J. Campbell One-to-many distribution with transshipment: an analytic model Transportation Science 27 1993 330 340
10. G. Clarke, and J. Wright Scheduling of vehicles from a central depot to a number of delivery points Operations Research 12 1964 568 581
11. J. Cordeau, M. Gendreau, G. Laporte, J. Potvin, and F. Semet A guide to vehicle routing problem heuristics The Journal of the Operational Research Society 53 5 2002 512 522 (Pubitemid 34550664)
12. C. Daganzo The distance traveled to visit N points with a maximum of c stops per vehicle: an analytic model and an application Transportation Science 18 1984 331 350 (Pubitemid 14668877)
13. C. Daganzo A comparison of in-vehicle and out-of-vehicle freight consolidation strategies Transportation Research B 22 1988 173 180 (Pubitemid 18635007)
14. C. Daganzo Logistics Systems Analysis fourth ed. 2004 Springer Verlag
15. C. Daganzo, and G. Newell Physical distribution from a warehouse: vehicle coverage and inventory levels Transportation Research Part B 19 1985 397 405
16. W. DeSarbo, and D. Grisaffe Combinatorial optimization approaches to constrained market segmentation: an application to industrial market segmentation Marketing Letters 9 2 1998 115 134 (Pubitemid 128548840)
17. Z. Drezner A note on the Weber location problem Annals of Operations Research 40 1992 153 161
18. S. Eilon, C. Watson-Gandy, and N. Christofides Distribution Management: Mathematical Modelling and Practical Analysis 1971 Hafner New York
19. A. Federgruen, G. Prastacos, and P. Zipkin An allocation and distribution model for perishable products Operations Research 34 1 1986 75 82 (Pubitemid 16571958)
20. M. Figliozza Planning approximations to the average length of vehicle routing problems with time window constraints Transportation Research Part B 43 2009 438 447
21. B. Fleischmann Designing distribution systems with transport economies of scale European Journal of Operational Research 70 1993 31 42 (Pubitemid 23707636)
22. B. Fleischmann, S. Gnutzmann, and E. Sandvoss Dynamic vehicle routing based on online traffic information Transportation Science 38 4 2004 420 433
23. R. Hall, Y. Du, and J. Lin Use of continuous approximations within discrete algorithms for routing vehicles: Experimental results and interpretation Networks 24 1994 43 56
24. C. Hsu, and I. Tsai Logistics cost, consumer demand and retail establishment density Papers in Regional Science 78 3 1999 243 263 (Pubitemid 129698614)
25. P. Kotler, and G. Armstrong Principles of Marketing 11th ed. 2006 Prentice Hall
26. A. Langevin, P. Mbaraga, and J. Campbell Continuous approximation models in freight transport: An overview Transportation Research Part B 30 3 1996 163 188
27. B. Mirkin, and I. Muchnik Combinatorial optimization in clustering D. Zu, P. Pardalos, Handbook on Combinatorial Optimzation vol. 2 1999 Kluwer Academic Publishers 261 329 (Chapter 5)
28. G. Nagy, and S. Salhi Location-routing: issues, models and methods European Journal of Operational Research 177 2007 649 672 (Pubitemid 44647670)
29. D. Peeters, and I. Thomas Distance predicting functions and applied location-allocation models Journal of Geographical Systems 2 2000 167 184 (Pubitemid 30600200)
30. F. Robusté, C. Daganzo, and R. Souleyrette Implementing vehicle routing models Transportation Research Part B 24B 4 1990 263 286
31. S. Salhi, and G. Nagy Local improvement in planar facility location using vehicle routing Annals of Operations Research 167 2009 287 296
32. J. Steenkamp, and F. Ter Hofstede International market segmentation: issues and perspectives International Journal of Research in Marketing 19 3 2002 185 213
33. F. Ter Hofstede, M. Wedel, and J. Steenkamp Identifying spatial segments in international markets Marketing Science 21 2 2002 160 177
34. Toth, P., Vigo, D., 2002. The vehicle routing problem. In: SIAM Monographs on Discrete Mathematics, SIAM, Philadelphia.
35. Turkensteen, M., Klose, A. 2009. The cost of supplying segmented consumers from a central facility. In: 14th HKSTS International Conference - Transportation and Geography.
36. M. Turkensteen, G. Sierksma, and J. Wieringa Balancing the fit and logistics costs of market segmentations European Journal of Operational Research 213 1 2011 340 348
37. M. Wedel, and W. Kamakura Market Segmentation: Conceptual and Methodological Foundations International Series in Quantitative Marketing 1998 Kluwer Academic Publishers
38. E. Weiszfeld Sur le point pour lequel la somme des distances de n points donnés est minimum Tôhoku Mathematical Journal 43 1937 355 386