Large-scale pickup and delivery work area design

Computers and Operations Research

Volumn 39, Issue 12, 2012, Pages 3102-3118

  Jarrah, Ahmad I ^a   Bard, Jonathan F ^b  

^a GEORGE WASHINGTON UNIVERSITY   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Aggregation; Clustering; Column generation; Heuristics; Large scale set covering; Pickup and delivery operations

Indexed keywords

CLUSTERING; COLUMN GENERATION; HEURISTICS; PICKUP AND DELIVERY; SET COVERINGS;

AGGLOMERATION; TABU SEARCH;

ASPECT RATIO;

EID: 84862981416     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2012.03.014     Document Type: Article

References (33)

1. K.S. Al-Sultan, and M.M. Khan Computational experience on four algorithms for the hard clustering problem Pattern Recognition Letters 17 3 1996 295 308 (Pubitemid 126384523)
2. J.F. Bard, and A.I. Jarrah Large-scale constrained clustering for rationalizing pickup and delivery operations Transportation Research Part B 43 5 2009 542 561
3. J.F. Bard, A.I. Jarrah, and J. Zan Validating vehicle routing zone construction using Monte Carlo simulation European Journal of Operational Research 206 1 2010 73 85
4. J. Brucker On the complexity of clustering problem. Lecture Notes in Economics and Mathematical Systems 1978 Springer Berlin/Heidelberg 157, 45-54
5. Y.-C. Chiou, and L.W. Lan Genetic clustering algorithms European Journal of Operational Research 135 2 2001 413 427 (Pubitemid 32842077)
6. Desaulniers G, Desrosiers J, Solomon MM, editors. Column Generation. New York: Springer; 2005.
7. C.F. Daganzo Logistics System Analysis 4th edn. 2005 Springer Berlin
8. C.F. Daganzo, and A. Erera On planning and design of logistics systems for uncertain environments M.G. Speranza, P. Stahly, New Trends in Distribution Logistics, Lecture Notes in Economics and Mathematical Systems 480 1999 Springer-Verlag Berlin
9. A. Drexl, and K. Haase Fast approximation methods for sales force deployment Management Science 45 10 1999 1307 1323 (Pubitemid 30529673)
10. C.E. Ferreira, A. Martin, C.C. de Souza, R. Weismantel, and L.A. Wolsey The node capacitated graph partitioning problem: a computational study Mathematical Programming 81 2 1998 229 256 (Pubitemid 128393279)
11. M.L. Fisher, and R. Jaikumar A generalized assignment heuristic for vehicle routing Networks 11 2 1981 1097-0037
12. V. Gaur, and M.L. Fisher A periodic inventory routing problem at a supermarket chain Operations Research 52 6 2004 813 822 (Pubitemid 40122344)
13. I. Ioachim, J. Desrosiers, Y. Dumas, M.M. Solomon, and D. Villeneuve A request clustering algorithm for door-to-door handicapped transportation Transportation Science 29 1 1995 63 78
14. A.I. Jarrah, and J.F. Bard Pickup and delivery network segmentation using contiguous geographic clustering Journal of the Operational Research Society 62 10 2011 1827 1843
15. E.L. Johnson, A. Mehrotra, and G.L. Nemhauser Min-cut clustering Mathematical Programming 62 1993 133 151
16. J. Kim, J. Yang, and S. Ólafsson An optimization approach to partitional data clustering Journal of the Operational Research Society 60 8 2009 1069 1084
17. A. Langevin, and F. Soumis Design of multiple-vehicle delivery tours satisfying time constraints Transportation Research Part B 23 2 1989 123 138
18. G. Laporte, S. Chapleau, P.-E. Landry, and H. Mercure An algorithm for the design of mailbox collection routes in urban areas Transportation Research Part B 23 4 1989 271 280
19. L.A.N. Lorena, and E.L.F. Senne A column generation approach for the capacitated p-median problems Computers & Operations Research 31 6 2004 863 876 (Pubitemid 38204401)
20. M.E. Lübbecke, and J. Desrosiers Selected topics in column generation Operations Research 53 6 2005 1007 1023 (Pubitemid 43061815)
21. A. Mehrotra, E. Johnson, and G.L. Nemhauser An optimization based heuristic for political districting Management Science 44 18 1998 1100 1114 (Pubitemid 128569655)
22. A. Mehrotra, and M. Trick Cliques and clustering: a combinatorial approach Operations Research Letters 22 1 1998 1 12 (Pubitemid 128406985)
23. M. Mourgaya, and F. Vanderbeck Column generation based heuristic for tactical planning in multi-period vehicle routing European Journal of Operational Research 183 3 2007 1028 1041 (Pubitemid 47039186)
24. J.M. Mulvey, and M.P. Beck Solving capacitated clustering problems European Journal of Operational Research 18 3 1984 339 348
25. M. Negreiros, and A. Palhano The capacitated centred clustering problem Computers & Operations Research 33 6 2006 1639 1663 (Pubitemid 41525703)
26. G.F. Newell, and C.F. Daganzo Design of multiple-vehicle delivery tours - I: a ring-radial network Transportation Research Part B 20 5 1986 345 363
27. B. Nygreen European assembly constituencies for Wales: comparing of methods for solving a political districting problem Mathematical Programming 42 1988 159 169
28. I.H. Osman, and S. Ahmadi Guided construction search metaheuristics for the capacitated p-median problem with single source constraint Journal of the Operational Research Society 58 1 2007 100 114 (Pubitemid 44925069)
29. Y. Ouyang Design of vehicle routing zones for large-scale distribution systems Transportation Research Part B 41 10 2007 1079 1093 (Pubitemid 47520483)
30. R.Z. Ríos-Mercado, and E. Fernández A reactive GRASP for a commercial territory design problem with multiple balancing requirements Computers & Operations Research 36 3 2009 755 776
31. H.D. Sherali, and J. Desai A global optimization RLT-based approach for solving the hard clustering problem Journal of Global Optimization 32 2 2003 281 306
32. L.A. Wolsey Integer Programming 1998 Wiley New York
33. H. Young Measuring the compactness of legislative districts Legislative Studies Quarterly 13 2 1988 105 115