A HEURISTIC ALGORITHM FOR THE MULTIVEHICLE ADVANCE REQUEST DIAL-A-RIDE PROBLEM WITH TIME WINDOWS

[1] BAKER E, 1981, ALGORITHM VEHICLE RO

[2] BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8

[3] BODIN LD, 1982, 82005 U MAR COLL PAR

[4] CHRISTOFIDES N, 1980, EURO 4 C CAMBRIDGE

[5] APPROXIMATE ANALYTIC MODEL OF MANY-TO-MANY DEMAND RESPONSIVE TRANSPORTATION SYSTEMS [J]. TRANSPORTATION RESEARCH, 1978, 12 (05): : 325 - 333

[6] HENDRICKSON CT, 1978, THESIS MIT CAMBRIDGE

[7] HUNG H, 1982, ORSA TIMS NATIONAL M

[8] JAW JJ, 1982, MITUMTA823 WORK PAP

[9] JAW JJ, 1984, THESIS MIT CAMBRIDGE

[10] A DYNAMIC-PROGRAMMING SOLUTION TO THE SINGLE VEHICLE MANY-TO-MANY IMMEDIATE REQUEST DIAL-A-RIDE PROBLEM [J]. TRANSPORTATION SCIENCE, 1980, 14 (02) : 130 - 154

[1] BAKER E, 1981, ALGORITHM VEHICLE RO

[2] BODIN L, 1983, COMPUT OPER RES, V10, P63, DOI 10.1016/0305-0548(83)90030-8

[3] BODIN LD, 1982, 82005 U MAR COLL PAR

[4] CHRISTOFIDES N, 1980, EURO 4 C CAMBRIDGE

[5] APPROXIMATE ANALYTIC MODEL OF MANY-TO-MANY DEMAND RESPONSIVE TRANSPORTATION SYSTEMS [J]. TRANSPORTATION RESEARCH, 1978, 12 (05): : 325 - 333

[6] HENDRICKSON CT, 1978, THESIS MIT CAMBRIDGE

[7] HUNG H, 1982, ORSA TIMS NATIONAL M

[8] JAW JJ, 1982, MITUMTA823 WORK PAP

[9] JAW JJ, 1984, THESIS MIT CAMBRIDGE

[10] A DYNAMIC-PROGRAMMING SOLUTION TO THE SINGLE VEHICLE MANY-TO-MANY IMMEDIATE REQUEST DIAL-A-RIDE PROBLEM [J]. TRANSPORTATION SCIENCE, 1980, 14 (02) : 130 - 154