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.
Highlights
The problems concerning the distribution of goods between depots and final users are known as Vehicle Routing Problems (VRPs)
We propose a mathematical formulation and develop a heuristic algorithm for the VRPSPDHTW
In large-sized sample problem, heuristic algorithm gives better results when compared to mathematical model
Summary
The problems concerning the distribution of goods between depots and final users are known as Vehicle Routing Problems (VRPs). (2015) A Heuristic Algorithm for Vehicle Routing Problems with Simultaneous Pick-Up and Delivery and Hard Time Windows. The sub-class of VRP in which customers ask for delivery in a specified time window [a, b] is referred to as vehicle routing problem with time windows constraints (VRPTW) [6]. An extension of basic VRP is vehicle routing problems with pickup and delivery (VRPPD). Simultaneous pickups and deliveries VRPPD: Delivery and pick up demand are serviced simultaneously This type of problem is denoted as VRPSPD. Unlike the work of Angellini and Mingyong, in this study, the objective in determined problems is to minimize the simultaneous pick up and hard time windows and arp objective function waits. Mathematical model was specified and heuristic algorithm for the solution was developed
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
