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


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

Sherylaidah Samsuddin, Mohd Shahizan Othman1, Lizawati Mi Yusuf2
1Universiti Teknologi Malaysia
2Universiti Teknologi Malaysia
Email: This email address is being protected from spambots. You need JavaScript enabled to view it.

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 population-based metaheuristic gives better solutions in solving MDVRPs.

Keywords: Metaheuristic, Multi Depot, MDVRP

pdf ico FULL PAPER
 
 
 
 
 

Contact Us

Managing Editor of IJSECS
Faculty of Computing,
College of Computing and Applied Sciences

Universiti Malaysia Pahang
Lebuhraya Tun Razak
26300 Gambang,
Kuantan, Pahang Darul Makmur.

Tel: +609 549 2133
Fax: +609 549 2144
Email: ijsecsfskkp@ump.edu.my

Visitor Counter

0091988
Today
Yesterday
This Week
Last Week
This Month
Last Month
All days
88
74
213
540
1372
2451
91988