Abstract
Variable Neighbourhood Search algorithm is effective in dealing with largescale combinatorial optimization problems. In this paper a new approach of Variable Neighbourhood Search was introduced to solve a two-echelon distribution networks problem. First a two-echelon distribution networks are described with capacitated facility and time windows. Then an approach of Variable Neighbourhood Search was developed, which was combined with Simulate Anneal Arithmetic. The method for generating a set of initial Two-Echelon Distribution Networks is very important part of the approach. Moreover the Neighbourhood Structure, the Search Algorithms as well as the Termination Criteria have been introduced. The experimental results clearly show that the method is very effective and the quality of the solution is high.
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.
