DEVELOPMENT AND COMPARISON OF GENETIC ALGORITHMS FOR VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS DELIVERIES AND PICKUPS IN A SUPPLY CHAIN NETWORK

Varun Kumar, SG and Panneerselvam, R (2018) DEVELOPMENT AND COMPARISON OF GENETIC ALGORITHMS FOR VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS DELIVERIES AND PICKUPS IN A SUPPLY CHAIN NETWORK. International Journal of Mechanical Engineering and Technology, 9 (12). pp. 457-469. ISSN 0976-6340

[img] PDF
DisplayPdf (1).pdf - Published Version
Restricted to Registered users only

Download (274kB) | Request a copy

Abstract

The increased focus on environmental awareness organizations across the world to adopt reverse logistics as their key functional business area. Vehicle routing problem with simultaneous deliveries and pickups (VRPSDP) is one of the major issues under reverse logistics and in this paper attempt is made to solve the same. Since this problem belongs to NP increase in number of customer nodes will increase the computational complexity of the problem. Due to the robustness of genetic algorithm in solving complex problem, Genetic Algorithms (GAs) with four different designs are proposed to solve VRPSDP. Experimental results are tested statistically using ANOVA with three factors, viz. “Problem Size”, “Algorithm” and “Mutation Probability”. Based on the significance using ANOVA with respect to the factor “Algorithm”, Duncan’s multiple range test is carried out to draw inferences on proposed algorithms.

Item Type: Article
Uncontrolled Keywords: Reverse Logistics, VRPSDP, Genetic Algorithms, Crossover, Mutation.
Subjects: Management > MIM Manipal
Depositing User: MIM User
Date Deposited: 07 Jan 2019 04:27
Last Modified: 07 Jan 2019 04:27
URI: http://eprints.manipal.edu/id/eprint/152759

Actions (login required)

View Item View Item