Abstract
One of the important extensions of the classical resource allocation problem is Integrated Resource Allocation and Routing Problem with Bound and Time Window (IRARPBTW). The base variant of IRARPBTW is vehicle routing problem with backhauls and time windows. IRARPBTW problem focuses on finding the optimal allocation and routing for the vehicles with the objective of minimizing the total distance by considering the constraints on time windows and bound on resource by covering delivery service during the linehaul and the collection/pick-up service during the backhaul. We have developed a unified model Decision Support System based on Mixed Integer Linear Programming (DINLIP) to solve VRPBTW and IRARPBTW. Model DINLIP was tested for benchmark datasets of VRPBTW and derived datasets of IRARPBTW and yielded encouraging results.
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.
