Amanote Research
Register
Sign In
A Novel Algorithm to Solve the Vehicle Routing Problem With Time Windows: Imperialist Competitive Algorithm
INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences
doi 10.4156/aiss.vol3.issue5.14
Full Text
Open PDF
Abstract
Available in
full text
Date
June 30, 2011
Authors
Unknown
Publisher
AICIT
Related search
Improved Artificial Bee Colony Algorithm for Vehicle Routing Problem With Time Windows
PLoS ONE
Multidisciplinary
Bees Algorithm for Vehicle Routing Problems With Time Windows
International Journal of Machine Learning and Computing
Management
Computer Science Applications
Information Systems
Artificial Intelligence
Application of Artificial Bee Colony Algorithm in Vehicle Routing Problem With Time Windows
An Alternative Algorithm for Vehicle Routing Problem With Time Windows for Daily Deliveries
Advances in Pure Mathematics
Vehicle Routing Problem With Time Windows
An Improving Dynamic Programming Algorithm to Solve the Shortest Path Problem With Time Windows
Electronic Notes in Discrete Mathematics
Combinatorics
Applied Mathematics
Discrete Mathematics
The Robust Vehicle Routing Problem With Time Windows
Computers and Operations Research
Management Science
Simulation
Computer Science
Operations Research
Modeling
A Novel Imperialist Competitive Algorithm for Multithreshold Image Segmentation
Mathematical Problems in Engineering
Mathematics
Engineering
Application of Imperialist Competitive Algorithm to the Emergency Medical Services Location Problem
International Journal of Artificial Intelligence & Applications
