Some numerical results on the diagonalization algorithm for network assignment with asymmetric interactions between cars and trucks |
| |
| Institution: | 1. Department of Chemical System Engineering, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo, 113-8656, Japan;2. Department of Biotechnology, Osaka University, 2-1 Yamadaoka, Suita, Osaka, 565-0871, Japan;1. Key Laboratory of Smart Grid of Ministry of Education, School of Electrical Engineering & Automation, Tianjin University, Tianjin 30072, China;2. Institute for Integrated Energy Systems, Dept. of Mechanical Engineering, University of Victoria, Victoria, BC V8W 3P6, Canada;3. Faculty of Engineering, King Abdulaziz University, Jeddah, Saudi Arabia;1. Universidade Federal Fluminense (UFF), Instituto de Biologia, Departamento de Biologia Marinha, Campus do Valonguinho, Outeiro São João Batista, 24020-141, Niterói, RJ, Brazil;2. Museu Paraense Emílio Goeldi (MPEG), 66040-170, Belém, PA, Brazil;1. Department of Breast Surgery, The First Affiliated Hospital, and College of Clinical Medicine of Henan University of Science and Technology, Luoyang, 471003, China;2. Department of Oncology, The First Affiliated Hospital, and College of Clinical Medicine of Henan University of Science and Technology, Luoyang, 471003, China;1. Department of Orthopedics, Shoulder and Elbow Team, Applied Research, Balgrist University Hospital, Zürich, Switzerland;2. Infectiology, Applied Research, Balgrist University Hospital, Zürich, Switzerland;3. Unit for Clinical and Applied Research, Balgrist University Hospital, Zürich, Switzerland |
| |
| Abstract: | Numerical experiments are performed to test the applicability of the diagonalization algorithm to problems involving asymmetric interactions between passenger cars and trucks in highway networks. Three test networks are considered, including a representation of the Texas highway network, thus providing a realistic case application. The main aspects of the algorithm's performance addressed in these experiments are its convergence characteristics as well as the effectiveness of some computational streamlining strategies. Although convergence is not guaranteed a priori, it was actually achieved in all test cases. Furthermore, it was shown that shortcut strategies can considerably reduce the algorithm's computational requirements. These strategies involve performing only a few “internal” Frank-Wolfe iterations in solving the sequence of diagonalized subproblems. The results suggest the use of less than four internal iterations, with the use of two such iterations exhibiting the highest frequency of best performance in the tests conducted, followed by one and three internal iterations, respectively. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
