Lagrangian relaxation-based decomposition approaches for the capacitated arc routing problem in the state-space-time network

Maocan Songa School of Transportation, Southeast University, Jiangning District, Nanjing, ChinaCorrespondence[email protected]

https://orcid.org/0000-0002-4260-6030 View further author information

Bin Lua School of Transportation, Southeast University, Jiangning District, Nanjing, ChinaView further author information

Lin Chenga School of Transportation, Southeast University, Jiangning District, Nanjing, ChinaView further author information

Chao Sunb Jiangsu Univ, Sch Automot & Traff Engn, Zhenjiang212013, ChinaView further author information

Citations (2)

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (1)

Chenhao Zhang, Lin Cheng, Yibei Zhang, Mingyang Du & Wen Zheng. (2023) Route optimization of vacant taxicab considering sequential dependence in abstract grid network based on quadtree. Transportation Letters 0:0, pages 1-16.
Read now

Articles from other publishers (1)

Maocan Song, Lin Cheng, Mingyang Du, Chao Sun, Jie Ma & Huimin Ge. (2023) Charging station location problem for maximizing the space-time-electricity accessibility: A Lagrangian relaxation-based decomposition scheme. Expert Systems with Applications 222, pages 119801.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Lagrangian relaxation-based decomposition approaches for the capacitated arc routing problem in the state-space-time network

Articles from other publishers (1)

Information for

Open access

Opportunities

Help and information

Your download is now in progress and you may close this window

Login or register to access this feature

Lagrangian relaxation-based decomposition approaches for the capacitated arc routing problem in the state-space-time network

Citations (2)

Read on this site (1)

Articles from other publishers (1)

Reprints and Corporate Permissions

Academic Permissions

Related research

To cite this article:

Download citation

Information for

Open access

Opportunities

Help and information

Keep up to date