Research Article

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

Table 3

Example of computation of GSM in the case of DFP-GSM algorithm.

Iteration

1031.1461.8543493.4764575476.740529
201.8540.7082281.1462297.4477293493.476457
301.1460.4377720.7082281595.810762297.447729
400.7082280.2705430960.4377721206.1021091595.81076
500.4377720.1672289040.2705430961005.5000451206.102109
600.2705430960.1033474630.167228904910.87100411005.500045
700.1672289040.0638814410.103347463871.3625899910.8710041
800.1033474630.0394787310.063881441858.3072898871.3625899
900.0638814410.0244027110.039478731856.576918858.3072898
1000.0394787310.0150808750.024402711858.7347619856.576918
110.0150808750.0394787310.0244027110.03015875856.576918856.5491249
120.0244027110.0394787310.030158750.033719691856.5491249856.9727219
130.0244027110.0337196910.0279617970.03015875856.4520154856.5491249

Values of function evaluated newly in each iteration.