Re-optimization in dynamic vehicle routing problem based on Wasp-like agent strategy: Fid-Bau Portal

Fachinformationsdienst BAUdigital

Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik

Re-optimization in dynamic vehicle routing problem based on Wasp-like agent strategy

Jingyan Song, / Jianming Hu, / Yan Tian, / Yangsheng Xu,

The dynamic vehicle routing problem, DVRP, is focused on optimally routing a fleet of vehicles of fixed capacity when the real-time requests of customers occur. The optimization is to search for the solution in minimizing the total length of tours and to satisfy the customer delivery time window. In this paper, we present a Wasp-like agent strategy to decide when to deal with the real-time requests and reoptimize the vehicle routes. The results show that the method works effectively to find competitive solutions.

Zugriff

Zugriff prüfen

Verfügbarkeit in meiner Bibliothek prüfen

Bestellung bei Subito €

Seitennavigation

Dokumentinformationen

Ähnliche Titel

Exportieren, teilen und zitieren

Re-optimization in dynamic vehicle routing problem based on Wasp-like agent strategy

Jingyan Song, / Jianming Hu, / Yan Tian, / Yangsheng Xu,

The dynamic vehicle routing problem, DVRP, is focused on optimally routing a fleet of vehicles of fixed capacity when the real-time requests of customers occur. The optimization is to search for the solution in minimizing the total length of tours and to satisfy the customer delivery time window. In this paper, we present a Wasp-like agent strategy to decide when to deal with the real-time requests and reoptimize the vehicle routes. The results show that the method works effectively to find competitive solutions.

Re-optimization in dynamic vehicle routing problem based on Wasp-like agent strategy

Jingyan Song, / Jianming Hu, / Yan Tian, / Yangsheng Xu,

The dynamic vehicle routing problem, DVRP, is focused on optimally routing a fleet of vehicles of fixed capacity when the real-time requests of customers occur. The optimization is to search for the solution in minimizing the total length of tours and to satisfy the customer delivery time window. In this paper, we present a Wasp-like agent strategy to decide when to deal with the real-time requests and reoptimize the vehicle routes. The results show that the method works effectively to find competitive solutions.

Zugriff

Zugriff prüfen

Verfügbarkeit in meiner Bibliothek prüfen

Bestellung bei Subito €

Seitennavigation

Dokumentinformationen

Ähnliche Titel

Exportieren, teilen und zitieren

Dokumentinformationen

Titel:

Re-optimization in dynamic vehicle routing problem based on Wasp-like agent strategy

Beteiligte:

Jingyan Song, (Autor:in) / Jianming Hu, (Autor:in) / Yan Tian, (Autor:in) / Yangsheng Xu, (Autor:in)

Erschienen in:

Proceedings. 2005 IEEE Intelligent Transportation Systems, 2005. ; 231-236

Erscheinungsdatum:

01.01.2005

Format / Umfang:

293146 byte

ISBN:

DOI:

https://doi.org/10.1109/ITSC.2005.1520131

Medientyp:

Aufsatz (Konferenz)

Format:

Elektronische Ressource

Sprache:

Englisch

Ähnliche Titel

Re-Optimization in Dynamic Vehicle Routing Problem Based on Wasp-Like Agent Strategy

Song, J. / Hu, J. / Tian, Y. et al. | British Library Conference Proceedings | 2005

It looks like a wasp!

Bassi, Alberto | Online Contents | 1996

Genetic Algorithm Optimization in Vehicle Routing Problem

Zhang, L.Z. / Chen, S.Y. / Cui, Y.Y. | British Library Conference Proceedings | 2013

Dynamic vehicle routing problem using hybrid ant system

Yan Tian, / Jingyan Song, / Danya Yao, et al. | IEEE | 2003

Dynamic Vehicle Routing Problem Using Hybrid Ant System

Tian, Y. / Song, J. / Yao, D. et al. | British Library Conference Proceedings | 2003