Hybrid nested partitions and mathematical programming approach and its applications

IEEE Transactions on Automation Science and Engineering

Volumn 5, Issue 4, 2008, Pages 573-586

  Pi, Liang ^a   Pan, Yunpeng ^b   Shi, Leyuan ^a,c  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b CombineNet Inc ^*  (United States)

^c TSINGHUA UNIVERSITY   (China)

Author keywords

Discrete facility location problem; Discrete optimization problem; Mathematical programming; Nested partitions; Pickup and delivery problem

Indexed keywords

APPLICATIONS; FACILITIES; OPTIMIZATION; PROBLEM SOLVING; SOLUTIONS;

DISCRETE FACILITY LOCATION PROBLEM; DISCRETE OPTIMIZATION PROBLEM; NESTED PARTITIONS; PICKUP AND DELIVERY PROBLEM;

MATHEMATICAL PROGRAMMING;

EID: 54849158500     PISSN: 15455955     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASE.2008.916761     Document Type: Article

References (46)

1. S. Abdinnour-Helm and M. A. Venkataramanan, "Solution approaches to hub location problems," Ann. Oper. Res., no. 78, pp. 31-50, 1998.
2. S. Arunapuram, K. Mathur, and D. Solow, "Vehicle routing and scheduling with full truckloads," Transp. Sci., vol. 37, no. 2, pp. 170-182, 2003.
3. F. Barahona and F. A. Chudak, "Near-optimal solutions to large-scale facility location problems," Discrete Opt., vol. 2, no. 1, pp. 35-50, 2005.
4. M. L. Brandeau and S. S. Chiu, "An overview of representative problems in location research," Manage. Sci., vol. 35, pp. 645-674, 1989.
5. O. Bräsy and M. Gendreau, "Vehicle routing problem with time windows, Part I: Route construction and local search algorithms," Transp. Sci., vol. 39, no. 1, pp. 104-118, 2005.
6. O. Bräsy and M. Gendreau, "Vehicle routing problem with time windows, Part II: Metaheuristics,"Transp. Sci., vol.39, no. 1, pp. 119-139, 2005.
7. A. M. Campbell and M. Savelsbergh, "Efficient insertion heuristics for vehicle routing and scheduling problems," Transp. Sci., vol. 38, no. 3, pp. 369-378, 2004.
8. J. F. Campbell, "Integer programming formulations of discrete hub location problems," Eur. J. Oper. Res., vol. 72, pp. 387-405, 1994.
9. J. F. Campbell, "Hub location and the p-hub median problem," Oper. Res., vol. 44, no. 6, pp. 923-934, 1996.
10. K. L. Croxton, B. Gendron, and T. L. Magnanti, "A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems," Manage. Sci., vol. 49, no. 9, pp. 1268-1279, 2003.
11. J. A. Diaz and E. Fernandez, "A branch-and-price algorithm for the single source capacitated plant location problem," J. Oper. Res. Soc., vol. 53, no. 7, pp. 728-740, 2002.
12. Y. Dumas, D. Esrosiers, and F. Soumis, "Pickup and delivery problem with time windows," Oper. Res., vol. 54, no. 1, pp. 7-22, 1991.
13. S. Elloumi, M. Labbe, and Y. Pochet, "A new formulation and resolution method for the p-center problem," INFORMS J. Computing, vol. 16, no. 1, pp. 84-94, 2004.
14. K. Fagerholt and M. Christiansen, "A travelling salesman problem with allocation, time window and precedence constraints-An application to ship scheduling," Int. Trans. Oper. Res., vol. 7, no. 3, pp. 231-244, 2000.
15. M. Fischetti and A. Lodi, "Local branching," Math. Programming, Ser. B, vol. 98, pp. 23-47, 2003.
16. B. Funke, T. Grunert, and S. Irnich, "Local search for vehicle routing and scheduling problems: Review and conceptual integration," J. Heuristics, vol. 11, no. 4, pp. 267-306, 2005.
17. A. Geoffrion, "Lagrangian relaxation for integer programming," Math. Programming Study, vol. 2, pp. 82-114, 1974.
18. T. S. Hale and C. R. Moberg, "Location science research: A review," Ann. Oper. Res., vol. 123, pp. 21-35, 2003.
19. K. Holmberg, M. Ronnqvist, and D. Yuan, "Exact algorithm for the capacitated facility location problems with single sourcing," Eur. J. Oper. Res., vol. 113, no. 3, pp. 544-559, 1999.
20. M. D. J. Desrosiers, F. Soumis, and M. SauvéGerad, "Methods for routing with time windows," Eur. J. Oper. Res., vol. 23, no. 2, pp. 236-245, 1986.
21. M. R. Korupolu, C. G. Plaxton, and R. Rajaraman, "Analysis of a local search heuristic for facility location problems," J. Algorithms, vol. 37, no. 1, pp. 146-188, 2000.
22. J. K. Lenstra, Local Search in Combinatorial Optimization. Princeton, NJ: Princeton Univ. Press, 2003.
23. A. Lim and F. Wang, "Multi-depot vehicle routing problem: A one-stage approach," IEEE Trans. Autom. Sci. Eng., vol. 2, no. 4, pp. 397-402, 2005.
24. A. Lim, F. Wang, and Z. Xu, "A transportation problem with minimum quantity commitment," Transp. Sci., vol. 40, no. 1, pp. 117-129, 2006.
25. Q. Lu and M. Dessouky, "An exact algorithm for the multiple vehicle pickup and delivery problem," Transp. Sci., vol. 38, no. 4, pp. 503-514, 2004.
26. P. B. Luh and D. J. Hoitomt, "Scheduling of manufacturing systems using the lagrangian relaxation technique," IEEE Trans. Autom. Control, vol. 38, no. 7, pp. 1066-1079, 1993.
27. J. B. Mazzola and A. W. Neebe, "Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type," Eur. J. Oper. Res., vol. 115, no. 2, pp. 285-299, 1999.
28. L. F. McGinnis, "A survey of recent results for a class of facilities location problems," Amer. Inst. Ind. Eng. Trans., vol. 9, pp. 11-18, 1977.
29. G. Mourkousis, M. Protonotarios, and T. Varvarigou, "Application of genetic algorithms to a large-scale multiple-constraint vehicle routing problem," Int. J. Computat. Intell. Appl., vol. 3, no. 1, pp. 1-21, 2003.
30. M. E. O'kelly and D. L. Bryan, "Hub location with flow economies of scale," Transp. Res. Part B, vol. 32, no. 8, pp. 605-616, 1998.
31. S. Ólafsson and L. Shi, "A method for scheduling in parallel manufacturing systems with flexible resources," IIE Trans., vol. 32, pp. 135-146, 2000.
32. S. Ólafsson and J. Yang, "Intelligent partitioning for feature selection," INFORMS J. Computing, vol. 17, no. 3, pp. 339-355, 2005.
33. A. Ouorou and P. Mahey, "A survey of algorithms for convex multi-commodity flow problems," Manage. Sci., vol. 46, no. 1, pp. 126-147, 2000.
34. Y. Pan, L. Shi, and L. Pi, "Solving the two-stage homing driver problem with applications in truckload trucking," in Proc. 10th MSOM Conf., 2005.
35. W. B. Powell, "Dynamic models of transportation operations," in Handbooks in Operations Research and Management Science: Supply Chain Management. Amsterdam: Elsevier, 2003, pp. 677-756.
36. W. B. Powell and T. Carvalho, "Dynamic control of logistics queueing networks for large scale fleet management," Transp. Sci., vol. 32, no. 2, pp. 90-109, 1998.
37. I. Racunica and L. Wynter, "Optimal location of intermodal freight hubs," Transp. Res. Part B, vol. 39, pp. 453-477, 2005.
38. D. F. Rogers, R. D. Plante, R. T. Wong, and J. R. Evans, "Aggregation and disaggregation techniques and methodology in optimization," Oper. Res., vol. 39, no. 4, pp. 553-582, 1991.
39. L. Shi, R. R. Meyer, M. Bozbay, and A. J. Miller, "A nested partitions framework for solving large-scale multicommodity facility location problems ,"J. Syst. Sci. Syst. Eng., vol. 13, no. 2, pp. 158-79, 2004.
40. L. Shi and S. Ólafsson, "Nested partitions method for global optimization," Oper. Res., vol. 48, no. 3, pp. 390-407, 2000.
41. L. Shi, S. Ólafsson, and Q. Chen, "An optimization framework for product design," Manage. Sci., vol. 47, no. 12, pp. 1681-1692, 2001.
42. L. Shi, S. Ólafsson, and N. Sun, "New parallel randomized algorithms for the traveling salesman problem," Comput. Oper. Res., vol. 26, pp. 374-391, 1999.
43. X. Wang and A. C. Regan, "Local truckload pickup and delivery with hard time window constraints," Transp. Res. Part B, vol. 36, pp. 78-94, 2002.
44. L. A. Wolsey, Integer Programming. : Wiley, 1998.
45. C. K. Wong and M. C. Easton, "An efficient method for weighted sampling without replacement," SIAM J. Comput., vol. 9, no. 1, pp. 111-113, 1980.
46. H. Xu, Z.-L. Chen, S. Rajagopal, and S. Arunapuram, "Solving a practical pickup and delivery problem," Transp. Sci., vol. 37, no. 3, pp. 347-364, 2001.