A quantum-inspired genetic algorithm for dynamic continuous network design problem

REFERENCE

• Benioff, P. (1980) The Computer as a Physical System: A Microscopic Quantum Mechanical Hamiltonian Model of Computers as Represented by Turing Machines. Journal of Statistical Physics, Vol.22, No. 5, 563–591.
   Web of Science ®Google Scholar
• Chang, E. J. (2004) Time-Varying Intermodal Person Trip Assignment. Ph.D. Dissertation, Northwestern University.
   Google Scholar
• Colson, B., P. Marcotte, and G. Savard. (2007) An Overview of Bilevel Optimization, Annals of Operations Research, vol. 153, 235–256
   Web of Science ®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, vol. 28B, No.4, 269–287.
   Google Scholar
• Daganzo, C.F. (1995) The Cell Transmission Model, Part II: Network Traffic. Transportation Research Part B, Vol. 29B, No. 2, 79–93.
   Google Scholar
• DiVincenzo, D. P. (1995) Quantum Computation. Science, Vol. 270, No. 5234, 255–261.
   Web of Science ®Google Scholar
• Giraldi, G.A., R. Portugal and R. N. Thess. (2004) Genetic Algorithm and Quantum Computation. arXiv:cs/0403003.
   Google Scholar
• Grover, L.K. (1996) A Fast Quantum Mechanical Algorithm for Database Search. Annual ACM Symposium on Theory of Computing: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing. 212–219.
   Google Scholar
• Han, K.-H., Park, K.-H., Lee, C.-H. and Kim, J.H. (2001) Parallel Quantum-Inspired Genetic Algorithm for Combinatorial Optimization Problem. Proceedings of Evolutionary Computation, 1422–1429.
   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 Vol. 6, No. 6, 580–593.
   Web of Science ®Google Scholar
• Han, K-.H. and Kim, J.-H, (2003) On Setting the Parameters of Quantum-Inspired Evolutionary Algorithm for Practical Application. Proceedings of Evolutionary Computation, 178–184.
   Google Scholar
• Holland, J. H. (1975), Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor.
   Google Scholar
• IBM Almaden Research Center (2000), <http://www.almaden.ibm.com/>. (Accessed October/2008)
   Google Scholar
• Janson, B. N. (1995) Network Design Effects of Dynamic Traffic Assignment. Journal of Transportation Engineering, Vol. 121, No. 1, 1–13.
   Web of Science ®Google Scholar
• Jeon, K., S. Ukkusuri and S. T. Waller. (2005) Heuristic Approach for Discrete Network Design Problem Accounting for Dynamic Traffic Assignment Conditions: Formulations, Solution Methodologies, Implementations and Computational Experiences. Proceedings of the 84th Annual Meeting of the Transportation Research Board, Washington, D.C.
   Google Scholar
• Johnson, D.S., Lenstra, J. K. and Rinnooy Kan, A. H. G. (1978) The Complexity of the Network Design Problem, Networks, Volume 8, Issue 4, 279–285.
   Web of Science ®Google Scholar
• Karoonsoontawong, A. (2006). Robustness Approach to the Integrated Network Design Problem, Signal Optimization and Dynamic Traffic Assignment Problem. Ph.D. Dissertation, The University of Texas at Austin, Austin, Texas.
   Google Scholar
• Karoonsoontawong, A. and S. T. Waller. (2006) Dynamic Continuous Network Design Problem: Linear Bilevel Programming and Metaheuristic Approaches. Transportation Research Record: Journal of the Transportation Research Board, No. 1964, 104–117.
   Google Scholar
• Li, Y., A. K. Ziliaskopoulos, and S.T. Waller. (1999) Linear Programming Formulations for System Optimum Dynamic Traffic Assignment with Arrival Time-Based and Departure Time-Based Demands, Transportation Research Record: Journal of the Transportation Research Board, No. 1667, 52–59.
   Google Scholar
• Lin, D.-Y., A. Karoonsoontawong and S.T. Waller. (2007) A Dantzig-Wolfe Decomposition Based Heuristic Scheme for Bi-level Dynamic Network Design Problem, Technical Paper, University of Texas at Austin.
   Google Scholar
• Lin, D.-Y., A. Unnikrishnan, and S.T. Waller. (2008) A Genetic Algorithm for Bi-level Linear Programming Dynamic Network Design Problem, Technical Paper, University of Texas at Austin.
   Google Scholar
• Shor, P. W. (1994) Algorithms for quantum computation: Discrete logarithms and factoring. Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, 124–134.
   Google Scholar
• Shor, P. W. (1997) Polynomial-time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, SIAM Journal on Computing, Vol. 26, No. 5, 1484–1509.
   Google Scholar
• Steane, A. (1998) Quantum Computing. Reports on Progress in Physics, Vol. 61, No.2, 117–173.
   Web of Science ®Google Scholar
• Tony, H. (1999) Quantum Computing: An Introduction. Computing and Control Engineering Journal, 105–112.
   Google Scholar
• Waller, S. T. (2000) Optimization and Control of Stochastic Dynamic Transportation Systems: Formulations, Solution Methodologies, and Computational Experience. Ph.D. Dissertation, Northwestern University.
   Google Scholar
• Waller, S.T. and A.K. Ziliaskopoulos. (1998) A VisualInteractive System for Transportation Algorithms. Presented at the 78th Annual Meeting of the Transportation Research Board, Washington, D.C.
   Google Scholar
• Xie, C. (2008) Evacuation Network Optimization: Models, Solution Methods and Applications, Ph.D. Dissertation, Cornell University.
   Google Scholar