A REVIEW OF SINGLE AND POPULATION-BASED METAHEURISTIC ALGORITHMS SOLVING MULTI DEPOT VEHICLE ROUTING PROBLEM

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

AN APPROACH TO INCREASE THE EFFECTIVENESS OF TLC VERIFICATION WITH RESPECT TO THE CONCURRENT STRUCTURE OF TLA+ SPECIFICATION

Modern approaches to distributed software systems engineering are tightly bounded with formal methods usage. The effective way of certain method application can leverage significant outcome, in terms of corresponding tim...

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...

IDENTIFICATION AND QUANTIFICATION OF FACTORS AFFECTING REUSABILITY OF OPEN SOURCE SOFTWARE IN REUSE-INTENSIVE SOFTWARE DEVELOPMENT

Open Source Software (OSS) is one of the emerging areas in software engineering. Reuse of OSS is employed in reuse-intensive software development such as Component Based Software Development and Software Product Lines. O...

COMPARATIVE BENCHMARKING OF CONSTRAINTS T-WAY TEST GENERATION STRATEGY BASED ON LATE ACCEPTANCE HILL CLIMBING ALGORITHM

This paper describes the new t-way strategy based the Late Acceptance based Hill Climbing algorithm, called LAHC, for constraints t-way test generation. Unlike earlier competing work, LAHC does not require significant tu...

PREDICTING THE EFFECTIVENESS OF WEB INFORMATION SYSTEMS USING NEURAL NETWORKS MODELING: FRAMEWORK & EMPIRICAL TESTING

The information systems (IS) assessment studies have still used the commonly traditional tools such as questionnaires in evaluating the dependent variables and specially effectiveness of systems. Artificial neural network...

Download PDF file
  • EP ID EP597404
  • DOI -
  • Views 102
  • Downloads 0

How To Cite

(2018). A REVIEW OF SINGLE AND POPULATION-BASED METAHEURISTIC ALGORITHMS SOLVING MULTI DEPOT VEHICLE ROUTING PROBLEM. International Journal of Software Engineering and Computer Systems, 4(2), -. https://europub.co.uk/articles/-A-597404