The location routing inventory problem with time windows (LRIPTW) is a generalization of the location routing inventory problem where services for each customer begin within the time window defined by the earliest and the latest times. This paper presents a mathematical model and an optimization algorithm based on genetic algorithm (GA) for the LRIPTW. One sample is given for demonstration purposes. At last, the proposed heuristic method is tested and the results obtained illustrate the r...
