Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/241397 
Year of Publication: 
2020
Citation: 
[Journal:] Journal of Open Innovation: Technology, Market, and Complexity [ISSN:] 2199-8531 [Volume:] 6 [Issue:] 1 [Publisher:] MDPI [Place:] Basel [Year:] 2020 [Pages:] 1-21
Publisher: 
MDPI, Basel
Abstract: 
This paper aims to solve the location and routing problem (LRP) in the agricultural sector with the objective function of fuel cost minimization. Many farmers may have problems when transporting and selling products because of high costs and unfair prices. The proper location of standardized procurement centers and suitable routes will relieve farmers' problems. This paper includes a realistic constraint that a farm can be visited to collect product more than once. A mathematical model was formulated to be solved by Lingo software, but when the problem size was larger, Lingo was unable to solve the problem within a reasonable processing time. The variable neighborhood strategy adaptive search (VaNSAS) is proposed to solve this LRP. The main contributions of this paper are a real case study problem and the first introduction of VaNSAS. Furthermore, the different combinations of the solution approach are proposed to prove which combination is the best algorithm. The computational results show that VaNSAS can find the solutions for all problem sizes in much less processing time compared to Lingo. In medium and large-sized instances, the VaNSAS can reduce processing times by 99.91% and 99.86%, respectively, from solutions obtained by Lingo. Finally, the proposed VaNSAS has been deployed in a case study problem to decide the best locations and transportation routes with the lowest fuel cost.
Subjects: 
location routing problem
metaheuristics
rubber
variable neighborhood strategy adaptive search
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.