TITLE:
A Heuristic Algorithm for Vehicle Routing Problems with Simultaneous Pick-Up and Delivery and Hard Time Windows
AUTHORS:
Suna Cetin, Cevriye Gencer
KEYWORDS:
Vehicle Routing Problems, Pick-Up and Delivery Service, Time Windows
JOURNAL NAME:
Open Journal of Social Sciences,
Vol.3 No.3,
March
18,
2015
ABSTRACT:
In this study, Vehicle Routing Problems
with Simultaneous Pick-Up and Delivery and Hard Time Windows (VRPSPDHTW), the special
case of vehicle routing problems is discussed. The goal of vehicle routing
problems is generally, the minimization of travelled distance or travelling
cost. In the literature, it is seen that same objective functions are defined
in time windows vehicle routing problems. However, in time window vehicle
routing problems, waits resulting from time window should be taken into
account. In the study, objective function was specified as minimization of
waits in VRPSPDHTW and the mathematical model has been defined as a set. In
addition, heuristic algorithms are proposed for the solution of the problem.Solomon data set were modified to fit the structure of the
problem and proposed algorithm was tested.