Abstract
Vehicle Routing Problem has been approved a NP problem and it belongs to classical Combination Optimization hard problem. An effective algorithm based on Important Sampling is designed to solve the model which named Vehicle Routing Problem with Weight Coefficients and Stochastic Demands (WVRPSD). The optimal importance sampling distribution function was obtained by making use of the expection constructed by likelihood ratio. Numerical experiments have been conducted and the results indicate that the method can effectively solve this problem.
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.
