Nested partitions and its applications to the intermodal hub location problem

Springer Optimization and Its Applications

Volumn 30, Issue , 2009, Pages 229-251

  Chen, Weiwei ^a   Pi, Liang ^a   Shi, Leyuan ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976470336     PISSN: 19316828     EISSN: 19316836     Source Type: Book Series    
DOI: 10.1007/978-0-387-88617-6_8     Document Type: Chapter

References (35)

1. Sue Abdinnour-Helm and M. A. Venkataramanan. Solution approaches to hub location problems. Annals of Operations Research, 78(0):31-50, 1998.
2. P. V. Balakrishnan and V. S. Jacob. Triangulation in decision support systems: Algorithms for product design. Decision Support Systems, 14:313-327, 1995.
3. P. V. Balakrishnan and V. S. Jacob. Genetic algorithms for product design. Management Science, 42:1105-1117, 1996.
4. Dimitris Bertsimas and Chung-Piaw Teo. From valid inequalities to heuristics: a unified view of primal-dual approximation algorithms in covering problems. Operations Research, 46(4):503-514, 1998.
5. J. F. Campbell. Integer programming formulations of discrete hub location problems. European Journal of Operation Research, 72:387-405, 1994.
6. K. L. Croxton, B. Gendron, and T. L. Magnanti. A comparison of mixedinteger programming models for nonconvex piecewise linear cost minimization problems. Management Science, 49(9):1268-1279, 2003.
7. Djurdje Cvijović and Jacek Klinowski. Taboo search: An approach to the multiple minima problem. Science, 267(5198):664-666, 1995.
8. Marco Dorigo. Optimization, Learning and Natural Algorithms. PhD thesis, Politecnico di Milano, Italy, 1992.
9. Marco Dorigo, Gianni Di Caro, and Luca M. Gambardella. Ant algorithms for discrete optimization. Artificial Life, 5(2):137-172, 1999.
10. Marshall L. Fisher. The lagrangian relaxation method for solving integer programming problems. Management Science, 50(12):1861-1871, 2004.
11. A. Geoffrion. Lagrangian relaxation for integer programming. Mathematic Programming Study 2, 2:82-114, 1974.
12. Fred W. Glover and Manuel Laguna. Tabu Search. Kluwer Academic Publishers, Boston, MA, 1997.
13. D. E. Goldberg. Genetic Algorithm in Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA, 1989.
14. Trevor S. Hale and Christopher R. Moberg. Location science research: A review. Annals of Operations Research, 123:21-35, 2003.
15. N. G. Hall and D. S. Hochbaum. A fast approximation algorithm for the multicovering problem. Discrete Applied Mathematics, 15(1):35-40, 1986.
16. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 220(4598):671-680, 1983.
17. R. Kohli and R. Krishnamurti. Optimal product design using conjoint analysis: Computational complexity and algorithms. European Journal of Operations Research, 40:186-195, 1989.
18. Claude Lemaréchal. Lagrangian relaxation. In Michael Jünger and Denis Naddef, editors, Computation Combanatorial Optimization, volume 2241 of Lecture Notes in Computer Science, pages 112-156. Springer-Verlag, Berlin Heidelberg, 2001.
19. Melanie Mitchell. An Introduction to Genetic Algorithms. MIT Press, Cambridge, MA, 1998.
20. M. E. O'kelly and D. L. Bryan. Hub location with flow economies of scale. Transportation Research Part B, 32(8):605-616, 1998.
21. Sigurdur Ólafsson and Jaekyung Yang. Intelligent partitioning for feature selection. INFORMS Journal on Computing, 17(3):339-355, 2005.
22. Liang Pi, Yunpeng Pan, and Leyuan Shi. Hybrid nested partitions and mathematical programming approach and its applications. IEEE Transactions on Automation Science & Engineering, 5(4): 573-586, 2008.
23. Illia Racunica and Laura Wynter. Optimal location of intermodal freight hubs. Transportation Research Part B, 39:453-477, 2005.
24. Leyuan Shi and Shuli Men. Optimal buffer allocation in production lines. IIE Transactions, 35:1-10, 2003.
25. Leyuan Shi, Robert R. Meyer, Mehmet Bozbay, and Andrew J. Miller. A nested partitions framework for solving large-scale multicommodity facility location problems. Journal of Systems Science and Systems Engineering, 13(2):158-179, 2004.
26. Leyuan Shi and Sigurdur Ólafsson. Nested partitions method for global optimization. Operations Research, 48(3):390-407, 2000.
27. Leyuan Shi and Sigurdur Ólafsson. Nested partitions method for stochastic optimization. Methodology and Computing in Applied Probability, 2(3):271-291, 2000.
28. Leyuan Shi and Sigurdur Ólafsson. Nested Partitions Optimization: Methodology and Applications, volume 109 of International Series in Operations Research & Management Science. Springer, 2007.
29. Leyuan Shi, Sigurdur Ólafsson, and Qun Chen. An optimization framework for product design. Management Science, 47(12):1681-1692, 2001.
30. Lawrence V. Snyder. Facility location under uncertainty: A review. IIE Transactions, 38(7):547-564, 2006.
31. P. J. M. van Laarhoven and E. H. L. Aarts. Simulated annealing: theory and applications. Kluwer Academic Publishers, Norwell, MA, 1987.
32. Laurence A. Wolsey. Integer Programming. Wiley-Interscience, 1998.
33. Laurence A. Wolsey and George L. Nemhauser. Integer and Combinatorial Optimization. Wiley-Interscience, 1999.
34. C. K. Wong and M. C. Easton. An efficient method for weighted sampling without replacement. SIAM Journal on Computing, 9(1):111-113, 1980.
35. Jiawei Zhang. Approximating the two-level facility location problem via a quasi-greedy approach. Mathematical Programming, series A, 108(1):159-176, 2006.