An adaptive large neighborhood search heuristic for multi-commodity two-echelon vehicle routing problem with satellite synchronization

<p style='text-indent:20px;'>In considering route optimization from multiple distribution centers called depots via some intermediate facilities satellites to final customers with commodities request, we introduce the Multi-Commodity Two-Echelon Vehicle Routing Problem Satellite Synchronization (MC-2E-VRPSS). The MC-2E-VRPSS involves transportation on first echelon and deliveries second echelon. integrates satellite synchronization constraints time window for two-echelon network aims determine cost-minimizing routes two echelons. which trucks need be coordinated guarantee efficiency of network. In this study, develop a mixed-integer programming model MC-2E-VRPSS. For validating formulation, conduct computational experiments set small-scale instances using GUROBI an adaptive large neighborhood search (ALNS) heuristic problem. Furthermore, computation evaluating applicability ALNS compared (LNS) large-scale are also conducted, proved effectiveness ALNS.</p><p style='text-indent:20px;'> </p><p style='text-indent:20px;'>Addendum: Acknowledgement “This study was supported by Humanities Social Sciences Foundation Program Ministry Education (Project No.19YJA630122), "National Key R&D China"(Grant No.2020YFB1712900)” is added. We apologize any inconvenience may cause.</p>