Large-scale constrained clustering for rationalizing pickup and delivery operations

Transportation Research Part B: Methodological

Volumn 43, Issue 5, 2009, Pages 542-561

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

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b GEORGE WASHINGTON UNIVERSITY   (United States)

Author keywords

Case study; Clustering; Pickup and delivery operations; Randomized heuristic; Set covering

Indexed keywords

INTEGER PROGRAMMING; ITERATIVE METHODS; MATHEMATICAL PROGRAMMING; PICKUPS;

CLUSTERING; COMPROMISING SOLUTIONS; CONSTRAINED CLUSTERING; PICKUP AND DELIVERY; RANDOMIZED HEURISTIC; SET COVERING PROBLEM; SET COVERINGS; SOLUTION METHODOLOGY;

OPTIMIZATION;

CLUSTER ANALYSIS; HEURISTICS; LINEAR PROGRAMING; NUMERICAL MODEL; OPTIMIZATION; PLANNING METHOD; PROBABILITY; RATIONALIZATION; SHIPPING;

EID: 63149126742     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2008.10.003     Document Type: Article

References (30)

1. Al-Sultan K.S., and Maroof Khan M. Computational experience on four algorithms for the hard clustering problem. Pattern Recognition Letters 17 3 (1996) 295-308
2. Bard J.F., and Purnomo H.W. Preference scheduling for nurses using column generation. European Journal of Operational Research 164 2 (2005) 510-534
3. Bräysy O., and Gendreau M. Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transportation Science 39 1 (2005) 104-118
4. Brucker J. On the complexity of clustering problem. Lecture Notes in Economics and Mathematical Systems vol. 157 (1978), Springer, Berlin/Heidelberg pp. 45-54
5. Chiou Y.-C., and Lan L.W. Genetic clustering algorithms. European Journal of Operational Research 135 2 (2001) 413-427
6. Daganzo C.F. The length of tours in zones of different shapes. Transportation Research Part B 18 2 (1984) 135-145
7. Erdoǧan G., and Tansel B. A branch-and-cut algorithm for quadratic assignment problems based on linearizations. Computers & Operations Research 34 4 (2007) 1085-1106
8. Ferreira C.E., Martin A., de Souza C.C., Weismantel R., and Wolsey L.A. The node capacitated graph partitioning problem: a computational study. Mathematical Programming 81 2 (1998) 229-256
9. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, New York
10. Gersho A. Asymptotically optimal block quantization. IEEE Transactions on Information Theory, IT- 25 4 (1979) 373-380
11. Hansen P., and Jaumard B. Cluster analysis and mathematical programming. Mathematical Programming 79 2 (1997) 191-215
12. Hansen P., and Mladenovic N. J-Means: a new local search heuristic for minimum sum-of-squares clustering. Pattern Recognition 34 2 (2001) 405-413
13. Johnson E.L., Mehrotra A., and Nemhauser G.L. Min-cut clustering. Mathematical Programming 62 1 (1993) 133-151
14. Kaufman L., and Roussweuw P. Finding Groups in Data: An Introductory to Cluster Analysis (1990), Wiley, New York
15. Kohl N., and Karisch S.E. Airline crew rostering: problem types, modeling, and optimization. Annals of Operations Research 127 1 (2004) 223-257
16. Kontoravdis G., and Bard J.F. A GRASP for the vehicle routing problem with time windows. ORSA Journal on Computing 7 1 (1995) 10-23
17. Koskosidis Y., and Powell W.B. Clustering algorithms for consolidation of customer orders into vehicle shipments. Transportation Research Part B 26 5 (1992) 365-379
18. Laporte G., Chapleau S., Landry P.-E., and Mercure H. An algorithm for the design of mailbox collection routes in urban areas. Transportation Research Part B 23 4 (1989) 271-280
19. Loiola E.M., de Abreu N.M.M., Boaventura-Netto P.O., Hahn P., and Querido T. A survey for the quadratic assignment problem. European Journal of Operational Research 176 2 (2007) 657-690
20. Lorena L.A.N., and Elf S. A column generation approach to capacitated p-median problems. Computers and Operations Research 31 6 (2004) 863-876
21. Martello S., and Toth P. Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematics 28 1 (1990) 59-70
22. Mehrotra A., and Trick M. Cliques and clustering: a combinatorial approach. Operations Research Letters 22 1 (1998) 1-12
23. Mourgaya M., and Vanderbeck F. Column generation based heuristic for tactical planning in multi-period vehicle routing. European Journal of Operational Research 183 3 (2007) 1028-1041
24. Negreiros M., and Palhano A. The capacitated centred clustering problem. Computers & Operations Research 33 6 (2006) 1639-1663
25. Osman I.H., and Ahmadi S. 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
26. Ouyang Y. Design of vehicle routing zones for large-scale distribution systems. Transportation Research Part B 41 10 (2007) 1079-1093
27. Sherali H.D., and Adams W.P. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics 3 3 (1990) 411-430
28. Sherali H.D., and Desai J. A global optimization RLT-based approach for solving the hard clustering problem. Journal of Global Optimization 32 2 (2003) 281-306
29. Sherali H.D., and Smith J.C. Improving discrete model representations via symmetry considerations. Management Science 47 10 (2001) 1396-1407
30. Wolsey L.A. Integer Programming (1998), Wiley, New York