Vehicle Routing Problem Relaxed Time Windows

Abstract

The Vehicle Routing Problem with Relaxed Time Windows (VRP-RTW) is an ex tension of the classic Vehicle Routing Problem (VRP) that allows for flexibility in service time windows. In VRP-RTW, vehicles are allowed to arrive before the dead line. Exceeding the deadline will result in fines or penalties. The purpose of this research is to create a mathematical model for VRP-RTW. The goal is to reduce to tal travel costs and late penalties, while ensuring that each customer is served within the available vehicle capacity limits. To illustrate the problems associated with logis tic distribution, this study uses literature review methodology as well as mathematical formulation techniques. Service time limits, route balance, and vehicle capacity are some of the issues considered by the developed model. It is hoped that the results of this research will assist in making decisions about more efficient and flexible logistics distribution. Additionally, the results will serve as the foundation for developing a vehicle route optimization model that can be used in real-world situations.