Abstract
In this paper, we study the location routing problem with intermediate replenishment facilities (LRPIRF), an extension of the location routing problem (LRP), where the vehicles can replenish at some intermediate facilities. Vehicles leave the depot with load on-board, serve customers until out of load, may return to an intermediate facility to replenish, and finally return to the depot, completing their route. In this paper, we initiate a mathematical mixed integer programming model with new kind of subtour elimination constraints for this problem. Moreover, the facility location phase is considered besides vehicle routing phase in our problem. The objective of the problem is to find routes for vehicles to serve all customers at a minimal cost in terms of total travel cost and total facility location cost, without violating the capacity constraint of the vehicles. The solution to the LRPIRF is obtained through CPLEX solver in commercial software GAMS 23.5.1 ,Genetic Algorithm and Tabu Search algorithm. Computational results are obtained on a set of randomly generated instances and indicate the effectiveness of the proposed algorithms in terms of solution time and quality.
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.
