VEHICLE ROUTE OPTIMIZATION FOR RFID INTEGRATED WASTE COLLECTION SYSTEM - Essay Example

The model normally applies precise data having respective quantity and proper location undertaken through the use of the RFID technology and also normally includes pre-determined capacity. The summary of the mathematical model in optimization of the route of a waste collection invests in the essence of reduction or minimization of the entire transport cost while considering the capacity for the vehicle and all the exerted weight of the collected bins by also considering pre-determined zone.

The mathematics refers to the ones indicated below. The mathematical programming model is as shows below (Alp & Emre, 2008). The provided linear model has an objective function marked by number (3) which facilitates the minimization of the total distance driven across. Typical Constraints (4) and (5) provides assurance that every town apart from the collection center is excellently entailed or entered and left precisely once. The other Constraints (6) and (7) normally help in considering the amount of the total waste collected on the outlined waste bin “i” which is typically the lower limit.

There is entailed capacity for waste vehicle in high limit qi. There is now the presence of the constraint (8), in addition with (7), which normally equates to the qi to ci as long as the “i” is equivalent to first waste bin of the any entailed tour. From the functions, if “i” is not assigned as the first tour, constraint (9) would exactly illustrate the presented relation available between and the variables qi and xij. The process will initially look into if the arc (i, j) is present in a waste collection tour or if not (Alp & Emre, 2008).

The optimization approach on this mathematical model applies a linear programming and integer solver. The process is evaluated by the use of a special software referred to as Mosel Language or otherwise Dash