Open Access
| Issue |
ITM Web Conf.
Volume 45, 2022
2021 3rd International Conference on Computer Science Communication and Network Security (CSCNS2021)
|
|
|---|---|---|
| Article Number | 01017 | |
| Number of page(s) | 8 | |
| Section | Computer Technology and System Design | |
| DOI | https://doi.org/10.1051/itmconf/20224501017 | |
| Published online | 19 May 2022 | |
- Wolfler Calvo, R. A new heuristic for the traveling salesman problem with time windows. Transportation Sci. (2000). [Google Scholar]
- Ma H, Zuo C, Y and S. Modeling and solving for vehicle routing problem with multiple time windows. Journal of System Engineering, (2009). [Google Scholar]
- Peng B, Zhou Y. Hybrid ant colony algorithm for vehicle routing problem with multiple time window. Computer Engineering and Applications, (2010). [Google Scholar]
- Huang Q, Li Z. Mathematical model and algorithm for vehicle routing problem with multiple time windows. Logistics Technology, (2012). [Google Scholar]
- Ma, H. W., Ye, H. R., Xia, W.. Improved ant colony algorithm for solving multi-time window vehicle scheduling problem allowing split distribution. China Management Science. ( 2012). [Google Scholar]
- Huang Qiu-Ai, Li Zhen-Ping. Mathematical model and algorithm for multi-time window vehicle path problem. Logistics Technology. (2012). [Google Scholar]
- Zhu L-L, Yang A-Q, Wu Kuan-Ren. Implementation of multi-temporal window VRP algorithm based on cooperative adaptive forbidden. Computer Application Research. (2012). [Google Scholar]
- Li ZP, Zhao F, Liu HW. Intelligent water drop algorithm for multi-time window vehicle path problem. Operations Research and Management. (2015). [Google Scholar]
- Ohlmann J, Henderson B S. Convergence in probability of compressed annealing. Math. of Oper. Res. (2004). [MathSciNet] [Google Scholar]
- Hadj-Alouane A, Bean J. A genetic algorithm for the multiple-choice integer program. Oper. Res. ( 1997). [MathSciNet] [Google Scholar]
- Dowsland K A. Simulated Annealing. John Wiley and Sons, New York. (1993). [Google Scholar]
- Ohlmann J W, Thomas B W. A compressed annealing heuristic for the traveling salesman problem with time windows. Informs Journal on Computing.( 2017) [Google Scholar]
- Hajek B. Cooling schedules for optimal annealing. Mathematics of Operations Research, (1988) [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.