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 97
- Downloads 0
A SMART MONITORING SYSTEM FOR CAMPUS USING ZIGBEE WIRELESS SENSOR NETWORKS
The wireless sensor networks are autonomous sensors that are distributed to monitor environmental and physical conditions and pass them across the network to other areas, which is considered one of the key elements that...
MODELLING THE UNIVERSITI MALAYSIA PAHANG EXAMINATION TIMETABLING PROBLEM
This paper presents a study of the Universiti Malaysia Pahang (UMP) examination timetabling problem and its constraints. UMP currently situated in two campuses (Gambang and Pekan) which presents many challenges in produc...
DATA SECURITY ISSUES IN CLOUD COMPUTING: REVIEW
Cloud computing is an internet based model that empower on demand ease of access and pay for the usage of each access to shared pool of networks. It is yet another innovation that fulfills a client's necessity for comput...
A GLOBAL AFRICAN BUFFALO OPTIMIZATION
In this paper, a modified version of the African Buffalo Optimization algorithm with emphasis on global search is proposed. Two different equations with the values of their upper and lower boundaries are selected to be t...
REPRESENTING VARIABILITY IN SOFTWARE ARCHITECTURE: A SYSTEMATIC LITERATURE REVIEW
Variability in software-intensive systems is the ability of a software artefact (e.g., a system, subsystem, or component) to be extended, customised or configured for deployment in a specific context. Software Architectu...