Open AccessGeneralized Reduced Gradient Approach for Solving Periodic Heterogeneous Vehicle Routing Problem with Side Constraints
Author(s) -
Herman Mawengkang,
Sutarman Sutarman
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1641/1/012045
Subject(s) - vehicle routing problem , scheduling (production processes) , computer science , routing (electronic design automation) , time horizon , schedule , heuristic , operations research , mathematical optimization , customer base , job shop scheduling , engineering , computer network , mathematics , business , finance , operating system
In order to transport customers’ request economically, such as, goods, meals etc it is frequently the delivery company depend on a model which is called vehicle routing problem (VRP). This model consists of a customer population with deterministic demands, and a central station which acts as the base of a set of vehicles. The purpose is to design the vehicle routes starting and terminating at the assigned central station, such that the customer demands is met, within a time windows This paper develops an optimization model for the management of periodic deliveries of a given commodity. Due to the geographic location of customers the company requires to have diverse type of vehicles with diverse capacity to serve the commodity for customers. This kind of problem is called Periodic Heterogeneous Vehicle Routing Problem (PHVRP). The purpose is to schedule periodically the deliveries according to feasible combinations of delivery days and to determine the scheduling of fleet and driver and routing policies of the vehicles. The aim is to minimize the total costs of all routes over the planning horizon. We propose a combined approach of reduced gradient and heuristic algorithm to solve the problem.