forked from ZDawang/TianChi_flyAI
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfly_AI_Summerwind.py
2456 lines (2292 loc) · 133 KB
/
fly_AI_Summerwind.py
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
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#!/usr/bin/python
# -*- coding: utf-8 -*-
#author : zhangdawang
#data:2017-7-9
import pandas as pd
import numpy as np
import pyexcel_xls
import datetime
import copy
import random
import warnings
warnings.filterwarnings("ignore")
#对excel表格中的数据进行处理
def GetOriginData(fileAddr):
excel_data = pyexcel_xls.get_data(fileAddr)
#["航班ID", "日期", "国际/国内", "航班号", "起飞机场", "降落机场", "起飞时间", "降落时间", "飞机ID", "机型", "重要系数"]
Flight = pd.DataFrame(excel_data['航班'][1:],
columns = ["flightId", "date", "isDomestic", "flightNo", "startAirport", "endAirport", "startDateTime", "endDateTime", "airplaneId", "airplaneType", "importRatio"])
#["起飞机场", "降落机场", "飞机ID"]
AirplaneLimitation = pd.DataFrame(excel_data['航线-飞机限制'][1:],
columns = ["startAirport", "endAirport", "airplaneId"])
#["机场", "关闭时间", "开放时间", "生效日期", "失效日期"]
AirportClose = pd.DataFrame(excel_data['机场关闭限制'][1:],
columns = ["airport", "beginCloseTime", "endCloseTime", "beginDate", "endDate"])
#["开始时间", "结束时间", "故障类型", "机场", "航班ID", "飞机ID"]
Scene = pd.DataFrame(excel_data['台风场景'][1:],
columns = ["startDateTime", "endDateTime", "type", "airport"])
#["机型", "起飞机场", "降落机场", "飞行时间"]
TravelTime = pd.DataFrame(excel_data['飞行时间'][1:],
columns = ["airplaneType", "startAirport", "endAirport", "travelTime"])
Scene = Scene.fillna(0)
#对航班进行飞机序号与开始时间的排序
Flight = Flight.sort_values(['airplaneId', 'startDateTime'])
Flight = Flight.reset_index(drop = True)
#excel的时间格式好像不标准
AirportClose['beginCloseTime'][1] = AirportClose['beginCloseTime'][1].time()
return Flight, AirplaneLimitation, AirportClose, Scene, TravelTime
#判断是否宵禁, False表示没有宵禁
def IsAirportClose(AirportCloseD, airport, DateTime):
if not airport in AirportCloseD:
return False
else:
for l in AirportCloseD[airport]:
if DateTime.time() > l[0] and DateTime.time() < l[1] and DateTime.date() >= l[2] and DateTime.date() <= l[3]:
return True
return False
#构建初始解
def GetInitialSolution(Flight, Scene, AirportCloseD, hour):
sceneportset = set(Scene['airport'])
Flight['isCancel'] = 0
affectedAirport = set(Scene['airport'])
delayD = {0: 0}
delayDcompare = {0: 0}
#确定哪些航班需要取消, 1是因为不能飞，2是因为不能降
for i in Flight.index:
if Flight['startAirport'][i] in affectedAirport:
#prepareTime = min(datetime.timedelta(minutes = 50), Flight['startDateTime'][i] - Flight['endDateTime'][i - 1])
if Flight['startDateTime'][i] > Scene[Scene['airport'] == Flight['startAirport'][i]][Scene['type'] == "起飞"]['startDateTime'].iloc[0]\
and Flight['startDateTime'][i] < Scene[Scene['airport'] == Flight['startAirport'][i]][Scene['type'] == "起飞"]['endDateTime'].iloc[0]:
Flight['isCancel'][i] = 1
elif Flight['endAirport'][i] in affectedAirport:
if Flight['endDateTime'][i] > Scene[Scene['airport'] == Flight['endAirport'][i]][Scene['type'] == "降落"]['startDateTime'].iloc[0]\
and Flight['endDateTime'][i] < Scene[Scene['airport'] == Flight['endAirport'][i]][Scene['type'] == "降落"]['endDateTime'].iloc[0]:
Flight['isCancel'][i] = 2
DomesticJoint = {}
l = 0
for i in Flight.index:
if i == 2363:
continue
if Flight['isCancel'][i] != 0 or Flight['isCancel'][i + 1] != 0:
if not Flight['isDomestic'][i] == "国内":
continue
if Flight['date'][i] == Flight['date'][i + 1] and Flight['flightNo'][i] == Flight['flightNo'][i + 1]:
if Flight['endAirport'][i] in sceneportset:
DomesticJoint[Flight['flightId'][i]] = Flight['flightId'][i + 1]
#找出可以提前的航班,将其变为可飞
FlightDismissList = []
done = 0
airplaneNow = 0
for i in Flight.index:
if Flight['airplaneId'][i] != airplaneNow:
done = 0
airplaneNow = Flight['airplaneId'][i]
elif done == 0:
#提前无法起飞的飞机
if Flight['isCancel'][i] == 1 and Flight['isDomestic'][i] == "国内":
startTime = Scene[Scene['airport'] == Flight['startAirport'][i]][Scene['type'] == "起飞"]['startDateTime'].iloc[0]
advancedTime = Flight['startDateTime'][i] - startTime
if advancedTime <= datetime.timedelta(hours = 6) and Flight['endDateTime'][i - 1] + datetime.timedelta(minutes = 50) <= Flight['startDateTime'][i] - advancedTime:
#print(Flight['airplaneId'][i], Flight['flightId'][i])
Flight['isCancel'][i] = 0
#delayD[Flight['flightId'][i]] = - advancedTime
Flight['startDateTime'][i] = Flight['startDateTime'][i] - advancedTime
Flight['endDateTime'][i] = Flight['endDateTime'][i] - advancedTime
Flight['importRatio'][i] = Flight['importRatio'][i] * (1 - 0.15 * advancedTime / datetime.timedelta(hours = 1))
done = 1
elif advancedTime <= datetime.timedelta(hours = 6) and Flight['endDateTime'][i - 1] + datetime.timedelta(minutes = 50) > Flight['startDateTime'][i] - advancedTime:
#delayD[Flight['flightId'][i]] = - advancedTime
if Flight['date'][i] == Flight['date'][i - 1] and Flight['flightNo'][i] == Flight['flightNo'][i - 1]:
continue
if Flight['date'][i] == Flight['date'][i + 1] and Flight['flightNo'][i] == Flight['flightNo'][i + 1]:
if not (Flight['startAirport'][i + 1] in sceneportset or Flight['endAirport'][i + 1] in sceneportset):
continue
Flight['startDateTime'][i] = Flight['startDateTime'][i] - advancedTime
Flight['endDateTime'][i] = Flight['endDateTime'][i] - advancedTime
Flight['importRatio'][i] = Flight['importRatio'][i] * (1 - 0.15 * advancedTime / datetime.timedelta(hours = 1))
FlightDismissList.append([[airplaneNow, Flight['airplaneType'][i], 0, 0], [Flight['flightId'][i]]])
# #停机限制，将机场无法起飞的飞机前一航班取消
# airplaneNow = 0
# for i in Flight.index:
# if Flight['airplaneId'][i] != airplaneNow:
# airplaneNow = Flight['airplaneId'][i]
# else:
# if Flight['isCancel'][i] == 1 and Flight['isCancel'][i - 1] == 0:
# Flight['isCancel'][i - 1] = 3
Flight = Flight.sort_values(['airplaneId', 'startDateTime'])
Flight = Flight.reset_index(drop = True)
#找出可以推迟的航班，将其变为可飞, 推迟时间为xh,仅将那些推迟后不会宵禁的航班串推迟,包括无法降落或者无法起飞的飞机
airplaneNow = 0
delayhours = hour
for i in Flight.index:
index = 0
if Flight['airplaneId'][i] != airplaneNow:
airplaneNow = Flight['airplaneId'][i]
else:
if Flight['isCancel'][i] == 0 and (Flight['startAirport'][i] in set(Scene['airport'])):
comparetime = Scene[Scene['airport'] == Flight['startAirport'][i]][Scene['type'] == "起飞"]['endDateTime'].iloc[0]
delaytime = datetime.timedelta(minutes = 50) + comparetime - Flight['startDateTime'][i]
if delaytime > datetime.timedelta(minutes = 0) and delaytime <= datetime.timedelta(minutes = 50):
#首先判断是否有宵禁取消航班
j = i
index = 0
delaytimecopy = delaytime
while(Flight['airplaneId'][j] == airplaneNow):
starttime = Flight['startDateTime'][j] + delaytimecopy
endtime = Flight['endDateTime'][j] + delaytimecopy
delaytimecopy = max(datetime.timedelta(minutes = 0), delaytimecopy - max(datetime.timedelta(minutes = 0), Flight['startDateTime'][j + 1] - Flight['endDateTime'][j] - datetime.timedelta(minutes = 50)))
if IsAirportClose(AirportCloseD, Flight['startAirport'][j], starttime) or IsAirportClose(AirportCloseD, Flight['endAirport'][j], endtime):
index = 1
break
j += 1
#若没有宵禁取消航班
if index == 0:
j = i
while(Flight['airplaneId'][j] == airplaneNow):
delayD[Flight['flightId'][j]] = delaytime
starttime = Flight['startDateTime'][j] + delaytime
endtime = Flight['endDateTime'][j] + delaytime
delaytime = max(datetime.timedelta(minutes = 0), delaytime - max(datetime.timedelta(minutes = 0), Flight['startDateTime'][j + 1] - Flight['endDateTime'][j] - datetime.timedelta(minutes = 50)))
#print(Flight['flightId'][j], Flight['airplaneId'][j])
Flight['isCancel'][j] = 0
Flight['startDateTime'][j] = starttime
Flight['endDateTime'][j] = endtime
j += 1
else:
Flight['isCancel'][i] = 4
else:
delaytime = datetime.timedelta(hours = delayhours + 1)
if Flight['isCancel'][i] == 1:
endtime = Scene[Scene['airport'] == Flight['startAirport'][i]][Scene['type'] == "起飞"]['endDateTime'].iloc[0]
delaytime = datetime.timedelta(minutes = 50) + endtime - Flight['startDateTime'][i]
if Flight['isCancel'][i] == 2:
delaytime = Scene[Scene['airport'] == Flight['endAirport'][i]][Scene['type'] == "降落"]['endDateTime'].iloc[0]- Flight['startDateTime'][i]
if delaytime <= datetime.timedelta(hours = delayhours):
#首先判断是否有宵禁取消航班
j = i
index = 0
delaytimecopy = delaytime
while(Flight['airplaneId'][j] == airplaneNow):
starttime = Flight['startDateTime'][j] + delaytimecopy
endtime = Flight['endDateTime'][j] + delaytimecopy
delaytimecopy = max(datetime.timedelta(minutes = 0), delaytimecopy - max(datetime.timedelta(minutes = 0), Flight['startDateTime'][j + 1] - Flight['endDateTime'][j] - datetime.timedelta(minutes = 50)))
if IsAirportClose(AirportCloseD, Flight['startAirport'][j], starttime) or IsAirportClose(AirportCloseD, Flight['endAirport'][j], endtime):
index = 1
break
j += 1
#若没有宵禁取消航班
if index == 0:
j = i
while(Flight['airplaneId'][j] == airplaneNow):
delayD[Flight['flightId'][j]] = delaytime
if Flight['isCancel'][j] != 0:
if Flight['startAirport'][j] in sceneportset:
delayDcompare[Flight['flightId'][j]] = Scene.ix[0][1] + datetime.timedelta(minutes = 50) - Flight['startDateTime'][j]
else:
delayDcompare[Flight['flightId'][j]] = Scene.ix[0][1] - Flight['endDateTime'][j]
starttime = Flight['startDateTime'][j] + delaytime
endtime = Flight['endDateTime'][j] + delaytime
delaytime = max(datetime.timedelta(minutes = 0), delaytime - max(datetime.timedelta(minutes = 0), Flight['startDateTime'][j + 1] - Flight['endDateTime'][j] - datetime.timedelta(minutes = 50)))
#print(Flight['flightId'][j], Flight['airplaneId'][j])
Flight['isCancel'][j] = 0
Flight['startDateTime'][j] = starttime
Flight['endDateTime'][j] = endtime
j += 1
#找出航班是否为联程航班
JointD = {}
k = 2
for i in Flight[Flight['isCancel'] == 0].index:
if (Flight['date'][i], Flight['flightNo'][i]) in JointD:
JointD[(Flight['date'][i], Flight['flightNo'][i])] = k
k += 1
else:
JointD[(Flight['date'][i], Flight['flightNo'][i])] = 0
JoinD_cancel = {}
for i in Flight[Flight['isCancel'] != 0].index:
if (Flight['date'][i], Flight['flightNo'][i]) in JoinD_cancel:
JoinD_cancel[(Flight['date'][i], Flight['flightNo'][i])].append(Flight["flightId"][i])
else:
JoinD_cancel[(Flight['date'][i], Flight['flightNo'][i])] = [Flight["flightId"][i]]
Flight = Flight.sort_values(['airplaneId', 'startDateTime'])
Flight = Flight.reset_index(drop = True)
#构建飞行航班字典
#飞行航班字典，里面包含航班的前一个航班的最晚到达时间，是否为联程航班，起始时间，到达时间，起始机场，到达机场, 重要系数
FlightD = {}
airplaneNow = 0
isJoint = 0
starttimes = []
endtimes = []
for i in Flight.index:
isJoint = JointD.get((Flight['date'][i], Flight['flightNo'][i]), 1)
canceljointflight = JoinD_cancel.get((Flight['date'][i], Flight['flightNo'][i]), []).copy()
if len(canceljointflight) == 2:
canceljointflight.remove(Flight["flightId"][i])
else:
canceljointflight = [0]
if Flight['airplaneId'][i] != airplaneNow:
needArriveTime = Flight['startDateTime'][i] - datetime.timedelta(minutes = 50)
starttimes.append(Flight['startDateTime'][i] - delayD.get(Flight['flightId'][i], datetime.timedelta(minutes = 0)))
endtimes.append(Flight['endDateTime'][i] - delayD.get(Flight['flightId'][i], datetime.timedelta(minutes = 0)))
FlightD[Flight['flightId'][i]] = [needArriveTime, isJoint] + [starttimes[-1], endtimes[-1]] +list(Flight.ix[i][['startAirport', 'endAirport', 'importRatio', 'airplaneType', 'isCancel']]) + canceljointflight + [0]
airplaneNow = Flight['airplaneId'][i]
else:
needArriveTime = max(Flight['startDateTime'][i] - datetime.timedelta(minutes = 50), Flight['endDateTime'][i - 1])
starttimes.append(Flight['startDateTime'][i] - delayD.get(Flight['flightId'][i], datetime.timedelta(minutes = 0)))
endtimes.append(Flight['endDateTime'][i] - delayD.get(Flight['flightId'][i], datetime.timedelta(minutes = 0)))
FlightD[Flight['flightId'][i]] = [needArriveTime, isJoint] + [starttimes[-1], endtimes[-1]] + list(Flight.ix[i][['startAirport', 'endAirport', 'importRatio', 'airplaneType', 'isCancel']]) + canceljointflight + [0]
Flight['startDateTime'] = starttimes
Flight['endDateTime'] = endtimes
#可执行航班,包含正常航班与初始解中去除必取消的航班
#正常航班包括：[使用飞机号，飞机类型, 飞机当前机场, 包含尾串数量]，[航班串或者航班环]
#取消航班包括: [原使用飞机号，原使用飞机类型, 是否为尾班]， [航班串或者航班环]
FlightExecuteList = []
airplaneNow = 0
dismiss = 0
ferryFlightNum = 0
initialCost = 0
dimisscost = 0
for i in Flight.index:
if Flight['isCancel'][i] != 0:
dimisscost += Flight['importRatio'][i] * 1000
for i in Flight.index:
if Flight['isCancel'][i] != 0:
initialCost += Flight['importRatio'][i] * 1000
#换飞机时
if Flight['airplaneId'][i] != airplaneNow:
#如果dismiss为0，也就是都没有取消
if dismiss == 0 and i != 0:
FlightExecuteList[-1][0][3] = 1
#判断是否是尾班
if FlightDismissList and FlightDismissList[-1][0][0] == airplaneNow:
ferryFlightNum += 1
FlightDismissList[-1][0][2] = 1
FlightDismissList[-1][0][3] = Flight['endAirport'][i - 1]
if Flight['isCancel'][i] != 0:
airplaneNow = Flight['airplaneId'][i]
dismiss = 1
FlightExecuteList.append([[airplaneNow, Flight['airplaneType'][i], Flight['startAirport'][i], 0], []])
else:
airplaneNow = Flight['airplaneId'][i]
dismiss = 0
FlightExecuteList.append([[airplaneNow, Flight['airplaneType'][i], Flight['startAirport'][i], 0], [Flight['flightId'][i]]])
else:
if dismiss == 0:
if Flight['isCancel'][i] != 0:
dismiss = 1
else:
FlightExecuteList[-1][1].append(Flight['flightId'][i])
else:
if Flight['isCancel'][i] == 0 and Flight['isCancel'][i - 1] == 0:
FlightDismissList[-1][1].append(Flight['flightId'][i])
initialCost += Flight['importRatio'][i] * 1000
elif Flight['isCancel'][i] == 0:
FlightDismissList.append([[airplaneNow, Flight['airplaneType'][i], 0, 0], [Flight['flightId'][i]]])
initialCost += Flight['importRatio'][i] * 1000
FlightDismissList[-1][0][2] = 1
print("Dismiss flight number is:", Flight[Flight['isCancel'] != 0].shape[0])
print("Dismiss cost is:", dimisscost)
#计算初始费用, 提前航班的暂时不计
initialCost += ferryFlightNum * 5000
print("Initial Answer Has done, cost: ", initialCost)
return FlightD, FlightExecuteList, FlightDismissList, initialCost, delayD, Flight, DomesticJoint, delayDcompare
#得到国内航班集合, 飞行时间字典，航线飞机限制集合
def GetSets(Flight, TravelTime, AirplaneLimitation, AirportClose):
DomesticSet = set()
for i in Flight.index:
if Flight['isDomestic'][i] == "国内":
DomesticSet.add(Flight['startAirport'][i])
DomesticSet.add(Flight['endAirport'][i])
FlytimeD = {}
for i in TravelTime.index:
FlytimeD[tuple(TravelTime.ix[i][["airplaneType", "startAirport", "endAirport"]])] = TravelTime['travelTime'][i]
AirplaneLimit = set()
for i in AirplaneLimitation.index:
AirplaneLimit.add(tuple(AirplaneLimitation.ix[i]))
AirportCloseD = {}
for i in AirportClose.index:
if AirportClose['airport'][i] in AirportCloseD:
AirportCloseD[AirportClose['airport'][i]].append(list(AirportClose.ix[i][1:]))
else:
AirportCloseD[AirportClose['airport'][i]] = [list(AirportClose.ix[i])[1:]]
#AirportCloseD[6][0][0] = AirportCloseD[6][0][0].time()
return DomesticSet, FlytimeD, AirplaneLimit, AirportCloseD
#转换时间格式，用于生成最终结果用
def transTime(time):
str_minute = "0" + str(time.minute)
return str(time.year) + "/" + str(time.month) + "/" + str(time.day) + " " + str(time.hour) + ":" + str_minute[-2:]
#根据EF与DF生成结果
def generateResult(Flight):
Flight['isFerry'] = 0
ResultFlight = Flight[['flightId', 'startAirport', 'endAirport', 'startDateTime', 'endDateTime', 'airplaneId', 'isCancel', 'isStraight', 'isFerry']]
startDateTime = []
endDateTime = []
isFerry = []
isCancel = []
for i in ResultFlight.index:
if i%1000 == 0:
print("transhasdone:", i)
startDateTime.append(transTime(Flight['startDateTime'][i]))
endDateTime.append(transTime(Flight['endDateTime'][i]))
if ResultFlight['flightId'][i] > 2364:
isFerry.append(1)
else:
isFerry.append(0)
if Flight['isCancel'][i] != 0:
isCancel.append(1)
else:
isCancel.append(0)
ResultFlight['startDateTime'] = startDateTime
ResultFlight['endDateTime'] = endDateTime
ResultFlight['isCancel'] = isCancel
ResultFlight['isFerry'] = isFerry
return ResultFlight
#return ResultFlight[['flightId', 'startAirport', 'endAirport', 'startDateTime', 'endDateTime', 'airplaneId', 'isCancel', 'isStraight', 'isFerry']]
#**************************************************
#获得一个航班列表中的航班环
def findFlightCycle(FlightD, FlightList):
if not FlightList:
return []
#所有起始机场，与最后一班的结束机场
startport = []
FlightCycle = []
for flight in FlightList:
startport.append(FlightD[flight][4])
startport.append(FlightD[FlightList[-1]][5])
#寻找所有子串
dport = {}
for i in range(len(startport)):
if startport[i] in dport:
dport[startport[i]].append(i)
else:
dport[startport[i]] = [i]
for key in dport:
temp = dport[key]
ltemp = len(temp)
if ltemp < 2:
continue
else:
for i in range(ltemp):
for j in range(ltemp - 1, i, -1):
if temp[j] - temp[i] >= 2:
FlightCycle.append(FlightList[temp[i]: temp[j]])
return FlightCycle
#获得两个航班列表中，具有相同起始机场与结束机场的航班串
def findSameStartEnd(FlightD, FlightList1, FlightList2):
if not FlightList1 or not FlightList2:
return []
#所有起始机场，与最后一班的结束机场
startports1 = []
for flight in FlightList1:
startports1.append(FlightD[flight][4])
startports1.append(FlightD[FlightList1[-1]][5])
startports2 = []
for flight in FlightList2:
startports2.append(FlightD[flight][4])
startports2.append(FlightD[FlightList2[-1]][5])
l1, l2 = len(startports1), len(startports2)
d1 = {}
for i in range(l1):
for j in range(i + 1, l1):
if (startports1[i], startports1[j]) in d1:
d1[(startports1[i], startports1[j])].append([i, j])
else:
d1[(startports1[i], startports1[j])] = [[i, j]]
d2 = {}
for i in range(l2):
for j in range(i + 1, l2):
if (startports2[i], startports2[j]) in d2:
d2[(startports2[i], startports2[j])].append([i, j])
else:
d2[(startports2[i], startports2[j])] = [[i, j]]
res = []
for key in d1:
if key in d2:
for list1 in d1[key]:
for list2 in d2[key]:
res.append([list1, list2])
return res
#寻找两个航班列表中，具有相同起始机场的航班尾串
def findSameStartport(FlightD, FlightList1, FlightList2):
if not FlightList1 or not FlightList2:
return []
l1, l2 = len(FlightList1), len(FlightList2)
startports1 = {}
for i in range(l1):
port = FlightList1[i]
if FlightD[port][4] in startports1:
startports1[FlightD[port][4]].append(i)
else:
startports1[FlightD[port][4]] = [i]
res = []
for j in range(l2):
port = FlightD[FlightList2[j]][4]
if port in startports1:
for i in startports1[port]:
res.append([i, j])
return res
#当航班列表中有不满足飞机-航线限制时，返回True
def IsAirLimit(airplaneId, FlightList, FlightD, AirplaneLimit):
for flight in FlightList:
if (FlightD[flight][4], FlightD[flight][5], airplaneId) in AirplaneLimit:
return True
return False
#0代表起飞，1代表降落
def IsTimeSameRange(time1, time2, mode, Scene):
if time1 >= Scene.ix[0][1] and time2 >= Scene.ix[0][1]:
return True
if time1 <= Scene.ix[1][0] and time2 <= Scene.ix[1][0]:
return True
return False
#判断一个航班串延迟一段时间是否可以运行
def GetNewDelayD(delaytime, FlightList1, delayD, FlightD, AirportCloseD, Scene):
sceneportset = set(Scene['airport'])
delayDcopy = delayD.copy()
if delaytime <= datetime.timedelta(minutes = 0):
return delayDcopy
delaytimecopy = delaytime
l = len(FlightList1)
for i in range(l):
delayDcopy[FlightList1[i]] = delayDcopy.get(FlightList1[i], datetime.timedelta(minutes = 0)) + delaytimecopy
delaytimecopy = delayDcopy[FlightList1[i]]
starttime = FlightD[FlightList1[i]][2] + delaytimecopy
endtime = FlightD[FlightList1[i]][3] + delaytimecopy
if i != l - 1:
delaytimecopy = max(datetime.timedelta(minutes = 0), delaytimecopy - max(datetime.timedelta(minutes = 0), FlightD[FlightList1[i + 1]][2] - FlightD[FlightList1[i]][3] - datetime.timedelta(minutes = 50)))
if IsAirportClose(AirportCloseD, FlightD[FlightList1[i]][4], starttime) or IsAirportClose(AirportCloseD, FlightD[FlightList1[i]][5], endtime):
return {}
if FlightD[FlightList1[i]][5] in sceneportset and endtime > Scene.ix[0][0] and endtime < Scene.ix[0][1]:
return {}
return delayDcopy
#GRASP算法的一次操作，算法的最核心部分
def GRASPOnce(FlightExecuteList, FlightDismissList, initialCost, delayD, FlightD, AirplaneLimit, Scene, num, FlyD, FlyDEnable, DownEnable, delayMaxhour, delayDcompare, AirportCloseD, Israndom):
sceneportset = set(Scene['airport'])
DownRCL = []
UpRCL = []
minTime = datetime.datetime(2000, 1, 1, 1, 1)
maxTime = datetime.datetime(2100, 1, 1, 1, 1)
Down_index = 0
Up_index = 0
if DownEnable == 1:
#EFandDF
l_FE = len(FlightExecuteList)
EFindexlist = [i for i in range(l_FE)]
i = -1
while(1):
if Israndom == 1:
if not (EFindexlist and Down_index == 0):
break
else:
i_index = random.randint(0, len(EFindexlist) - 1)
i = EFindexlist[i_index]
EFindexlist.remove(i)
else:
i += 1
if i == l_FE:
break
ef = FlightExecuteList[i]
lef = len(ef[1])
eflightcycle = findFlightCycle(FlightD, ef[1])
#判断ef的延迟是否可减少
NewdelayD = delayD.copy()
for j in range(1, lef):
f = ef[1][j]
frontf = ef[1][j - 1]
delaytime = FlightD[f][2] + NewdelayD.get(f, datetime.timedelta(minutes = 0)) - (FlightD[frontf][3] + NewdelayD.get(frontf, datetime.timedelta(minutes = 0))) - datetime.timedelta(minutes = 50)
if delaytime <= datetime.timedelta(minutes = 0):
continue
if NewdelayD.get(f, datetime.timedelta(minutes = 0)) == datetime.timedelta(minutes = 0):
continue
time = max(delayDcompare.get(f, datetime.timedelta(minutes = 0)), max(datetime.timedelta(minutes = 0), NewdelayD.get(f, datetime.timedelta(minutes = 0)) - delaytime))
if IsAirportClose(AirportCloseD, FlightD[f][4], time + FlightD[f][2]) or IsAirportClose(AirportCloseD, FlightD[f][5], time + FlightD[f][3]):
continue
NewdelayD[f] = time
newsubcost = 0
for j in range(1, lef):
f = ef[1][j]
newsubcost += FlightD[f][6] * 100 * ((delayD.get(f, datetime.timedelta(minutes = 0)) - NewdelayD.get(f, datetime.timedelta(minutes = 0))) / datetime.timedelta(hours = 1))
newcost = initialCost - newsubcost
if newcost < initialCost:
NewFlightExecuteList = copy.deepcopy(FlightExecuteList)
NewFlightDismissList = copy.deepcopy(FlightDismissList)
l = 0
Down_index = 1
DownRCL.append([newcost, NewFlightExecuteList, NewFlightDismissList, NewdelayD, l])
#当调整完以后
if FlyDEnable == 1:
for j in range(lef):
f_startport = FlightD[ef[1][j]][4]
#ef的一个航班串替换为FlyD的航班串
for k in range(j + 1, lef):
f_endport = FlightD[ef[1][k]][5]
solute = copy.deepcopy(FlyD.get((f_startport, f_endport, ef[0][1]), []))
for s in solute:
fset = []
for h in s:
fset = fset + FlightDismissList[h][1]
#若不满足时间限制(最多延迟x小时)
if j != 0:
delaytime = FlightD[ef[1][j - 1]][3] + delayD.get(ef[1][j - 1], datetime.timedelta(minutes = 0)) - (FlightD[fset[0]][2] + delayD.get(fset[0], datetime.timedelta(minutes = 0)) - datetime.timedelta(minutes = 50))
if delaytime > datetime.timedelta(hours = delayMaxhour):
continue
NewdelayD = GetNewDelayD(delaytime, fset, delayD, FlightD, AirportCloseD, Scene)
if not NewdelayD:
continue
else:
NewdelayD = delayD.copy()
#将ef推迟
if k != lef - 1:
efdelaytime = FlightD[fset[-1]][3] + NewdelayD.get(fset[-1], datetime.timedelta(minutes = 0)) + datetime.timedelta(minutes = 50) - (FlightD[ef[1][k + 1]][2] + NewdelayD.get(ef[1][k + 1], datetime.timedelta(minutes = 0)))
if efdelaytime > datetime.timedelta(hours = delayMaxhour):
continue
NewdelayD = GetNewDelayD(efdelaytime, ef[1][k + 1:], NewdelayD, FlightD, AirportCloseD, Scene)
if not NewdelayD:
continue
#若不满足飞机-航线限制
if IsAirLimit(ef[0][0], fset, FlightD, AirplaneLimit):
continue
#若不满足联程航班限制
if j != 0 and (FlightD[ef[1][j]][1] != 0 and FlightD[ef[1][j]][1] == FlightD[ef[1][j - 1]][1]):
continue
if k != lef - 1 and (FlightD[ef[1][k + 1]][1] != 0 and FlightD[ef[1][k + 1]][1] == FlightD[ef[1][k]][1]):
continue
#若不满足中间台风机场不能停机限制
if FlightD[ef[1][j]][4] in sceneportset and not IsTimeSameRange(FlightD[ef[1][j]][2] + NewdelayD.get(ef[1][j], datetime.timedelta(minutes = 0)), FlightD[fset[0]][2] + NewdelayD.get(fset[0], datetime.timedelta(minutes = 0)), 0, Scene):
continue
if FlightD[ef[1][k]][5] in sceneportset and not IsTimeSameRange(FlightD[ef[1][k]][3] + NewdelayD.get(ef[1][k], datetime.timedelta(minutes = 0)), FlightD[fset[-1]][3] + NewdelayD.get(fset[-1], datetime.timedelta(minutes = 0)), 1, Scene):
continue
#计算成本
newsubcost = 0
for f in fset:
if FlightD[f][7] == ef[0][1]:
newsubcost += FlightD[f][6] * 1000
newsubcost -= FlightD[f][6] * 100 * (NewdelayD.get(f, datetime.timedelta(minutes = 0)) / datetime.timedelta(hours = 1))
for f in ef[1][j: k + 1]:
if FlightD[f][7] == ef[0][1]:
newsubcost -= FlightD[f][6] * 1000
newsubcost += FlightD[f][6] * 100 * (NewdelayD.get(f, datetime.timedelta(minutes = 0)) / datetime.timedelta(hours = 1))
for f in ef[1][k + 1:]:
newsubcost -= FlightD[f][6] * 100 * (NewdelayD.get(f, datetime.timedelta(minutes = 0) - delayD.get(f, datetime.timedelta(minutes = 0))) / datetime.timedelta(hours = 1))
newcost = initialCost - newsubcost
if newcost < initialCost:
#构造新解
NewFlightExecuteList = copy.deepcopy(FlightExecuteList)
NewFlightDismissList = copy.deepcopy(FlightDismissList)
newef = ef[1].copy()
newef = ef[1][:j] + fset + ef[1][k + 1:]
for h in s:
NewFlightDismissList[h][1] = []
NewFlightExecuteList[i][1] = newef
#把ef[1][j]放入df中
eftmp = ef[1][j: k + 1]
if j != 0 and (FlightD[ef[1][j]][1] != 0 and FlightD[ef[1][j]][1] == FlightD[ef[1][j - 1]][1]):
eftmp = eftmp[1:]
if k != lef - 1 and (FlightD[ef[1][k + 1]][1] != 0 and FlightD[ef[1][k + 1]][1] == FlightD[ef[1][k]][1]):
eftmp = eftmp[:-1]
NewFlightDismissList.append([[ef[0][0], ef[0][1], 0, 0], eftmp])
l = len(newef) - len(ef[1])
DownRCL.append([newcost, NewFlightExecuteList, NewFlightDismissList, NewdelayD, l])
#航班环插入中间及尾部
f_endport = FlightD[ef[1][j]][5]
solute = copy.deepcopy(FlyD.get((f_endport, f_endport, ef[0][1]), []))
for s in solute:
fset = []
for k in s:
fset = fset + FlightDismissList[k][1]
#若不满足时间限制
delaytime = FlightD[ef[1][j]][3] + delayD.get(ef[1][j], datetime.timedelta(minutes = 0)) - (FlightD[fset[0]][2] + delayD.get(fset[0], datetime.timedelta(minutes = 0)) - datetime.timedelta(minutes = 50))
if delaytime > datetime.timedelta(hours = delayMaxhour):
continue
NewdelayD = GetNewDelayD(delaytime, fset, delayD, FlightD, AirportCloseD, Scene)
if not NewdelayD:
continue
if j != lef - 1:
efdelaytime = FlightD[fset[-1]][3] + NewdelayD.get(fset[-1], datetime.timedelta(minutes = 0)) + datetime.timedelta(minutes = 50) - (FlightD[ef[1][j + 1]][2] + NewdelayD.get(ef[1][j + 1], datetime.timedelta(minutes = 0)))
if efdelaytime > datetime.timedelta(hours = delayMaxhour):
continue
NewdelayD = GetNewDelayD(efdelaytime, ef[1][j + 1:], NewdelayD, FlightD, AirportCloseD, Scene)
if not NewdelayD:
continue
#若不满足飞机-航线限制
if IsAirLimit(ef[0][0], fset, FlightD, AirplaneLimit):
continue
#若不满足联程航班限制
if j != lef - 1 and (FlightD[ef[1][j]][1] != 0 and FlightD[ef[1][j + 1]][1] == FlightD[ef[1][j]][1]):
continue
#若不满足中间台风机场不能停机限制
if FlightD[ef[1][j]][5] in sceneportset and (not IsTimeSameRange(FlightD[ef[1][j]][3] + NewdelayD.get(ef[1][j], datetime.timedelta(minutes = 0)) , FlightD[fset[0]][2] + NewdelayD.get(fset[0], datetime.timedelta(minutes = 0)), 0, Scene)) and (not IsTimeSameRange(FlightD[ef[1][j]][3] + NewdelayD.get(ef[1][j], datetime.timedelta(minutes = 0)), FlightD[fset[-1]][3] + NewdelayD.get(fset[-1], datetime.timedelta(minutes = 0)), 0, Scene)):
continue
#计算成本
newsubcost = 0
for f in fset:
if FlightD[f][7] == ef[0][1]:
newsubcost += FlightD[f][6] * 1000
newsubcost -= FlightD[f][6] * 100 * (NewdelayD.get(f, datetime.timedelta(minutes = 0)) / datetime.timedelta(hours = 1))
for f in ef[1][j + 1:]:
newsubcost -= FlightD[f][6] * 100 * (NewdelayD.get(f, datetime.timedelta(minutes = 0) - delayD.get(f, datetime.timedelta(minutes = 0))) / datetime.timedelta(hours = 1))
newcost = initialCost - newsubcost
if newcost < initialCost:
#构造新解
NewFlightExecuteList = copy.deepcopy(FlightExecuteList)
NewFlightDismissList = copy.deepcopy(FlightDismissList)
newef = ef[1].copy()
newef = ef[1][:j + 1] + fset + ef[1][j + 1:]
for k in s:
NewFlightDismissList[k][1] = []
NewFlightExecuteList[i][1] = newef
Down_index = 1
l = len(newef) - len(ef[1])
DownRCL.append([newcost, NewFlightExecuteList, NewFlightDismissList, NewdelayD, l])
# 换尾串
# 节省运算时间
# if j <= lef - 5:
# continue
if j != 0:
efendport = FlightD[ef[1][j - 1]][5]
else:
efendport = ef[0][2]
for k in range(1, 80):
solute = copy.deepcopy(FlyD.get((efendport, k, ef[0][1]), []))
for s in solute:
fset = []
for h in s:
fset = fset + FlightDismissList[h][1]
#若不满足时间限制
if j != 0:
delaytime = FlightD[ef[1][j - 1]][3] + delayD.get(ef[1][j - 1], datetime.timedelta(minutes = 0)) - (FlightD[fset[0]][2] + delayD.get(fset[0], datetime.timedelta(minutes = 0)) - datetime.timedelta(minutes = 50))
if delaytime > datetime.timedelta(hours = delayMaxhour):
continue
NewdelayD = GetNewDelayD(delaytime, fset, delayD, FlightD, AirportCloseD, Scene)
if not NewdelayD:
continue
else:
NewdelayD = delayD.copy()
#若不满足飞机-航线限制
if IsAirLimit(ef[0][0], fset, FlightD, AirplaneLimit):
continue
#若不满足中间台风机场不能停机限制
if FlightD[ef[1][j]][4] in sceneportset and (not IsTimeSameRange(FlightD[ef[1][j]][2] + NewdelayD.get(ef[1][j], datetime.timedelta(minutes = 0)), FlightD[fset[0]][2] + NewdelayD.get(fset[0], datetime.timedelta(minutes = 0)), 1, Scene)):
continue
#联程航班限制
if j != 0 and (FlightD[ef[1][j]][1] != 0 and FlightD[ef[1][j]][1] == FlightD[ef[1][j - 1]][1]):
continue
#先计算成本再构建新解
#计算成本
newsubcost = 0
for f in fset:
if FlightD[f][7] == ef[0][1]:
newsubcost += FlightD[f][6] * 1000
newsubcost -= FlightD[f][6] * 100 * (NewdelayD.get(f, datetime.timedelta(minutes = 0)) / datetime.timedelta(hours = 1))
for f in ef[1][j:]:
if FlightD[f][7] == ef[0][1]:
newsubcost -= FlightD[f][6] * 1000
newsubcost += FlightD[f][6] * 100 * (NewdelayD.get(f, datetime.timedelta(minutes = 0)) / datetime.timedelta(hours = 1))
if ef[0][3] == 1:
newsubcost -= 5000
if FlightDismissList[s[-1]][0][2] == 1:
newsubcost += 5000
newcost = initialCost - newsubcost
if newcost < initialCost:
NewFlightExecuteList = copy.deepcopy(FlightExecuteList)
NewFlightDismissList = copy.deepcopy(FlightDismissList)
newef = ef[1].copy()
newef = ef[1][:j] + fset
for k in s:
NewFlightDismissList[k][1] = []
#判断联程航班来确定放入DF中的航班串
if j != 0 and (FlightD[ef[1][j]][1] != 0 and FlightD[ef[1][j]][1] == FlightD[ef[1][j - 1]][1]):
NewFlightDismissList.append([[ef[0][0], ef[0][1], ef[0][3], FlightD[ef[1][-1]][5]], ef[1][j + 1:]])
else:
NewFlightDismissList.append([[ef[0][0], ef[0][1], ef[0][3], FlightD[ef[1][-1]][5]], ef[1][j:]])
NewFlightExecuteList[i][1] = newef
#将是否为尾航班标志互换
NewFlightExecuteList[i][0][3] = FlightDismissList[s[-1]][0][2]
NewFlightDismissList[s[-1]][0][2] = 0
Down_index = 1
l = len(newef) - len(ef[1])
DownRCL.append([newcost, NewFlightExecuteList, NewFlightDismissList, NewdelayD, l])
#尾航班串插入
if ef[0][3] == 0:
if lef > 0:
efendtime = FlightD[ef[1][-1]][3] + delayD.get(ef[1][-1], datetime.timedelta(minutes = 0)) + datetime.timedelta(minutes = 50)
efendport = FlightD[ef[1][-1]][5]
else:
efendtime = minTime
efendport = ef[0][2]
for k in range(1, 80):
solute = copy.deepcopy(FlyD.get((efendport, k, ef[0][1]), []))
for s in solute:
fset = []
for h in s:
fset = fset + FlightDismissList[h][1]
#若不满足时间限制
if lef != 0:
delaytime = FlightD[ef[1][-1]][3] + delayD.get(ef[1][-1], datetime.timedelta(minutes = 0)) - (FlightD[fset[0]][2] + delayD.get(fset[0], datetime.timedelta(minutes = 0)) - datetime.timedelta(minutes = 50))
if delaytime > datetime.timedelta(hours = delayMaxhour):
continue
NewdelayD = GetNewDelayD(delaytime, fset, delayD, FlightD, AirportCloseD, Scene)
if not NewdelayD:
continue
else:
NewdelayD = delayD.copy()
#若不满足飞机-航线限制
if IsAirLimit(ef[0][0], fset, FlightD, AirplaneLimit):
continue
#若不满足联程航班限制,因为插入尾部，所以肯定满足
#若不满足中间台风机场不能停机限制
if lef != 0 and FlightD[ef[1][-1]][5] in sceneportset and (not IsTimeSameRange(FlightD[ef[1][-1]][3] + NewdelayD.get(ef[1][-1], datetime.timedelta(minutes = 0)), FlightD[fset[0]][2] + NewdelayD.get(fset[0], datetime.timedelta(minutes = 0)), 0, Scene)):
continue
#计算成本
newsubcost = 0
for f in fset:
if FlightD[f][7] == ef[0][1]:
newsubcost += FlightD[f][6] * 1000
newsubcost -= FlightD[f][6] * 100 * (NewdelayD.get(f, datetime.timedelta(minutes = 0)) / datetime.timedelta(hours = 1))
if FlightDismissList[s[-1]][0][2] == 1:
newsubcost += 5000
newcost = initialCost - newsubcost
if newcost < initialCost:
#构造新解
NewFlightExecuteList = copy.deepcopy(FlightExecuteList)
NewFlightDismissList = copy.deepcopy(FlightDismissList)
newef = ef[1][:] + fset
for h in s:
NewFlightDismissList[h][1] = []
NewFlightExecuteList[i][1] = newef
if FlightDismissList[s[-1]][0][2] == 1:
NewFlightDismissList[s[-1]][0][2] = 0
NewFlightExecuteList[i][0][3] = 1
Down_index = 1
l = len(newef) - len(ef[1])
DownRCL.append([newcost, NewFlightExecuteList, NewFlightDismissList, NewdelayD, l])
else:
l_FD = len(FlightDismissList)
DFindexlist = [j for j in range(l_FD)]
j = -1
while(1):
if Israndom == 1:
if not (DFindexlist and Down_index == 0):
break
else:
j_index = random.randint(0, len(DFindexlist) - 1)
j = DFindexlist[j_index]
DFindexlist.remove(j)
else:
j += 1
if j == l_FD:
break
# DFindexlist = [j for j in range(len(FlightDismissList))]
# while (DFindexlist and Down_index == 0):
# j_index = random.randint(0, len(DFindexlist) - 1)
# j = DFindexlist[j_index]
# DFindexlist.remove(j)
#for j in range(len(FlightDismissList)):
df = FlightDismissList[j]
ldf = len(df[1])
if not df:
continue
if ef[0][1] != df[0][1]:
continue
else:
#检测df中的子航班环，将环插入到合适的位置
dflightcycle = findFlightCycle(FlightD, df[1])
for flightcycle in dflightcycle:
if ((FlightD[flightcycle[0]][1] != 0 and FlightD[flightcycle[1]][1] != FlightD[flightcycle[0]][1]) or (FlightD[flightcycle[-1]][1] != 0 and FlightD[flightcycle[-2]][1] != FlightD[flightcycle[-1]][1])):
continue
flightcycle_starttime = FlightD[flightcycle[0]][2] + delayD.get(flightcycle[0], datetime.timedelta(minutes = 0)) - datetime.timedelta(minutes = 50)
flightcycle_endtime = FlightD[flightcycle[-1]][3] + delayD.get(flightcycle[-1], datetime.timedelta(minutes = 0)) + datetime.timedelta(minutes = 50)
flightcycle_startport = FlightD[flightcycle[0]][4]
for k in range(-1, lef):
#判断机场是否相同
if k == -1:
if ef[0][2] != flightcycle_startport:
continue
else:
if FlightD[ef[1][k]][5] != flightcycle_startport:
continue
#判断时间是否可行
if k == -1:
if ef[1] and FlightD[ef[1][0]][2] + delayD.get(ef[1][0], datetime.timedelta(minutes = 0)) < flightcycle_endtime:
continue
NewdelayD = delayD.copy()
else:
delaytime = (FlightD[ef[1][k]][3] + delayD.get(ef[1][k], datetime.timedelta(minutes = 0))) - flightcycle_starttime
if delaytime > datetime.timedelta(hours = delayMaxhour):
continue
NewdelayD = GetNewDelayD(delaytime, flightcycle, delayD, FlightD, AirportCloseD, Scene)
if not NewdelayD:
continue
if k != lef - 1:
efdelaytime = FlightD[flightcycle[-1]][3] + NewdelayD.get(flightcycle[-1], datetime.timedelta(minutes = 0)) + datetime.timedelta(minutes = 50) - (FlightD[ef[1][k + 1]][2] + NewdelayD.get(ef[1][k + 1], datetime.timedelta(minutes = 0)))
if efdelaytime > datetime.timedelta(hours = delayMaxhour):
continue
NewdelayD = GetNewDelayD(efdelaytime, ef[1][k + 1:], NewdelayD, FlightD, AirportCloseD, Scene)
if not NewdelayD:
continue
#判断插入的地方联程航班是否取消
if k != -1 and k != lef - 1 and (FlightD[ef[1][k]][1] != 0 and FlightD[ef[1][k + 1]][1] == FlightD[ef[1][k]][1]):
continue
#判断是否飞机-航线限制
if IsAirLimit(ef[0][0], flightcycle, FlightD, AirplaneLimit):
continue
#判断台风停机问题
if k == -1:
if ef[1] and flightcycle_startport in sceneportset and not IsTimeSameRange(FlightD[ef[1][0]][2] + NewdelayD.get(ef[1][0], datetime.timedelta(minutes = 0)), FlightD[flightcycle[-1]][3] + NewdelayD.get(flightcycle[-1], datetime.timedelta(minutes = 0)), 1, Scene):
continue
elif k == lef - 1:
if flightcycle_startport in sceneportset and not IsTimeSameRange(FlightD[ef[1][-1]][3] + NewdelayD.get(ef[1][-1], datetime.timedelta(minutes = 0)), FlightD[flightcycle[0]][2] + NewdelayD.get(flightcycle[0], datetime.timedelta(minutes = 0)), 1, Scene):
continue
else:
if flightcycle_startport in sceneportset and not IsTimeSameRange(FlightD[ef[1][k]][3] + NewdelayD.get(ef[1][k], datetime.timedelta(minutes = 0)), FlightD[flightcycle[0]][2] + NewdelayD.get(flightcycle[0], datetime.timedelta(minutes = 0)), 0, Scene):
continue
if flightcycle_startport in sceneportset and not IsTimeSameRange(FlightD[ef[1][k + 1]][2] + NewdelayD.get(ef[1][k + 1], datetime.timedelta(minutes = 0)), FlightD[flightcycle[-1]][3] + NewdelayD.get(flightcycle[-1], datetime.timedelta(minutes = 0)), 0, Scene):
continue
newsubcost = 0
for f in flightcycle:
newsubcost += FlightD[f][6] * 1000
newsubcost -= FlightD[f][6] * 100 * (NewdelayD.get(f, datetime.timedelta(minutes = 0)) / datetime.timedelta(hours = 1))
for f in ef[1][k + 1:]:
newsubcost -= FlightD[f][6] * 100 * (NewdelayD.get(f, datetime.timedelta(minutes = 0) - delayD.get(f, datetime.timedelta(minutes = 0))) / datetime.timedelta(hours = 1))
newcost = initialCost - newsubcost
if newcost < initialCost:
#构造新解
NewFlightExecuteList = copy.deepcopy(FlightExecuteList)
NewFlightDismissList = copy.deepcopy(FlightDismissList)
newef = ef[1].copy()
newef = newef[:k + 1] + flightcycle + newef[k + 1:]
newdf = df[1].copy()
for f in flightcycle:
newdf.remove(f)
NewFlightExecuteList[i][1] = newef
NewFlightDismissList[j][1] = newdf
#费用肯定下降，所以加入到DownRcl
Down_index = 1
l = len(newef) - len(ef[1])
DownRCL.append([newcost, NewFlightExecuteList, NewFlightDismissList, NewdelayD, l])
#当ef没有尾串时，将df的尾航班串插入到ef的尾部
if ef[0][3] == 0:
efnum = lef - 1 - num
if lef > num:
efendtime = FlightD[ef[1][efnum]][3] + delayD.get(ef[1][efnum], datetime.timedelta(minutes = 0)) + datetime.timedelta(minutes = 50)
efendport = FlightD[ef[1][efnum]][5]
else:
efendtime = minTime
efendport = ef[0][2]
for k in range(len(df[1])):
#如果起始机场为ef终止机场，且时间小于ef的endtime
if FlightD[df[1][k]][4] != efendport:
continue
delaytime = efendtime - (FlightD[df[1][k]][2] + delayD.get(df[1][k], datetime.timedelta(minutes = 0)))
if delaytime > datetime.timedelta(hours = delayMaxhour):
continue
NewdelayD = GetNewDelayD(delaytime, df[1][k:], delayD, FlightD, AirportCloseD, Scene)
if not NewdelayD:
continue
#台风场景限制
if efendport in sceneportset and not IsTimeSameRange(efendtime, FlightD[df[1][k]][2] + NewdelayD.get(df[1][k], datetime.timedelta(minutes = 0)), 0, Scene):
continue
#ef的联程航班没有被拆除
if not (lef <= num or lef < 2 or num == 0 or not (FlightD[ef[1][efnum]][1] != 0 and FlightD[ef[1][efnum + 1]][1] == FlightD[ef[1][efnum]][1])):
continue
if not (k == 0 or not (FlightD[df[1][k]][1] != 0 and FlightD[df[1][k - 1]][1] == FlightD[df[1][k]][1])):
continue
#航线限制
if not IsAirLimit(ef[0][0], df[1][k:], FlightD, AirplaneLimit):
#计算成本
newsubcost = 0
for f in df[1][k:]:
newsubcost += FlightD[f][6] * 1000
newsubcost -= FlightD[f][6] * 100 * (NewdelayD.get(f, datetime.timedelta(minutes = 0)) / datetime.timedelta(hours = 1))
if efnum < 0:
for f in ef[1]:
newsubcost -= FlightD[f][6] * 1000
newsubcost += FlightD[f][6] * 100 * (NewdelayD.get(f, datetime.timedelta(minutes = 0)) / datetime.timedelta(hours = 1))
else:
for f in ef[1][efnum + 1:]:
newsubcost -= FlightD[f][6] * 1000
newsubcost += FlightD[f][6] * 100 * (NewdelayD.get(f, datetime.timedelta(minutes = 0)) / datetime.timedelta(hours = 1))
newcost = initialCost - newsubcost if df[0][2] == 0 else initialCost - newsubcost - 5000
if newcost < initialCost:
#构建新解
NewFlightExecuteList = copy.deepcopy(FlightExecuteList)
NewFlightDismissList = copy.deepcopy(FlightDismissList)
newef = ef[1].copy()
if efnum < 0:
newef = df[1][k:]
else:
newef = newef[:efnum + 1] + df[1][k:]
#若df不是联程航班切断
if k == 0 or not (FlightD[df[1][k]][1] != 0 and FlightD[df[1][k - 1]][1] == FlightD[df[1][k]][1]):
newdf = df[1][:k].copy()
else:
newdf = df[1][:k - 1].copy()
NewFlightExecuteList[i][1] = newef
NewFlightDismissList[j][1] = newdf
tmp = NewFlightExecuteList[i][0][3]
NewFlightExecuteList[i][0][3] = df[0][2]
NewFlightDismissList[j][0][2] = tmp
#若ef不是联程航班切断
if efnum >= 0:
if lef <= num or lef < 2 or num == 0 or not (FlightD[ef[1][efnum]][1] != 0 and FlightD[ef[1][efnum + 1]][1] == FlightD[ef[1][efnum]][1]):
NewFlightDismissList.append([[ef[0][0], ef[0][1], 0, 0], ef[1][efnum + 1:]])
else:
NewFlightDismissList.append([[ef[0][0], ef[0][1], 0, 0], ef[1][efnum + 2:]])
Down_index = 1
l = len(newef) - len(ef[1])
DownRCL.append([newcost, NewFlightExecuteList, NewFlightDismissList, NewdelayD, l])