A REVIEW OF SINGLE AND POPULATION-BASED METAHEURISTIC ALGORITHMS SOLVING MULTI DEPOT VEHICLE ROUTING PROBLEM
Journal Title: International Journal of Software Engineering and Computer Systems - Year 2018, Vol 4, Issue 2
Abstract
Multi-Depot Vehicle Routing Problem (MDVRP) arises with rapid development in the logistics and transportation field in recent years. This field, mainly, faces challenges in arranging their fleet efficiently to distribute the goods to customers by minimizing distance and cost. Therefore, the decision maker needs to specify the vehicles to reach the particular depot which, serves the customers with the predetermined capacity. Hence, to solve the stated problems, there is a need to apply metaheuristic methods to get minimal transportation costs. This article reviews on single and population-based metaheuristic methods solving MDVRP from the year 2013 until 2018. The methods discussed were simulated annealing (SA), variable neighborhood search (VNS), ant colony algorithm (ACO), particle swarm optimization (PSO) and genetic algorithm (GA). From the previous works, it can be concluded that the application of populationbased metaheuristic gives better solutions in solving MDVRPs.
Authors and Affiliations
Keywords
Related Articles
- EP ID EP597404
- DOI -
- Views 99
- Downloads 0
A PROPOSED FRAMEWORK TO CONTROL RUMOUR PROPAGATION ON TWITTER FOR CRITICAL NATIONAL INFORMATION INFRASTRUCTURE (CNII) ORGANISATIONS
Critical National Information Infrastructure (CNII) organisations in Malaysia consist of many crucial sectors that not solely effect on national e-sovereignty, but also on economy, social and politic matters. Due to the...
EFFECTS OF VIDEO DISPLAY TERMINAL RESOLUTIONS TO THE LEGIBILITY OF TEXT ON A WEB PAGE
Higher Video Display Terminal (VDT) resolutions have been proven to provide better quality in improving image quality displayed. The higher the resolution means more pixels per-inch-square available to display an image....
PERFORMANCE EVALUATION OF SELECTED DISTANCE-BASED AND DISTRIBUTION-BASED CLUSTERING ALGORITHMS
Clustering is an automated search for hidden patterns in a datasets to unveil group of related observations. The technique is one of the viable means by which the patterns or internal structure of the data within the sam...
PARALLEL INTEGRATION ALGORITHM AND ITS USAGE FOR A PRACTICAL SIMULATION OF SPACECRAFT ATTITUDE MOTION
Nowadays multi-core processors are installed almost in each modern workstation, but the question of these computational resources effective utilization is still a topical one. In this paper the four-point block one-step...
PARAMETER-LESS SIMULATED KALMAN FILTER
Simulated Kalman Filter (SKF) algorithm is a new population-based metaheuristic optimization algorithm. In the original SKF algorithm, three parameter values are assigned during initialization, the initial error covarian...