A time-division distribution strategy for the two-echelon vehicle routing problem with demand blowout

DOI10.3934/jimo.2021094OpenAlexW3157114426MaRDI QIDQ2086954

Yanyan Li

Publication date: 26 October 2022

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2021094

zbMATH Keywords

two-echelon vehicle routing problemdemand blowouthybrid fireworks algorithmtime-division distribution

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Transportation, logistics and supply chain management (90B06) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites Work

• An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
• A large neighbourhood based heuristic for two-echelon routing problems
• The electric two-echelon vehicle routing problem
• A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
• The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
• An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem

This page was built for publication: A time-division distribution strategy for the two-echelon vehicle routing problem with demand blowout