View in EDS PDF Full Text

Research on model and algorithm for two-echelon vehicle routing problem considering time-dependent road networks.

Saved in:
Bibliographic Details
Title: Research on model and algorithm for two-echelon vehicle routing problem considering time-dependent road networks.
Authors: Chen, H. X.1, Li, H.1 ck788ck@163.com, Feng, X. X.1, Ma, R. W.1
Source: Advances in Transportation Studies. Jul2026, Vol. 69, p103-119. 18p.
Subjects: Vehicle routing problem, Routing algorithms, Ant algorithms, Intelligent transportation systems, Delivery of goods, Robotic path planning
Abstract: For the urban vehicle distribution routing problem, most existing models fail to consider the adaptation of abstract path visit sequences to the real road network or lack a fine-grained microscopic path search mechanism. Algorithmic optimizations tend to emphasize full-period performance and lack targeted responsiveness to the dynamic characteristics of individual time periods. To address this, this study proposes a two-echelon routing planning model considering time-dependent road networks and a hierarchical solution strategy. Firstly, a two-echelon programming model aiming to minimize total distribution time is established: the upper echelon is a route selection model that determines the task visit sequence; the lower echelon is a time-dependent shortest path model, used to solve for the shortest travel routes between demand points within the actual road network. To solve this model, a hierarchical collaborative solution strategy is designed. The upper echelon employs an improved ant colony algorithm, whose core innovation lies in a dynamic pheromone update mechanism bound to time periods, ensuring pheromone accumulation and evaporation occur only within the same traffic state period, thereby enabling more precise learning of routing experience across different periods. The lower echelon utilizes the TD-Dijkstra algorithm to accurately calculate the actual shortest travel time between any two points given a specific departure time. Comparative experiments demonstrate that the proposed model and algorithm exhibit excellent performance in both solution accuracy and adaptability to dynamic environments. This provides a new and effective solution for dynamic routing within urban intelligent transportation systems. [ABSTRACT FROM AUTHOR]
Copyright of Advances in Transportation Studies is the property of Advances in Transportation Studies and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 193950200
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Research on model and algorithm for two-echelon vehicle routing problem considering time-dependent road networks.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Chen%2C+H%2E+X%2E%22">Chen, H. X.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Li%2C+H%2E%22">Li, H.</searchLink><relatesTo>1</relatesTo><i> ck788ck@163.com</i><br /><searchLink fieldCode="AR" term="%22Feng%2C+X%2E+X%2E%22">Feng, X. X.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Ma%2C+R%2E+W%2E%22">Ma, R. W.</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Advances+in+Transportation+Studies%22">Advances in Transportation Studies</searchLink>. Jul2026, Vol. 69, p103-119. 18p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Vehicle+routing+problem%22">Vehicle routing problem</searchLink><br /><searchLink fieldCode="DE" term="%22Routing+algorithms%22">Routing algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Ant+algorithms%22">Ant algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Intelligent+transportation+systems%22">Intelligent transportation systems</searchLink><br /><searchLink fieldCode="DE" term="%22Delivery+of+goods%22">Delivery of goods</searchLink><br /><searchLink fieldCode="DE" term="%22Robotic+path+planning%22">Robotic path planning</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: For the urban vehicle distribution routing problem, most existing models fail to consider the adaptation of abstract path visit sequences to the real road network or lack a fine-grained microscopic path search mechanism. Algorithmic optimizations tend to emphasize full-period performance and lack targeted responsiveness to the dynamic characteristics of individual time periods. To address this, this study proposes a two-echelon routing planning model considering time-dependent road networks and a hierarchical solution strategy. Firstly, a two-echelon programming model aiming to minimize total distribution time is established: the upper echelon is a route selection model that determines the task visit sequence; the lower echelon is a time-dependent shortest path model, used to solve for the shortest travel routes between demand points within the actual road network. To solve this model, a hierarchical collaborative solution strategy is designed. The upper echelon employs an improved ant colony algorithm, whose core innovation lies in a dynamic pheromone update mechanism bound to time periods, ensuring pheromone accumulation and evaporation occur only within the same traffic state period, thereby enabling more precise learning of routing experience across different periods. The lower echelon utilizes the TD-Dijkstra algorithm to accurately calculate the actual shortest travel time between any two points given a specific departure time. Comparative experiments demonstrate that the proposed model and algorithm exhibit excellent performance in both solution accuracy and adaptability to dynamic environments. This provides a new and effective solution for dynamic routing within urban intelligent transportation systems. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Advances in Transportation Studies is the property of Advances in Transportation Studies and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=193950200
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.53136/97912218273547
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 18
        StartPage: 103
    Subjects:
      – SubjectFull: Vehicle routing problem
        Type: general
      – SubjectFull: Routing algorithms
        Type: general
      – SubjectFull: Ant algorithms
        Type: general
      – SubjectFull: Intelligent transportation systems
        Type: general
      – SubjectFull: Delivery of goods
        Type: general
      – SubjectFull: Robotic path planning
        Type: general
    Titles:
      – TitleFull: Research on model and algorithm for two-echelon vehicle routing problem considering time-dependent road networks.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Chen, H. X.
      – PersonEntity:
          Name:
            NameFull: Li, H.
      – PersonEntity:
          Name:
            NameFull: Feng, X. X.
      – PersonEntity:
          Name:
            NameFull: Ma, R. W.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 07
              Text: Jul2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 18245463
          Numbering:
            – Type: volume
              Value: 69
          Titles:
            – TitleFull: Advances in Transportation Studies
              Type: main
ResultId 1