A simulated annealing algorithm for solving multi-depot location routing problem with backhaul. (2017)

• Record Type: Journal Article
• Authors: Javad, Mahsa Oroojeni Mohammad; Karimi, Behrooz
• Is Part Of: International journal of industrial and systems engineering. Volume 25:Number 4(2017)
• Page Start: 460
• Page End: 477
• Publication Date: 2017
• Subjects: location-routing problem -- simulated annealing -- linehaul customers -- backhaul customers -- multi-depot location -- multiple depots -- mathematical modelling; Systems engineering -- Periodicals; Industrial engineering -- Periodicals; 620.001171
• Languages: English
• ISSNs: 1748-5037

Abstract

This paper presents a method for solving a multi-depot location-routing problem with backhaul (MDLRPB). In the suggested problem, there are two subsets of customers including linehaul and backhaul customers. Linehaul customers require a delivery of stock from the depot, whereas backhaul customers need to deliver stock from their location to the depot. A mathematical model and a heuristic method based on the simulated annealing (SA) algorithm have been proposed for solving the problem. Test problems from the literature have been used for generating a new test problem for the MDLRPB problem. Computational results show that the CPU time for the SA is reasonable while this value for the LINGO increase dramatically in large size problems. In the worst case, the gap between objective function value of SA algorithm and optimal solution is equal 3%. The results indicate that suggested algorithm can reach the optimal or near optimal solution in small and medium size problems in a reasonable computational time.