Pickup and delivery network segmentation using contiguous geographic clustering

Journal of the Operational Research Society

Volumn 62, Issue 10, 2011, Pages 1827-1843

  Jarrah, A I ^a   Bard, J F ^b  

^a GEORGE WASHINGTON UNIVERSITY   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

aggregation; clustering; heuristic column generation; pickup and delivery operations

Indexed keywords

AGGLOMERATION; ASPECT RATIO; CUSTOMER SATISFACTION; FLEET OPERATIONS; ITERATIVE METHODS; LINEAR PROGRAMMING; TRAVEL TIME; VEHICLES;

CAPACITY CONSTRAINTS; CLUSTERING; COLUMN GENERATION; CONSTRUCTIVE APPROACH; DANTZIG-WOLFE DECOMPOSITION; GEOGRAPHIC CLUSTERING; NETWORK SEGMENTATION; PICKUP AND DELIVERY;

PICKUPS;

EID: 80051904268     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2010.123     Document Type: Article

References (31)

1. Ahmadi S and Osman IH (2005). Greedy random adaptive memory programming search for the capacitated clustering problem. Eur J Opl Res 162: 30-44.
2. Al-Sultan KS and Khan MM (1996). Computational experience on four algorithms for the hard clustering problem. Pattern Recognit Lett 17: 295-308. (Pubitemid 126384523)
3. Bard JF and Jarrah AI (2009). Large-scale constrained clustering for rationalizing pickup and delivery operations. Transport Res Part B 43: 542-561.
4. Bard JF, Jarrah AI and Zan J (2010). Validating vehicle routing zone construction using Monte Carlo simulation. Eur J Opl Res 206: 73-85.
5. Bard JF and Purnomo HW (2005). Preference scheduling for nurses using column generation. Eur J Opl Res 164: 510-534.
6. Bräysy O and Gendreau M (2005). Vehicle routing problem with time windows part I: Route construction and local search algorithms. Transport Sci 39: 104-118. (Pubitemid 40466664)
7. Brucker J (1978). On the complexity of clustering problem. Lect Notes Econ Math Syst 157: 45-54, Springer: Berlin/Heidelberg.
8. Chiou Y-C and Lan LW (2001). Genetic clustering algorithms. Eur J Opl Res 135: 413-427. (Pubitemid 32842077)
9. Daganzo CF (2005). Logistics System Analysis. 4th edn, Springer: Berlin.
10. Daganzo CF and Erera A (1999). On planning and design of logistics systems for uncertain environments. In: Speranza MG and Stahly P (eds). New Trends in Distribution Logistics. of Lecture Notes in Economics and Mathematical Systems, Vol. 480. Springer-Verlag: Berlin.
11. Du Q, Faber V and Gunzburger M (1999). Centroidal Voronoi tessellations: Applications and algorithms. SIAM Rev 41: 637-676. (Pubitemid 30536738)
12. Ferreira CE, Martin A, de Souza CC, Weismantel R and Wolsey LA (1998). The node capacitated graph partitioning problem: A computational study. Math Program 81: 229-256. (Pubitemid 128393279)
13. Gaur V and Fisher ML (2004). A periodic inventory routing problem at a supermarket chain. Opns Res 52: 813-822. (Pubitemid 40122344)
14. Hansen P and Jaumard B (1997). Cluster analysis and mathematical programming. Math Program 79: 191-215. (Pubitemid 127397727)
15. Hansen P and Mladenovic N (2001). J-Means: A new local search heuristic for minimum sum of squares clustering. Pattern Recognit 34: 405-413. (Pubitemid 32871885)
16. Johnson EL, Mehrotra A and Nemhauser GL (1993). Min-cut clustering. Math Program 62: 133-151.
17. Kaufman L and Roussweuw P (1990). Finding Groups in Data: An Introductory to Cluster Analysis. John Wiley: New York.
18. Kohl N and Karisch SE (2004). Airline crew rostering: Problem types, modeling and optimization. Ann Opns Res 127: 223-257. (Pubitemid 39056532)
19. Koskosidis Y and Powell WB (1992). Clustering algorithms for consolidation of customer orders into vehicle shipments. Transport Res Part B 26: 365-379.
20. Langevin A and Soumis F (1989). Design of multiple-vehicle delivery tours satisfying time constraints. Transport Res Part B 23: 123-138.
21. Laporte G, Chapleau S, Landry P-E and Mercure H (1989). An algorithm for the design of mailbox collection routes in urban areas. Transport Res Part B 23: 271-280.
22. Lorena LAN and Senne ELF (2004). A column generation approach for the capacitated p-median problems. Comput Opns Res 31: 863-876. (Pubitemid 38204401)
23. Mehrotra A and Trick M (1998). Cliques and clustering: A combinatorial approach. Opns Res Lett 22: 1-12. (Pubitemid 128406985)
24. Mourgaya M and Vanderbeck F (2007). Column generation based heuristic for tactical planning in multi-period vehicle routing. Eur J Opl Res 183: 1028-1041. (Pubitemid 47039186)
25. Mulvey JM and Beck MP (1984). Solving capacitated clustering problems. Eur J Opl Res 18: 339-348.
26. Negreiros M and Palhano A (2006). The capacitated centred clustering problem. Comput Opns Res 33: 1639-1663. (Pubitemid 41525703)
27. Newell GF and Daganzo CF (1986). Design of multiple-vehicle delivery tours-I: A ring-radial network. Transport Res Part B 20: 345-363.
28. Osman IH and Ahmadi S (2007). Guided construction search metaheuristics for the capacitated p-median problem with single source constraint. J Opl Res Soc 58: 100-114. (Pubitemid 44925069)
29. Ouyang Y (2007). Design of vehicle routing zones for large-scale distribution systems. Transport Res Part B 41: 1079-1093. (Pubitemid 47520483)
30. Sherali HD and Desai J (2003). A global optimization RLT-based approach for solving the hard clustering problem. J Glob Opt 32: 281-306.
31. Wolsey LA (1998). Integer Programming. John Wiley: New York.