Research Article

Performance Comparison of Mode Choice Optimization Algorithm with Simulated Discrete Choice Modeling

Table 16

The experimental results of four algorithms responding to a new way of calculating the initial Hessian matrix adopted from either BHHH or BHHH-2 algorithm (exp. 3) ().

Algorithms & performance measuresStep size ()
1/321/161/81/41/2124

DFP-(BHHH)
 One iteration time-0:00:180:00:180:00:240:00:20---
 Number of iterations-74371911---
 Convergence time-0:22:270:11:050:07:200:03:31---
DFP-(BHHH-2)
 One iteration time-0:00:200:00:200:00:200:00:19---
 Number of iterations-74371910---
 Convergence time-0:24:100:12:070:06:130:03:00---
BFGS-(BHHH)
 One iteration time0:00:180:00:170:00:180:00:180:00:200:00:17--
 Number of iterations147743719106--
 Convergence time0:42:480:21:010:10:440:05:330:03:070:01:38--
BFGS-(BHHH-2)
 One iteration time0:00:180:00:180:00:180:00:180:00:190:00:15--
 Number of iterations147733719106--
 Convergence time0:44:290:22:120:11:110:05:420:03:030:01:40--

Algorithms & performance measuresInterval of uncertainty
LL, ULLL, ULLL, ULLL, ULLL, ULLL, ULLL, ULLL, UL

DFP-GSM-(BHHH)
 One iteration time0:02:400:01:340:01:360:01:410:01:410:01:470:01:470:01:47
 Number of iterations76666666
 Convergence time0:18:320:09:130:09:260:09:570:09:570:10:320:10:330:10:34
DFP-GSM-(BHHH-2)
 One iteration time0:01:210:01:360:01:360:01:420:01:420:01:470:01:490:01:46
 Number of iterations76666666
 Convergence time0:09:190:09:250:09:250:10:010:10:050:10:310:10:430:10:28
BFGS-GSM-(BHHH)
 One iteration time0:01:120:01:160:01:160:01:180:01:200:01:240:01:250:01:22
 Number of iterations56666666
 Convergence time0:07:080:07:280:07:260:07:370:07:520:08:170:08:210:08:05
BFGS-GSM-(BHHH-2)
 One iteration time0:01:060:01:130:01:150:01:180:01:180:01:220:01:210:01:22
 Number of iterations66666666
 Convergence time0:6:460:07:300:07:380:08:000:07:540:08:190:08:170:08:32