Heuristic Optimization for Multi-Depot Vehicle Routing Problem in ATM Network Model

2020 ◽  
pp. 201-228
Author(s):  
Valeria Platonova ◽  
Elena Gubar ◽  
Saku Kukkonen
Keyword(s):  
Vehicle Routing ◽  
Network Model ◽  
Vehicle Routing Problem ◽  
Heuristic Optimization ◽  
Routing Problem ◽  
Atm Network

A Shuffled Frog Leaping Algorithm for Solving Vehicle Routing Problem

2012 ◽  
Vol 197 ◽  
pp. 529-533 ◽  
Author(s):  
Kai Ping Luo
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
High Efficiency ◽  
Heuristic Optimization ◽  
Optimization Approach ◽  
Shuffled Frog Leaping Algorithm ◽  
Routing Problem ◽  
Shuffled Frog Leaping ◽  
Encoding Method ◽  
Nearest Neighborhood

For vehicle routing problem, its model is easy to state and difficult to solve. The shuffled frog leaping algorithm is a novel meta-heuristic optimization approach and has strong quickly optimal searching power. The paper applies herein this algorithm to solve the vehicle routing problem; presents a high-efficiency encoding method based on the nearest neighborhood list; improves evolution strategies of the algorithm in order to keep excellent characteristics of the best frog. This proposed algorithm provides a new idea for solving VRP.

Sign in / Sign up

Export Citation Format

Share Document