A bi-objective Latency Location Routing Problem with Time Windows

These days, in a customer-oriented system such as post-disaster relief, or when latency at demand location plays a significant role in customer s satisfaction, the conventional goals are changed. In this study, a location-routing problem in customer-oriented systems is considered. The LLRP determines the locations of open depots, assignment of vehicles to the depots, and routings of the vehicles. In contrast of the conventional LRP, these decisions are made with the objective of minimizing the total latency at affected areas beside minimizing the economic cost of the logistic system. Also, we consider a penalty of violating each affected area s time window as a cost of human s lives losses which happened for the sake of the delay in receiving reliefs. To be more realistic, this paper assumed LLRP with capacitated vehicles and capacitated depots. we take service time at each affected area into account, too. Finally, the problem is solved for a small instance by GAMS software to show the correctness of the model.

A bi-objective Latency Location Routing Problem with Time Windows Keywords:

Location routing problem , Minimum latency , Post disaster relief , Priority based soft time windows