A dual approximation-based quantum-inspired genetic algorithm for the dynamic network design problem

References

• Ahuja, R. K., T. L. Magnanti, and J. B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. Englewood Cliffs, NJ: Prentice Hall.
   Google Scholar
• Bard, J. F. 1998. Practical Bilevel Optimization Algorithms and Applications. Nonconvex Optimization and Its Applications. Boston, MA, Springer US: 1 online resource (xii, 476 pages).
   Google Scholar
• Boyce, D. E. 1984. “Urban-transportation Network-equilibrium and Design Models – Recent Achievements and Future-prospects.” Environment and Planning a 16 (11): 1445–1474.10.1068/a161445
   Web of Science ®Google Scholar
• Boyce, D. E., and B. N. Janson. 1980. “A Discrete Transportation Network Design Problem with Combined Trip Distribution and Assignment.” Transportation Research Part B-Methodological 14 (1–2): 147–154.10.1016/0191-2615(80)90040-5
   Web of Science ®Google Scholar
• Chang, E. 2004. “Time-varying Intermodal Person Trip Assignment.” PhD, Northwestern University.
   Google Scholar
• Chiu, Y.-C., Jon Bottom, Michael Mahut, Alex Paz, Ramachandran Balakrishna, Travis Waller, and J. Hicks. 2011. A Primer for Dynamic Traffic Assignment. Washington, DC: Transport Research Board.
   Google Scholar
• Daganzo, C. F. 1994. “The Cell Transmission Model – A Dynamic Representation of Highway Traffic Consistent with the Hydrodynamic Theory.” Transportation Research Part B-Methodological 28 (4): 269–287.10.1016/0191-2615(94)90002-7
   Web of Science ®Google Scholar
• Daganzo, C. F. 1995. “The Cell Transmission Model. 2. Network Traffic.” Transportation Research Part B-Methodological 29 (2): 79–93.10.1016/0191-2615(94)00022-R
   Web of Science ®Google Scholar
• Divincenzo, D. P. 1995. “Quantum Computation.” Science 270 (5234): 255–261.10.1126/science.270.5234.255
   Web of Science ®Google Scholar
• Do Chung, B., T. Yao, C. Xie, and A. Thorsen. 2011. “Robust Optimization Model for a Dynamic Network Design Problem under Demand Uncertainty.” Networks & Spatial Economics 11 (2): 371–389.10.1007/s11067-010-9147-2
   Web of Science ®Google Scholar
• Friesz, T. L. 1985. “Transportation Network Equilibrium, Design and Aggregation – Key Developments and Research Opportunities.” Transportation Research Part a-Policy and Practice 19 (5–6): 413–427.10.1016/0191-2607(85)90041-X
   Web of Science ®Google Scholar
• Goldberg, D. E. 2002. The Design of Innovation: Lessons from and for Competent Genetic Algorithms. Boston, MA: Kluwer Academic.10.1007/978-1-4757-3643-4
   Google Scholar
• Han, K. H., and J. H. Kim. 2002. “Quantum-Inspired Evolutionary Algorithm for a Class of Combinatorial Optimization.” IEEE Transactions on Evolutionary Computation 6 (6): 580–593.10.1109/TEVC.2002.804320
   Web of Science ®Google Scholar
• Karoonsoontawong, A., and S. T. Waller. 2005. “Comparison of System- and User-optimal Stochastic Dynamic Network Design Models Using Monte Carlo Bounding Techniques.” Network Modeling 2005 (1923): 91–102.
   Google Scholar
• Karoonsoontawong, A., and S. T. Waller. 2006. “Dynamic Continuous Network Design Problem – Linear Bilevel Programming and Metaheuristic Approaches.” Network Modeling 2006 (1964): 104–117.
   Google Scholar
• Karoonsoontawong, A., and S. T. Waller. 2007. “Robust Dynamic Continuous Network Design Problem.” Transportation Research Record (2029): 58–71.10.3141/2029-07
   Web of Science ®Google Scholar
• Karoonsoontawong, A., and S. T. Waller. 2010. “Integrated Network Capacity Expansion and Traffic Signal Optimization Problem: Robust Bi-level Dynamic Formulation.” Networks & Spatial Economics 10 (4): 525–550.10.1007/s11067-008-9071-x
   Web of Science ®Google Scholar
• Lin, D. Y., A. Karoonsoontawong, and S. T. Waller. 2011. “A Dantzig-Wolfe Decomposition Based Heuristic Scheme for Bi-level Dynamic Network Design Problem.” Networks & Spatial Economics 11 (1): 101–126.10.1007/s11067-008-9093-4
   Web of Science ®Google Scholar
• Lin, D. Y., A. Unnikrishnan, and S. T. Waller. 2009. “A Genetic Algorithm for Bi-level Linear Programming Dynamic Network Design Problem.” Transportation Letters-The International Journal of Transportation Research 1 (4): 281–294.
   Web of Science ®Google Scholar
• Lin, D. Y., V. Valsaraj, and S. T. Waller. 2011. “A Dantzig-Wolfe Decomposition-based Heuristic for off-Line Capacity Calibration of Dynamic Traffic Assignment.” Computer-Aided Civil and Infrastructure Engineering 26 (1): 1–15.
   Web of Science ®Google Scholar
• Lin, D. Y., and S. T. Waller. 2009. “A Quantum-inspired Genetic Algorithm for Dynamic Continuous Network Design Problem.” Transportation Letters-The International Journal of Transportation Research 1 (1): 81–93.
   Web of Science ®Google Scholar
• Magnanti, T. L., and R. T. Wong. 1984. “Network Design and Transportation-Planning – Models and Algorithms.” Transportation Science 18 (1): 1–55.10.1287/trsc.18.1.1
   Web of Science ®Google Scholar
• Ng, M., and D. Y. Lin. 2015. “Sharp Probability Inequalities for Reliable Evacuation Planning.” Transportation Research Part C-Emerging Technologies 60: 161–168.
   Web of Science ®Google Scholar
• Ng, M. W., D. Y. Lin, and S. T. Waller. 2009. “Optimal Long-Term Infrastructure Maintenance Planning Accounting for Traffic Dynamics.” Computer-Aided Civil and Infrastructure Engineering 24 (7): 459–469.
   Web of Science ®Google Scholar
• Ng, M., and S. T. Waller. 2010. “Reliable Evacuation Planning via Demand Inflation and Supply Deflation.” Transportation Research Part E: Logistics and Transportation Review 46 (6): 1086–1094.
   Web of Science ®Google Scholar
• Peeta, S., and A. Ziliaskopoulos. 2001. “Foundations of Dynamic Traffic Assignment: The past, the Present and the Future.” Networks and Spatial Economics 1 (3–4): 233–265.10.1023/A:1012827724856
   Google Scholar
• Stackelberg, H. V. 1952. The Theory of the Market Economy. New York: Oxford University Press.
   Google Scholar
• Sun, H., Z. Y. Gao, W. Y. Szeto, J. C. Long, and F. X. Zhao. 2014. “A Distributionally Robust Joint Chance Constrained Optimization Model for the Dynamic Network Design Problem under Demand Uncertainty.” Networks & Spatial Economics 14 (3–4): 409–433.10.1007/s11067-014-9236-8
   Web of Science ®Google Scholar
• Sun, H., Z. Y. Gao, and F. X. Zhao. 2014. “Dynamic Network Design Problem under Demand Uncertainty: An Adjustable Robust Optimization Approach.” Discrete Dynamics in Nature and Society.
   Web of Science ®Google Scholar
• Ukkusuri, S. V., and S. T. Waller. 2008. “Linear Programming Models for the User and System Optimal Dynamic Network Design Problem: Formulations, Comparisons and Extensions.” Networks & Spatial Economics 8 (4): 383–406.10.1007/s11067-007-9019-6
   Web of Science ®Google Scholar
• Waller, S. T., K. C. Mouskos, D. Kamaryiannis, and A. K. Ziliaskopoulos. 2006. “A Linear Model for the Continuous Network Design Problem.” Computer-Aided Civil and Infrastructure Engineering 21 (5): 334–345.10.1111/mice.2006.21.issue-5
   Web of Science ®Google Scholar
• Waller, S. T., and A. K. Ziliaskopoulos. 1998. “A Visual Interactive System for Transportation Algorithms”. Annual Meeting of the Transportation Research Board. Washington, DC.
   Google Scholar
• Waller, S. T., and A. K. Ziliaskopoulos. 2001. “Stochastic Dynamic Network Design Problem.” Transportation Network Modeling 2001 (1771): 106–113.
   Google Scholar
• Wismans, L., E. Van Berkum, and M. Bliemer. 2014. “Acceleration of Solving the Dynamic Multi-objective Network Design Problem Using Response Surface Methods.” Journal of Intelligent Transportation Systems 18 (1): 17–29.10.1080/15472450.2013.773250
   Web of Science ®Google Scholar
• Xie, C., D. Y. Lin, and S. T. Waller. 2010. “A Dynamic Evacuation Network Optimization Problem with Lane Reversal and Crossing Elimination Strategies.” Transportation Research Part E-Logistics and Transportation Review 46 (3): 295–316.10.1016/j.tre.2009.11.004
   Web of Science ®Google Scholar
• Yang, H., and M. G. H. Bell. 1998. “Models and Algorithms for Road Network Design: A Review and Some New Developments.” Transport Reviews 18 (3): 257–278.10.1080/01441649808717016
   Web of Science ®Google Scholar
• Ziliaskopoulos, A. K. 2000. “A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem.” Transportation Science 34 (1): 37–49.10.1287/trsc.34.1.37.12281
   Web of Science ®Google Scholar
• Ziliaskopoulos, A., D. Kotzinos, and H. S. Mahmassani. 1997. “Design and Implementation of Parallel Time-dependent Least Time Path Algorithms for Intelligent Transportation Systems Applications.” Transportation Research Part C-Emerging Technologies 5 (2): 95–107.10.1016/S0968-090X(97)00004-1
   Web of Science ®Google Scholar