Enhancement on the modified artificial bee colony algorithm to optimize the vehicle routing problem with time windows
The vehicle routing problem with time windows (VRPTW) is a non-deterministictime hard (NP-hard) with combinatorial optimization problem (COP). The Artificial Bee Colony (ABC) is a popular swarm intelligence algorithm for COP. In this study, existing Modified ABC (MABC) algorithm is revised to solve...
Saved in:
Main Author: | Sankor, Salah Mortada Shahen |
---|---|
Format: | Thesis |
Language: | eng eng |
Published: |
2022
|
Subjects: | |
Online Access: | https://etd.uum.edu.my/10246/1/s903364_01.pdf https://etd.uum.edu.my/10246/2/s903364_02.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Heuristic methods for vehicle routing problem with time windows /
by: Ou, Ke
Published: (2001) -
Deterministic and stochastic inventory routing problems with backorders using artificial bee colony /
by: Huda Zuhrah Ab Halim
Published: (2019) -
Particle swarm optimization for solving vehicle routing problem with time windows
by: Abdullah, Nurashikin
Published: (2010) -
Performance Enhancement Of Artificial Bee Colony Optimization Algorithm
by: Abro, Abdul Ghani
Published: (2013) -
On heuristic methods for the single depot multi vehicle routing problem with and without time windows
by: Irawan, Bambang
Published: (2000)