Variable Neighborhood Search for a Dynamic Rich Vehicle Routing Problem with time windows-Reference-Cited by-同舟云学术

Variable Neighborhood Search for a Dynamic Rich Vehicle Routing Problem with time windows

Published:2015-07 Issue: Volume:85 Page:120-131
ISSN:0360-8352
Container-title:Computers & Industrial Engineering
language:en
Short-container-title:Computers & Industrial Engineering

Author:

de Armas Jesica,Melián-Batista Belén

Publisher

Elsevier BV

Subject

General Engineering,General Computer Science

Reference41 articles.

1. A reactive variable neighborhood search for the vehicle routing problem with time windows;Bräysy;INFORMS Journal on Computing,2003

2. Cassani, L., & Righini, G. (2004). Heuristic algorithms for the tsp with rear-loading. In 35th Annual Congress Italian Operations Research Society (AIRO XXXV). Lecce, Italy.

3. Dynamic column generation for dynamic vehicle routing with time windows;Chen;Transportation Science,2006

4. A method for solving traveling-salesman problems;Croes;Operations Research,1958

5. GVNS for a Real-World Rich Vehicle Routing Problem with Time Windows;De Armas;Engineering Applications of Artificial Intelligence,2015

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

1. Interpretability, Adaptability and Scalability of Variable Neighborhood Search;Lecture Notes in Computer Science;2024

2. A Novel Mathematical Modeling Approach for Integrating a Periodic Vehicle Routing Problem and Cross-Docking System;2024

3. Solving the vehicle routing problem with time windows using modified football game algorithm;Egyptian Informatics Journal;2023-12

4. Elastic Strategy-Based Adaptive Genetic Algorithm for Solving Dynamic Vehicle Routing Problem With Time Windows;IEEE Transactions on Intelligent Transportation Systems;2023-12

5. The Dynamic Vehicle Routing Problem: A Comprehensive Survey;Unsupervised and Semi-Supervised Learning;2023-11-29