forked from akhani/FAST-TrIPs
-
Notifications
You must be signed in to change notification settings - Fork 1
/
ft_passenger.h
786 lines (739 loc) · 27.1 KB
/
ft_passenger.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
/*-------------------------------------------------------
FAST-TrIPs: Flexible Assignment and Simulation Tool for Transit and Intermodal Passengers
Copyright 2014 Alireza Khani and Mark Hickman
Licensed under the Apache License, Version 2.0
-------------------------------------------------------
Code primarily written by Alireza Khani
Under supervision of Mark Hickman
Contact:
Alireza Khani: akhani@utexas.edu or akhani@email.arizona.edu
Mark Hickman: m.hickman1@uq.edu.au
-------------------------------------------------------
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-------------------------------------------------------*/
#include <string>
#include <iostream>
#include <fstream>
#include <sstream>
#include <vector>
using namespace std;
//////////////////////////////////////////////////////////////////////////////////////////////////////////
class passenger{
protected:
string passengerString;
string passengerId;
string passengerOriginTAZ;
string passengerDestinationTAZ;
int passengerMode;
int passengerTimePeriod;
int passengerTourHalf;
double passengerPDT;
double passengerPAT;
string passengerTazTime;
int passengerPathId;
//Simulation
string assignedPath;
double startTime;
double endTime;
int lengthOfPassengerTrip;
vector<string> boardingStops;
vector<string> trips;
vector<string> alightingStops;
vector<double> walkingTimes;
int passengerStatus; //-1=not assigned, 0=assigned, 1=walking, 2=waiting, 3=on board, 4=missed, 5=arrived,
int passengerPathIndex;
vector<double> experiencedArrivalTimes;
vector<double> experiencedBoardingTimes;
vector<double> experiencedAlightingTimes;
string experiencedPath;
double experiencedCost;
//path-based assignment
map<string,int> pathSet;
map<string,int>::iterator pathIter;
map<string,double> pathUtility;
map<string,double>::iterator pathIter2;
map<string,int> pathCapacity;
// lmz: this is just for ordering paths so we process them in the same order as fast-trips code
typedef struct {
vector<int> stops;
vector<int> trips;
} PathCompat;
struct PathCompatCompare {
// less than
bool operator()(const PathCompat &path1, const PathCompat &path2) const {
if (path1.stops.size() < path2.stops.size()) { return true; }
if (path1.stops.size() > path2.stops.size()) { return false; }
// if number of stops matches, check the stop ids and trip id
for (int ind=0; ind<path1.stops.size(); ++ind) {
if (path1.stops[ind] < path2.stops[ind]) { return true; }
if (path1.stops[ind] > path2.stops[ind]) { return false; }
if (path1.trips[ind] < path2.trips[ind]) { return true; }
if (path1.trips[ind] > path2.trips[ind]) { return false; }
}
return false;
}
};
// store it here. PathCompat -> path string
map<PathCompat, string, struct passenger::PathCompatCompare> pathCompatMap;
public:
passenger(){}
~passenger(){}
void initializePassenger(string _passengerStr, int _pathId);
string getPassengerString();
string getPassengerId();
string getOriginTAZ();
string getDestinationTAZ();
double getPDT();
double getPAT();
int getTourHalf();
int getMode();
string getTazTime();
int getTimePeriod();
//For Assignment
void setAssignedPath(string _tmpPath);
string getAssignedPath();
void setRandSeed();
//For Simulation
void resetPathInfo();
int initializePath();
int getPathIndex();
double getStartTime();
void setPassengerStatus(int _status);
int getPassengerStatus();
void increasePathIndex();
void setEndTime(double _endTime);
string getCurrentBoardingStopId();
string getCurrentTripId();
string getCurrentAlightingStopId();
double getCurrentWalkingTime();
void addArrivalTime(double _arrivalTime);
void addBoardingTime(double _boardingTime);
void addAlightingTime(double _alightingTime);
double getArrivalTime();
double getBoardingTime();
double getAlightingTime();
string getExperiencedPath();
//For Available Capacity Definition
string getLastTripId();
string getLastAlightingStop();
void calculateExperiencedCost();
double getExperiencedCost();
//path-based assignment
void resetPaths();
void addPaths(string _tmpPath);
void analyzePaths(bool trace);
string assignPath(bool trace);
};
//////////////////////////////////////////////////////////////////////////////////////////////////////////
map<string,passenger*> passengerSet;
list<passenger*> passengerList;
map<string,string> tazTimeSet;
list<passenger*> passengers2transfer;
//////////////////////////////////////////////////////////////////////////////////////////////////////////
int readPassengers(){
string tmpIn, buf, tmpPassengerId, tmpMode;
vector<string> tokens;
passenger* tmpPassengerPntr;
ifstream inFile;
inFile.open("ft_input_demand.dat");
if (!inFile) {
cerr << "Unable to open file ft_input_demand.dat";
exit(1);
}
int path_id = 0; // for compat with fast-trips, unique per path (not nec the same as p)
getline(inFile,tmpIn);
while (!inFile.eof()){
buf.clear();
tokens.clear();
getline(inFile,tmpIn);
if(tmpIn=="") continue;
stringstream ss(tmpIn);
while (ss >> buf){
tokens.push_back(buf);
}
tmpPassengerId = "p";
tmpPassengerId.append(tokens[0]);
tmpPassengerPntr = NULL;
tmpPassengerPntr = new passenger;
passengerSet[tmpPassengerId] = tmpPassengerPntr;
passengerList.push_back(tmpPassengerPntr);
passengerSet[tmpPassengerId]->initializePassenger(tmpIn, path_id);
path_id++;
}
inFile.close();
return passengerSet.size();
}
//////////////////////////////////////////////////////////////////////////////////////////////////////////
int readExistingPaths(){
int tmpNumPaths;
string tmpIn, buf, tmpPassengerId, tmpPath;
vector<string> tokens;
ifstream inFile;
inFile.open("ft_output_passengerPaths.dat");
if (!inFile) {
cerr << "Unable to open file ft_output_passengerPaths.dat";
exit(1);
}
tmpNumPaths = 0;
getline(inFile,tmpIn);
while (!inFile.eof()){
buf.clear();
tokens.clear();
getline(inFile,tmpIn);
if(tmpIn=="") continue;
stringstream ss(tmpIn);
while (ss >> buf){
tokens.push_back(buf);
}
tmpPassengerId = "p";
tmpPassengerId.append(tokens[0]);
tmpPath = tokens[4] + "\t" + tokens[5] + "\t" + tokens[6] + "\t" + tokens[7] + "\t" + tokens[8];
passengerSet[tmpPassengerId]->setAssignedPath(tmpPath);
tmpNumPaths++;
}
inFile.close();
return tmpNumPaths;
}
//////////////////////////////////////////////////////////////////////////////////////////////////////////
void passenger::initializePassenger(string _tmpIn, int _pathId){
string buf, tmpStr;
vector<string> tokens;
char chr[99];
passengerString = _tmpIn;
buf.clear();
tokens.clear();
stringstream ss1(_tmpIn);
while (ss1 >> buf){
tokens.push_back(buf);
}
passengerOriginTAZ = "t" + tokens[1];
passengerDestinationTAZ = "t" + tokens[2];
passengerMode = atoi(tokens[3].c_str());
passengerTimePeriod = atoi(tokens[4].c_str());
passengerTourHalf = atoi(tokens[5].c_str());
if(passengerTourHalf==1){
passengerPAT = atof(tokens[6].c_str());
if(passengerPAT<180){
passengerPAT = passengerPAT + 1440;
}
passengerPDT = 0;
}else{
passengerPDT = atof(tokens[6].c_str());
if(passengerPDT<180){
passengerPDT = passengerPDT + 1440;
}
passengerPAT = 1800;
}
passengerId = "p";
passengerId.append(tokens[0]);
passengerPathId = _pathId;
passengerStatus = -1;
experiencedCost = 999999;
startTime = -101;
}
string passenger::getPassengerString(){
return this->passengerString;
}
string passenger::getPassengerId(){
return this->passengerId;
}
string passenger::getOriginTAZ(){
return this->passengerOriginTAZ;
}
string passenger::getDestinationTAZ(){
return this->passengerDestinationTAZ;
}
double passenger::getPDT(){
return this->passengerPDT;
}
double passenger::getPAT(){
return this->passengerPAT;
}
int passenger::getTourHalf(){
return this->passengerTourHalf;
}
int passenger::getMode(){
return this->passengerMode;
}
void passenger::setAssignedPath(string _tmpPath){
assignedPath = _tmpPath;
}
string passenger::getAssignedPath(){
return this->assignedPath;
}
void passenger::setRandSeed() {
srand(this->passengerPathId);
}
int passenger::getTimePeriod(){
return this->passengerTimePeriod;
}
/////////////////////////////////////////////////////////////////////////////////////////////
void passenger::resetPathInfo(){
startTime = -101;
endTime = -101;
lengthOfPassengerTrip = 0;
boardingStops.clear();
trips.clear();
alightingStops.clear();
walkingTimes.clear();
passengerStatus = -1; //-1=not assigned, 0=assigned, 1=walking, 2=waiting, 3=on board, 4=missed, 5=arrived,
passengerPathIndex = 0;
experiencedArrivalTimes.clear();
experiencedBoardingTimes.clear();
experiencedAlightingTimes.clear();
experiencedPath = "";
//experiencedCost = 999999;
}
int passenger::initializePath(){
vector<string> tokens;
string buf, tmpPathString, tmpBoardingStops, tmpTrips, tmpAlightingStops, tmpWalkingTimes;
buf.clear();
tokens.clear();
tmpPathString = assignedPath;
stringstream ss(tmpPathString);
while (ss >> buf){
tokens.push_back(buf);
}
startTime = atof(tokens[0].c_str());
tmpBoardingStops = tokens[1];
tmpTrips = tokens[2];
tmpAlightingStops = tokens[3];
tmpWalkingTimes = tokens[4]; //cout<<tmpWalkingTimes<<endl;
//boardingStops.clear();
stringstream ss1(tmpBoardingStops);
while (getline(ss1, buf, ',')){
boardingStops.push_back(buf);
}
//trips.clear();
stringstream ss2(tmpTrips);
while (getline(ss2, buf, ',')){
trips.push_back(buf);
}
//alightingStops.clear();
stringstream ss3(tmpAlightingStops);
while (getline(ss3, buf, ',')){
alightingStops.push_back(buf);
}
//walkingTimes.clear();
stringstream ss4(tmpWalkingTimes);
while (getline(ss4, buf, ',')){
walkingTimes.push_back(atof(buf.c_str()));
}
lengthOfPassengerTrip = trips.size();
passengerPathIndex = 0;
//experiencedArrivalTimes.clear();
//experiencedBoardingTimes.clear();
//experiencedAlightingTimes.clear();
//experiencedPath = "";
//experiencedCost = 0;
//endTime = -101;
return lengthOfPassengerTrip;
}
int passenger::getPathIndex(){
return this->passengerPathIndex;
}
double passenger::getStartTime(){
return this->startTime;
}
void passenger::setPassengerStatus(int _status){
passengerStatus = _status;
}
int passenger::getPassengerStatus(){
return this->passengerStatus;
}
void passenger::increasePathIndex(){
passengerPathIndex = passengerPathIndex + 1;
}
void passenger::setEndTime(double _endTime){
endTime = _endTime;
}
string passenger::getCurrentBoardingStopId(){
if(passengerPathIndex<lengthOfPassengerTrip){
return this->boardingStops[passengerPathIndex];
}else{
return "-101";
}
}
string passenger::getCurrentTripId(){
if(passengerPathIndex<lengthOfPassengerTrip){
return this->trips[passengerPathIndex];
}else{
return "-101";
}
}
string passenger::getCurrentAlightingStopId(){
if(passengerPathIndex<lengthOfPassengerTrip){
return this->alightingStops[passengerPathIndex];
}else{
return "-101";
}
}
double passenger::getCurrentWalkingTime(){
return this->walkingTimes[passengerPathIndex];
}
void passenger::addArrivalTime(double _arrivalTime){
experiencedArrivalTimes.push_back(_arrivalTime);
}
void passenger::addBoardingTime(double _boardingTime){
experiencedBoardingTimes.push_back(_boardingTime);
}
void passenger::addAlightingTime(double _alightingTime){
experiencedAlightingTimes.push_back(_alightingTime);
}
double passenger::getArrivalTime(){
return this->experiencedArrivalTimes.back();
}
double passenger::getBoardingTime(){
return this->experiencedBoardingTimes.back();
}
double passenger::getAlightingTime(){
if(passengerPathIndex == 0){
return this->startTime;
}else{
return this->experiencedAlightingTimes.back();
}
}
string passenger::getExperiencedPath(){
int i;
string tmpExperiencedPath, tmpArrivalTimes, tmpBoardingTimes, tmpAlightingTimes;
char chr[99];
for(i=0;i<experiencedArrivalTimes.size();i++){
if(i!=0){
tmpArrivalTimes.append(",");
tmpBoardingTimes.append(",");
tmpAlightingTimes.append(",");
}
sprintf(chr,"%d",int(100*experiencedArrivalTimes[i])/100);
tmpArrivalTimes.append(string(chr));
tmpArrivalTimes.append(".");
if(int(100*experiencedArrivalTimes[i])%100<10) tmpArrivalTimes.append("0");
sprintf(chr,"%d",int(100*experiencedArrivalTimes[i])%100);
tmpArrivalTimes.append(string(chr));
sprintf(chr,"%d",int(100*experiencedBoardingTimes[i])/100);
tmpBoardingTimes.append(string(chr));
tmpBoardingTimes.append(".");
if(int(100*experiencedBoardingTimes[i])%100<10) tmpBoardingTimes.append("0");
sprintf(chr,"%d",int(100*experiencedBoardingTimes[i])%100);
tmpBoardingTimes.append(string(chr));
sprintf(chr,"%d",int(100*experiencedAlightingTimes[i])/100);
tmpAlightingTimes.append(string(chr));
tmpAlightingTimes.append(".");
if(int(100*experiencedAlightingTimes[i])%100<10) tmpAlightingTimes.append("0");
sprintf(chr,"%d",int(100*experiencedAlightingTimes[i])%100);
tmpAlightingTimes.append(string(chr));
}
tmpExperiencedPath = passengerId.substr(1,99);
tmpExperiencedPath.append("\t");
sprintf(chr,"%d",passengerMode);
tmpExperiencedPath.append(string(chr));
tmpExperiencedPath.append("\t");
tmpExperiencedPath.append(passengerOriginTAZ.substr(1,99));
tmpExperiencedPath.append("\t");
tmpExperiencedPath.append(passengerDestinationTAZ.substr(1,99));
tmpExperiencedPath.append("\t");
sprintf(chr,"%d",int(100*startTime)/100);
tmpExperiencedPath.append(string(chr));
tmpExperiencedPath.append(".");
if(int(100*startTime)%100<10) tmpExperiencedPath.append("0");
sprintf(chr,"%d",int(100*startTime)%100);
tmpExperiencedPath.append(string(chr));
tmpExperiencedPath.append("\t");
sprintf(chr,"%d",int(100*endTime)/100);
tmpExperiencedPath.append(string(chr));
tmpExperiencedPath.append(".");
if(int(100*endTime)%100<10) tmpExperiencedPath.append("0");
sprintf(chr,"%d",int(100*endTime)%100);
tmpExperiencedPath.append(string(chr));
tmpExperiencedPath.append("\t");
tmpExperiencedPath.append(tmpArrivalTimes);
tmpExperiencedPath.append("\t");
tmpExperiencedPath.append(tmpBoardingTimes);
tmpExperiencedPath.append("\t");
tmpExperiencedPath.append(tmpAlightingTimes);
return tmpExperiencedPath;
}
//For Available Capacity Definition
string passenger::getLastTripId(){
if(passengerPathIndex>0){
return this->trips[passengerPathIndex];
}else{
return "Access";
}
}
string passenger::getLastAlightingStop(){
if(passengerPathIndex>0){
return this->alightingStops[passengerPathIndex];
}else{
return "Origin";
}
}
///////////////////////////////////////////////
void passenger::calculateExperiencedCost(){
double tmpWaitingTime, tmpAccessWalkingTime, tmpEgressWalkingTime, tmpTransferWalkingTime, tmpInVehTime;
int tmpNumTransfers, i;
if(passengerStatus==5){ //-1=not assigned, 0=assigned, 1=walking, 2=waiting, 3=on board, 4=missed, 5=arrived,
tmpWaitingTime = 0;
tmpAccessWalkingTime = 0;
tmpEgressWalkingTime = 0;
tmpTransferWalkingTime = 0;
tmpInVehTime = 0;
tmpNumTransfers = trips.size() - 1;
for(i=0;i<trips.size();i++){
tmpWaitingTime = tmpWaitingTime + experiencedBoardingTimes[i] - experiencedArrivalTimes[i];
if(i>0){
tmpTransferWalkingTime = tmpTransferWalkingTime + experiencedArrivalTimes[i] - experiencedAlightingTimes[i-1];
}
tmpInVehTime = tmpInVehTime + experiencedAlightingTimes[i] - experiencedBoardingTimes[i];
}
experiencedCost = inVehTimeEqv*tmpInVehTime + waitingEqv*tmpWaitingTime + transferWalkEqv*tmpTransferWalkingTime
+ originWalkEqv*walkingTimes.front() + destinationWalkEqv*walkingTimes.back()
+ transferPenalty*tmpNumTransfers + (60.0*fare/VOT)*(tmpNumTransfers+1);
}else if(passengerStatus==4){
experiencedCost = 999999;
}else{
//cout <<passengerId<<"\tSTATUS = "<<passengerStatus<<endl;
}
}
double passenger::getExperiencedCost(){
return this->experiencedCost;
}
///////////////////////////////////////////////
void passenger::resetPaths(){
pathSet.clear();
}
void passenger::addPaths(string _tmpPath){
pathIter = pathSet.find(_tmpPath);
if (pathIter==pathSet.end())
pathSet[_tmpPath] = 1;
else{
pathSet[_tmpPath] = pathSet[_tmpPath] + 1;
}
}
void passenger::analyzePaths(bool trace){
//For Choice Set Attributes
int n;
string buf, buf2;
vector< vector<string> > tokens;
vector<string> tokens2;
vector<string> tmpTrips, tmpBoardings, tmpAlightings, tmpWalkings;
string tmpStartTime, tmpFromToAt;
double NTR, IWT, IVT, TRT, ACD, EGD, TRD, ScDelay, FARE, tmpUtility;
string routeComb, tripComb, transferComb; //transferComb for capacity constraints
if (trace) {
cout << "analyzePaths --- pathSet.size()=" << pathSet.size() << endl;
}
pathUtility.clear();
pathCapacity.clear();
pathCompatMap.clear();
for(pathIter=pathSet.begin();pathIter!=pathSet.end();pathIter++){
buf.clear();
tokens.clear();
stringstream ss((*pathIter).first);
while (ss >> buf){
stringstream ss2(buf);
buf2.clear();
tokens2.clear();
while (getline(ss2, buf2, ',')){
tokens2.push_back(buf2);
}
tokens.push_back(tokens2);
}
tmpStartTime = tokens[0][0];
tmpTrips = tokens[2];
tmpBoardings = tokens[1];
tmpAlightings = tokens[3];
tmpWalkings = tokens[4];
// lmz - do this to not drop precision
double start_time = tripSet[tmpTrips[0]]->getSchDepartureByStop(tmpBoardings[0]) - atof(tmpWalkings[0].c_str());
if (trace) {
cout << " pathIter=(\"" << pathIter->first << "\"," << pathIter->second << "), starttime=" << tmpStartTime << "; trips=[" ;
for (vector<string>::const_iterator si=tmpTrips.begin(); si != tmpTrips.end(); ++si) { cout << "'" << *si << "',"; }
cout << "]; boardings=[";
for (vector<string>::const_iterator si=tmpBoardings.begin(); si != tmpBoardings.end(); ++si) { cout << "'" << *si << "',"; }
cout << "]; alightings=[";
for (vector<string>::const_iterator si=tmpAlightings.begin(); si != tmpAlightings.end(); ++si) { cout << "'" << *si << "',"; }
cout << "]; walkings=[";
for (vector<string>::const_iterator si=tmpWalkings.begin(); si != tmpWalkings.end(); ++si) { cout << "'" << *si << "',"; }
cout << "], start_time=" << start_time << endl;
}
// lmz - do this to process paths in an order consistent with fast-trips
PathCompat path_compat;
if (passengerTourHalf==1) {
// origin to destination
for (int ind=0; ind < tmpBoardings.size(); ++ind) {
// boarding stop
path_compat.stops.push_back(atoi(tmpBoardings[ind].substr(1,tmpBoardings[ind].length()-1).c_str()));
path_compat.trips.push_back(atoi(tmpTrips[ind].substr(1,tmpTrips[ind].length()-1).c_str()));
// alighting stop/transfer if differs from next boarding
if (ind + 1 < tmpBoardings.size() && tmpAlightings[ind] != tmpBoardings[ind+1]) {
path_compat.stops.push_back(atoi(tmpAlightings[ind].substr(1,tmpAlightings[ind].length()-1).c_str()));
path_compat.trips.push_back(tmpTrips.size() > ind+1 ? -102 : -101); // transfer if more trips, or egress
}
}
} else {
// destination to origin
for (int ind = tmpAlightings.size()-1; ind >= 0; --ind) {
// alighting stop
path_compat.stops.push_back(atoi(tmpAlightings[ind].substr(1,tmpAlightings[ind].length()-1).c_str()));
path_compat.trips.push_back(atoi(tmpTrips[ind].substr(1,tmpTrips[ind].length()-1).c_str()));
// boarding stop/transfer if differs from next alighting
if (ind - 1 >= 0 && tmpBoardings[ind] != tmpAlightings[ind-1]) {
path_compat.stops.push_back(atoi(tmpBoardings[ind].substr(1,tmpBoardings[ind].length()-1).c_str()));
path_compat.trips.push_back(tmpTrips.size() > ind+1 ? -102 : -100); // transfer if more trips, or access
}
}
}
pathCompatMap[path_compat] = pathIter->first;
routeComb = "";
tripComb = "";
NTR = tmpTrips.size() - 1;
// IWT = tripSet[tmpTrips[0]]->getSchDepartureByStop(tmpBoardings[0]) - atof(tmpWalkings[0].c_str()) - atof(tmpStartTime.c_str());
// IWT = roundf(IWT * 100) / 100;
IWT = 0; // lmz - is this false sometimes?
IVT = 0;
TRT = 0;
ACD = atof(tmpWalkings[0].c_str());
EGD = atof(tmpWalkings[tmpWalkings.size()-1].c_str());
TRD = 0;
if(passengerTourHalf==1){
ScDelay = passengerPAT - passengerPAT; //should be fixed
}else{
// ScDelay = atof(tmpStartTime.c_str()) - passengerPDT;
ScDelay = start_time - passengerPDT;
}
FARE = 0;
pathCapacity[(*pathIter).first] = 1;
for (n=0;n<tmpTrips.size();n++){
if(routeComb==""){
routeComb = tripSet[tmpTrips[n]]->getRouteId().substr(1,99);
}else{
routeComb = routeComb + "," + tripSet[tmpTrips[n]]->getRouteId().substr(1,99);
}
if(tripComb==""){
tripComb = tmpTrips[n].substr(1,99);
}else{
tripComb = tripComb + "," + tmpTrips[n].substr(1,99);
}
IVT = IVT + tripSet[tmpTrips[n]]->getSchArrivalByStop(tmpAlightings[n]) - tripSet[tmpTrips[n]]->getSchDepartureByStop(tmpBoardings[n]);
if(tripSet[tmpTrips[n]]->getSchArrivalByStop(tmpAlightings[n]) - tripSet[tmpTrips[n]]->getSchDepartureByStop(tmpBoardings[n]) < 0){
cout <<tripSet[tmpTrips[n]]->getSchArrivalByStop(tmpAlightings[n]) - tripSet[tmpTrips[n]]->getSchDepartureByStop(tmpBoardings[n])<<endl;
}
// if transfers, then there will be 1 more walk segments than trips so the index works
if(n!=0){
TRT = TRT + tripSet[tmpTrips[n]]->getSchDepartureByStop(tmpBoardings[n]) - tripSet[tmpTrips[n-1]]->getSchArrivalByStop(tmpAlightings[n-1]) - atof(tmpWalkings[n].c_str());
TRD = TRD + atof(tmpWalkings[n].c_str());
}
FARE = FARE + 1.0;
if ((tripSet[tmpTrips[n]]->getRouteId()).length()>3 && (tripSet[tmpTrips[n]]->getRouteId()).substr(1,1)=="9") FARE = FARE + 1.50;
if(n==0){
tmpFromToAt = "Access," + tmpTrips[n] + "," + tmpBoardings[n];
if(availableCapacity2.find(tmpFromToAt)!=availableCapacity2.end()){
if(availableCapacity2[tmpFromToAt]==0){
pathCapacity[(*pathIter).first] = 0;
}
}
}else{
tmpFromToAt = tmpTrips[n-1] + "," + tmpAlightings[n-1] + "," + tmpTrips[n] + "," + tmpBoardings[n];
if(availableCapacity2.find(tmpFromToAt)!=availableCapacity2.end()){
if(availableCapacity2[tmpFromToAt]==0){
pathCapacity[(*pathIter).first] = 0;
}
}
}
}
// IVT = roundf(IVT * 100) / 100;
tmpUtility = inVehTimeEqv*IVT + waitingEqv*(IWT+TRT) + originWalkEqv*ACD + destinationWalkEqv*EGD + transferWalkEqv*TRD + transferPenalty*NTR + scheduleDelayEqv*ScDelay + 60*FARE/VOT;
// tmpUtility = roundf(tmpUtility * 100) / 100;
pathUtility[(*pathIter).first] = tmpUtility;
if (trace) {
cout << " IVT="<< IVT << "; IWT=" << IWT << "; TRT=" << TRT << "; ACD=" << ACD << "; EGD=" << EGD << "; TRD=" << TRD << "; NTR=" << NTR << "; scDelay=" << ScDelay << "; fare=" << FARE << endl;
cout << " pathUtility=" << tmpUtility << "; pathCapacity=" << pathCapacity[pathIter->first] << endl; }
//cout <<passengerId.substr(1,99)<<"\t"<<(*pathIter).second<<"\t"<<pathUtility[(*pathIter).first];
//cout <<"\t"<<NTR<<"\t"<<IWT<<"\t"<<IVT<<"\t"<<TRT<<"\t"<<ACD<<"\t"<<EGD<<"\t"<<TRD<<"\t"<<FARE<<endl;
}
}
string passenger::assignPath(bool trace){
int i, j, tmpAltProb, tmpMaxProb, tmpRandNum;
double tmpLogsum;
vector<string> tmpAlternatives;
vector<int> tmpAltProbabilities;
//If there is no path in the path set, skip
if(pathUtility.size()==0){
if(pathSet.size()==0){
//cout <<"NO ASSIGNED PATH"<<endl;
return "-101";
}else{
cout <<"PATH SET != PATH UTILITY"<<endl;
}
}
//Calculate the denominator of the logit model
i = 0;
tmpLogsum = 0;
for(pathIter2=pathUtility.begin();pathIter2!=pathUtility.end();pathIter2++){
if(pathCapacity[(*pathIter2).first]>0){
i++;
tmpLogsum = tmpLogsum + exp(-theta*(*pathIter2).second);
}
}
if(i==0){
//cout <<"i=0; ";
return "-101";
}
if(tmpLogsum==0){
cout <<"LOGSUM=0"<<endl;
return "-101";
}
//calculate the probability of each alternative
j=-1;
tmpMaxProb = 0;
// for(pathIter2=pathUtility.begin();pathIter2!=pathUtility.end();pathIter2++){
for (map<PathCompat, string, struct passenger::PathCompatCompare>::iterator cpi = pathCompatMap.begin(); cpi != pathCompatMap.end(); ++cpi){
string path_string = cpi->second;
if(pathCapacity[path_string]>0){
if (trace) {
cout << " prob " << std::setfill(' ') << std::setw(8) << (exp(-theta*pathUtility[path_string]))/tmpLogsum;
cout << " -> " << std::setw(8) << int(RAND_MAX*(exp(-theta*pathUtility[path_string]))/tmpLogsum);
cout << " cost " << std::setw(8) << pathUtility[path_string];
cout << " ==== " << path_string << endl;
}
tmpAltProb = int(RAND_MAX*(exp(-theta*pathUtility[path_string]))/tmpLogsum);
if(tmpAltProb < 1){
continue;
}
j++;
if(j>0) tmpAltProb = tmpAltProb + tmpAltProbabilities[j-1];
tmpAlternatives.push_back(path_string);
tmpAltProbabilities.push_back(tmpAltProb);
tmpMaxProb = tmpAltProb;
}
}
if(tmpMaxProb<1){
cout <<"MAXPROB=0"<<endl;
return "-101";
}
if (trace) {
for (j=0;j<tmpAlternatives.size();j++) {
cout << " j=" << j << "; prob=" << tmpAltProbabilities[j] << "; tmpAlternatives=" << tmpAlternatives[j] << endl;
}
}
//select an alternative
tmpRandNum = rand();
if (trace) { cout << " tmpRandNum=" << tmpRandNum << " -> " << tmpRandNum%tmpMaxProb << endl; }
tmpRandNum = tmpRandNum%tmpMaxProb;
for(j=0;j<tmpAlternatives.size();j++){
if(tmpRandNum <= tmpAltProbabilities[j]){
assignedPath = tmpAlternatives[j];
return tmpAlternatives[j];
}
}
//If nothing returned, return error!
cout <<"WHAT?"<<endl;
return "-101";
}