该代码实现了一个出租车调度优化模型,旨在最大化奖励函数,同时满足各种约束条件。模型从两个 CSV 文件(一个用于出租车数据,一个用于客户行程数据)中获取输入数据,并计算各种参数,例如接客距离、接客时间、延误时间、客户等待时间、奖励函数等。

模型首先定义了一系列参数,包括:

  • EAV_range:出租车的平均续航里程(英里)。
  • avg_speed_NYC:纽约市的平均行驶速度(英里/小时)。
  • power_consumption_rate:每英里能耗(kWh/mi)。
  • need_charging:需要充电的剩余电量比例(SOC<20%)。
  • charge_upto:充电上限比例(充至 80%)。
  • max_pickup_time:最大接客时间(分钟)。
  • max_pickup_dist:最大接客距离(英里)。
  • max_wait_time:最大等待时间(分钟)。
  • charging_power:充电功率(kW)。

代码定义了 trip_distance 函数用于计算两点之间的距离,并加载了出租车数据和客户行程数据。

def trip_distance(long1, lat1, long2, lat2):
  GPS1 = (long1, lat1)
  GPS2 = (long2, lat2)
  return 1.4413*great_circle(GPS1, GPS2).miles + 0.1383 #miles

taxi = pd.read_csv('taxi_data_0.csv')
request = pd.read_csv('customer_trip_data_0.csv')

代码创建了两个列表 taxi_index 和 request_index,分别表示出租车和客户请求的索引。

taxi_index = taxi.index.tolist()
request_index = request.index.tolist()
path = tuplelist(list(itertools.product(taxi_index, request_index)))
taxi = taxi.to_dict(orient='index')
request = request.to_dict(orient='index')

接下来,代码计算了各种参数,例如接客距离、接客时间、延误时间、客户等待时间和奖励函数。

#pickup distance
pickup_distance = pd.DataFrame(index=taxi_index, columns=request_index)
pickup_distance = pickup_distance.to_dict(orient='index')
for each_taxi in taxi_index:
  for each_request in request_index:
    taxi_GPS = (taxi[each_taxi]['taxi_longitude'], taxi[each_taxi]['taxi_lattitude'])
    request_GPS = (request[each_request]['pickup_longitude'], request[each_request]['pickup_lattitude'])
    pickup_distance[each_taxi][each_request] = 1.4413*great_circle(taxi_GPS, request_GPS).miles + 0.1383 #miles

#pickup time
pickup_time_in_mins = deepcopy(pickup_distance)
for each_taxi in taxi_index:
  for each_request in request_index:
    pickup_time_in_mins[each_taxi][each_request] = int(math.ceil((pickup_distance[each_taxi][each_request]/avg_speed_NYC) * 60))

     #pickup time + customer_waiting_time(mins)
delay_time_in_mins = deepcopy(pickup_time_in_mins)
for each_taxi in taxi_index:
  for each_request in request_index:
    delay_time_in_mins[each_taxi][each_request] = (pickup_time_in_mins[each_taxi][each_request]
            + request[each_request]['customer_waiting_time(mins)'])

     #pickup distance + occupied distance dictionary
pickup_occupied_distance = deepcopy(pickup_distance)
for each_taxi in taxi_index:
  for each_request in request_index:
    pickup_occupied_distance[each_taxi][each_request] = pickup_distance[each_taxi][each_request] + request[each_request]['trip_distance']

             #pickup distance + occupied distance + charging distance dictionary
pickup_occupied_CS_distance = deepcopy(pickup_distance)
for each_taxi in taxi_index:
  for each_request in request_index:
    pickup_occupied_CS_distance[each_taxi][each_request] = pickup_distance[each_taxi][each_request] + request[each_request]['trip_distance'] + request[each_request]['CS_distance']

#customer waiting time
eta = 1.0
customer_waiting_time = deepcopy(pickup_distance)
for each_taxi in taxi_index:
  for each_request in request_index:
    customer_waiting_time[each_taxi][each_request] = eta*request[each_request]['customer_waiting_time(mins)']

reward_function = deepcopy(pickup_distance)
for each_taxi in taxi_index:
  for each_request in request_index:
    reward_function[each_taxi][each_request] = max_pickup_time - pickup_time_in_mins[each_taxi][each_request] + customer_waiting_time[each_taxi][each_request]

代码使用 Gurobi 优化求解器来解决问题。

model = Model()
model.setParam('OutputFlag', 0)

#variables
x = model.addVars(taxi_index, request_index, vtype=GRB.BINARY, name='x')
obj = quicksum(x[i,j]*reward_function[i][j] for i,j in path)
model.setObjective(obj, GRB.MAXIMIZE)

#add constraints
for each_taxi in taxi_index:
  for each_request in request_index:
    if (pickup_occupied_CS_distance[each_taxi][each_request]>(taxi[each_taxi]['soc']*EAV_range)):
      model.addConstr(x[each_taxi, each_request]==0) #taxi does not accept request if range is not enough
    if(pickup_time_in_mins[each_taxi][each_request] > max_pickup_time):
      model.addConstr(x[each_taxi, each_request] == 0) #taxi does not accept request if pickup time is more than max
    if(customer_waiting_time[each_taxi][each_request] > max_wait_time):
      model.addConstr(x[each_taxi, each_request]==0) #taxi does not accept request if waiting time is more than max

model.addConstrs(x.sum(i, '*')<=1 for i in taxi_index)
model.addConstrs(x.sum('*', j)<=1 for j in request_index)

     #solve
model.optimize()

#print solution
for v in model.getVars():
  if v.x == 1.0:
    print(v.varName, v.x)
print('Obj:', model.objVal)

最后,代码打印了最佳解决方案,其中决策变量指示哪个出租车应该接送哪个客户,目标函数值指示所实现的总奖励。

该代码提供了一个出租车调度优化模型的示例,可以使用 Gurobi 求解器来解决。您可以根据您的具体需求调整参数和约束条件,并使用其他优化求解器来解决问题。

出租车调度优化模型代码解释

原文地址: https://www.cveoy.top/t/topic/m2Au 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录