Bicriterion discrete equilibrium network design problem

Networks

Volumn 63, Issue 4, 2014, Pages 286-305

  Xie, Chi ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

biobjective optimization; dichotomic method; discrete network design; equilibrium network design; generalized Benders decomposition

Indexed keywords

BUDGET CONTROL; INTEGER PROGRAMMING; STOCHASTIC PROGRAMMING;

BI-OBJECTIVE OPTIMIZATION; DICHOTOMIC METHOD; DISCRETE NETWORKS; GENERALIZED BENDERS DECOMPOSITIONS; NETWORK DESIGN;

NUMERICAL METHODS;

EID: 84902008570     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.21546     Document Type: Article

References (77)

1. S.K. Agarwal, Optimizing techniques for the interactive design of transportation networks under multiple objectives, Ph.D. Thesis, Department of Civil and Environmental Engineering, Northwestern University, Evanston, IL, 1973.
2. Y.P. Aneja, and, K.P.K. Nair, Bicriteria transportation problem, Manag Sci 25 (1979), 73-78.
3. A. Balakrishnan, T.L. Magnanti, and, R.T. Wong, A dual-ascent procedure for large-scale uncapacitated network design, Oper Res 37 (1989), 716-740.
4. M. Beckmann, C.B. McGuire, and, C.B. Winsten, Studies in the economics of transportation, Yale University Press, New Heaven, CT, 1956.
5. J.F. Benders, Partitioning procedures for solving mixed-variables programming problems, Numer Math 4 (1962), 238-252.
6. J.F. Benders, Partitioning procedures for solving mixed-variables programming problems, Comput Manag Sci 2 (2005), 3-19.
7. J.W. Billheimer, and, P. Gray, Network design with fixed and variable cost elements, Transp Sci 7 (1973), 49-74.
8. D.E. Boyce, A. Farhi, and, R. Weischedel, Optimal network problem: A branch-and-bound algorithm, Environ Plan 5 (1973), 519-533.
9. D.E. Boyce, and, B.N. Janson, A discrete transportation network design problem with combined trip distribution and assignment, Transp Res Part B, 14 (1980), 147-154.
10. D. Braess, Über ein paradoxon aus der verkehrsplanung, Unternehmensforschung 12 (1968), 258-268.
11. D. Braess, A. Nagurney, and, T. Wakolbinger, On a paradox of traffic planning, Transp Sci 39 (2005), 446-450.
12. G.E. Cantarella, and, A. Vitetta, The multi-criteria road network design problem in an urban area, Transportation 33 (2006), 567-588.
13. C.D. Cantrell, Modern mathematical methods for physicists and engineers, Cambridge University Press, Cambridge, England, UK, 2000.
14. L.G. Chalmet, L. Lemonidis, and, D.J. Elzinga, An algorithm for the bi-criterion integer programming problem, Eur J Oper Res 25 (1986), 292-300.
15. M. Chen, and, A.S. Alfa, A network design algorithm using a stochastic incremental traffic assignment approach, Transp Sci 25 (1991), 215-224.
16. A. Chen, K. Subprasom, and, Z. Ji, A simulaton-based multi-objective genetic algorithm (SMOGA) for BOT network design problem, Optim Eng 7 (2006), 225-247.
17. A. Chen, Z. Zhou, P. Chootinan, and, S.C. Wong, A bi-objective reliable network design model, Proceedings of the 87th TRB Annual Meeting, Transportation Research Board, Washington, DC, 2008.
18. J.L. Cohon, Multiobjective programming and planning, Academic Press, New York, NY, 1978.
19. Y. Collette, and, P. Siarry, Multiobjective optimization: Principles and case studies, Springer-Verlag, Berlin, Germany, 2003.
20. A.M. Costa, A survey on Benders decomposition applied to fixed-charge network design problems, Comput Oper Res 32 (2005), 1429-1450.
21. J.M. Coutinho-Rodrigues, J.C.N. Climaco, and, J.R. Current, An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions, Comput Oper Res 26 (1999), 789-798.
22. J.R. Current, and, M. Marsh, Multiobjective transportation network design and routing problems: Taxonomy and annotation, Eur J Oper Res 65 (1993), 4-19.
23. J.R. Current, and, H. Min, Multiobjective design of transportation networks: Taxonomy and annotation, Eur J Oper Res 26 (1986), 187-201.
24. J.R. Current, C.S. ReVelle, and, J.L. Cohon, An interactive approach to identify the best compromise solution for two objective shortest path problems, Comput Oper Res 17 (1990), 187-198.
25. R.B. Dial, Bicriterion traffic assignment: Basic theory and elementary algorithms, Transp Sci 30 (1996), 93-111.
26. R.B. Dial, Bicriterion traffic assignment: Efficient algorithms plus examples, Transp Res Part B, 31 (1997), 357-379.
27. R. Dionne, and, M. Florian, Exact and approximate algorithms for optimal network design, Networks 9 (1979), 37-59.
28. J. Duthie, and, S.T. Waller, Incorporating environmental justice measures into equilibrium-based network design, Transp Res Rec 2089 (2008), 58-65.
29. F.Y. Edgeworth, Mathematical physics, Kegan Paul, London, England, UK, 1881.
30. M. Ehrgott, Multicriteria optimization, Springer, Heidelberg, Germany, 2005.
31. M. Ehrgott, and, X. Gandibleux, A survey and annotated bibliography of multiobjective combinatorial optimization, OR Spektrum 22 (2000), 425-460.
32. M. Ehrgott, and, X. Gandibleux, Approximate solution methods for multiobjective combinatorial optimization, TOP 12 (2004), 1-89.
33. G.W. Evans, An overview of techniques for solving multiobjective mathematical programs, Manag Sci 30 (1984), 1268-1282.
34. T.L. Friesz, "Multiobjective optimization in transportation: The case of equilibrium network design," Organizations: Multiple agents with multiple criteria, J.N. Morse, (Editor), Springer-Verlag, Berlin, Germany, 1981.
35. T.L. Friesz, G. Anandalingam, N.J. Mehta, K. Nam, S.J. Shah, and, R.L. Tobin, The multiobjective equilibrium network design problem revisited: A simulated annealing approach, Eur J Oper Res 65 (1993), 44-57.
36. T.L. Friesz, and, P.T. Harker, Multicriteria spatial price equilibrium network design: Theory and computational results, Transp Res Part B, 17 (1983), 411-426.
37. B. Fruhwirth, R.E. Burkard, and, G. Rote, Approximation of convex curves with application to the bicriteria minimum cost flow problem, Eur J Oper Res 42 (1989), 326-338.
38. Z. Gao, J. Wu, and, H. Sun, Solution algorithm for the bi-level discrete network design problem, Transp Res Part B, 39 (2005), 479-495.
39. W.L. Garrison, and, D.F. Marble, Analysis of highway networks: A linear programming formulation, Highway Res Board Proc 37 (1958), 1-14.
40. A.M. Geoffrion, Generalized Benders decomposition, JOptim Theory Appl 10 (1972), 237-260.
41. A.M. Geoffrion, J.S. Dyer, and, A. Feinberg, An interactive approach for multi-criterion optimization, with an application to the operation of an academic department, Manag Sci 19 (1972), 357-368.
42. Y.Y. Haimes, W.A. Hall, and, H.T. Freeman, Multiobjective optimization in water resources systems, Elsevier, Amsterdam, The Netherlands, 1975.
43. H.H. Hoang, Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition, IEEE Trans Automat Contr 27 (1982), 164-169.
44. J.P. Ignizio, Goal programming and extensions, Lexington Books, Lexington, MA, 1976.
45. J. Jahn, Vector optimization, Springer-Verlag, Berlin, Germany, 2004.
46. B.W. Lamar, W.B. Sheffi, and, W.B. Powell, A capacity improvement lower bound for fixed charge network design problems, Oper Res 38 (1990), 704-710.
47. L.J. LeBlanc, An algorithm for the discrete network design problem, Transp Sci 9 (1975), 183-199.
48. D.Y. Lin, and, C. Xie, The Pareto-optimal solution set of the equilibrium network design problem with multiple commensurate objectives, Networks Spatial Econ 11 (2011), 727-751.
49. C.C. Lu, H.S. Mahmassani, and, X. Zhou, A bi-criterion dynamic user equilibrium traffic assignment model and solution algorithm for evaluating dynamic road pricing strategies, Transp Res Part C, 16 (2008), 371-389.
50. T.L. Magnanti, P. Mireault, and, R.T. Wong, Tailoring Benders decomposition for uncapacitated network design, Math Program Study 26 (1986), 112-154.
51. T.L. Magnanti, and, R.T. Wong, Network design and transportation planning: Models and algorithms, Transp Sci 18 (1984), 1-55.
52. D.C. Major, Benefit-cost ratios for projects in multiple objective investment programs, Water Resour Res 5 (1969), 1174-1178.
53. S.A. Marglin, Public investment criteria, MIT Press, Cambridge, MA, 1967.
54. Q. Meng, and, H. Yang, Benefit distribution and equity in road network design, Transp Res Part B, 36 (2002), 19-35.
55. M. Minoux, Network synthesis and optimum network design problems: Models, solution methods and applications, Networks 19 (1989), 313-360.
56. J. Mote, I. Murthy, and, D.L. Olson, A parametric approach to solving bicriterion shortest path problems, Eur J Oper Res 53 (1991), 81-92.
57. A. Osyczka, and, S. Kundu, A new method to solve generalized multicriteria optimization problems using the simple genetic algorithm, Struc Optim 10 (1995), 94-99.
58. V. Pareto, Cours d'economie politique, F. Rouge, Lausanne, Switzerland, 1896.
59. M. Patriksson, The traffic assignment problem: Models and methods, VSP, Utrecht, the Netherlands, 1994.
60. J. Perl, Goal programming approach to multiobjective highway network design model, Transp Res Rec 751 (1980), 41-44.
61. H. Poorzahedy, and, M.A. Turnquist, Approximate algorithms for the discrete network design problem, Transp Res Part B, 16 (1982), 45-55.
62. R.E. Quandt, Models of transportation and optimal network construction, J Reg Sci 2 (1960), 27-45.
63. S. Sharma, S.V. Ukkusuri, and, T.V. Mathew, Pareto optimal multiobjective optimization for robust transportation network design, Transp Res Rec 2090 (2009), 95-104.
64. H.D. Sherali, T.B. Carter, and, A.G. Hobeika, A location-allocation model and algorithm for evacuation planning under hurricane/flood conditions, Transp Res Part B, 25 (1991), 439-452.
65. P.A. Steenbrink, Optimization of transport networks, John Wiley & Sons, New York, NY, 1974.
66. P.A. Steenbrink, Transport network optimization in the Dutch integral transportation study, Transp Res 8 (1974), 11-27.
67. A. Sumalee, S.P. Shepherd, and, A.D. May, Road user charging design: Dealing with multi-objectives and constraints, Transportation 36 (2009), 167-186.
68. G.H. Tzeng, and, S.H. Tsaur, Application of multiple criteria decision making for network improvement, J Adv Transp 31 (1997), 49-74.
69. E.L. Ulungu, and, J. Teghem, Multiobjective combinatorial optimization problems: A survey, J Multi-Criteria Decision Anal 3 (1994), 83-104.
70. D.J. White, The set of efficient solutions for multiple objective shortest path problems, Comput Oper Res 9 (1982), 101-107.
71. D.J. White, A bibliography on the applications of mathematical programming multiple-objective methods, J Oper Res Soc 41 (1990), 669-691.
72. R.T. Wong, Transportation network research: Algorithmic and computational questions, Transp Res Part A, 19 (1985), 436-438.
73. H. Yang, and, M.G.H. Bell, Models and algorithms for road network design: A review and some new developments, Transp Rev 18 (1998), 257-278.
74. H. Yang, and, J.Y.T. Wang, Travel time minimization versus reserve capacity maximization in the network design problem, Transp Res Rec 1783 (2002), 17-26.
75. Y. Yin, Multiobjective bilevel optimization for transportation planning and management problems, J Adv Transp 36 (2002), 93-105.
76. Y. Yin, and, S. Lawphongpanich, Internalizing emission externality on road networks, Transp Res Part D 11 (2006), 292-301.
77. L.A. Zadeh, Optimality and non-scalar-valued performance criteria, IEEE Trans Autom Control 8 (1963), 59-60.