Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows-Reference-Cited by-同舟云学术

Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows

Published:2015-07-01 Issue:7 Volume:10 Page:e0130224
ISSN:1932-6203
Container-title:PLOS ONE
language:en
Short-container-title:PLoS ONE

Author:

Jawarneh Sana,Abdullah Salwani

Publisher

Public Library of Science (PLoS)

Subject

Multidisciplinary

Reference56 articles.

1. The truck dispatching problem;GB Dantzig;Management Science,1959

2. Optimal solution of vehicle routing problems using minimum K-trees, Operations Research;ML Fisher;Optimal solution of vehicle routing problems using minimum K-trees, Operations Research,1994

3. Exact algorithms for routing problems under vehicle capacity constraints;R Baldacci;Annals of Operation Research,2010

4. The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications;JF Cordeau,2001

5. Vehicle Routing: Methods and Studies;M Desrochers,1988

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Logistics Optimization Using Hybrid Genetic Algorithm (HGA): A Solution to the Vehicle Routing Problem With Time Windows (VRPTW);IEEE Access;2024

2. A Multi-objective Optimization Approach for the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW);Studies in Computational Intelligence;2023

3. Scheduling management and optimization analysis of intermediate products transfer in a shipyard for cruise ships;PLOS ONE;2022-03-22

4. Green Vehicle Routing Problem: State of the Art and Future Directions;IEEE Access;2022

5. A Brief Literature Review About Bioinspired Metaheuristics to Solve Vehicle Routes Problem with Time Window;Proceedings of the International Conference on Intelligent Vision and Computing (ICIVC 2021);2022