On-line vehicle routing problem with heterogeneous vehicles, time windows and road network constraints
On-line vehicle routing problem with heterogeneous vehicles, time windows and road network constraints
Author : MUHAMMAD NASHIR ARDIANSYAH; DR. Suprayogi Published on : International Conference on Operations and Supply Chain Management (Nusa Dua, Bali, Indonesia)
Abstract
This paper deals with an on-line vehicle routing problem (VRP) in order to consider real-time variations in travel times. Other characteristics of the VRP discussed in this paper are heterogeneous vehicle, time windows, and road network constraints. The problem addressed in this paper is divided into two stages, i.e., planning and execution stages. The planning stage (also called as off-line stage) aims to design a set of vehicle routes to minimize total cost. In this planning stage, it is assumed that all relevant parameters are known in advance. In the execution stage (also called as on-line stage), the vehicle routes designed beforehand are implemented and the traffic jams may happen on some road segments causing longer travel times. The new route of a particular vehicle must be determined to minimize the travel time and lateness. A solution framework is developed and implemented in the application software under Geographical information System (GIS) environment. To show the applicability, the solution framework is tested using a hypothetical instance.
