Key points are not available for this paper at this time.
Abstract This study explores groupage delivery optimization through a two-stage GA framework. The goal of optimization is to define locations of regional branch warehouses of Logistics Network to reduce transportation costs. The first stage of the GA focuses on identifying branch warehouses from a list of cities and uses the standard binary string approach, while the second stage solves Vehicle Routing Problem (VRP) using combinatorial GA. This research contributes to advancing logistics optimization methodologies and provides valuable insights for solving Location Routing Problem (LRP) which entails two problems: the Facility Location Problem (FLP) and the Multiple Vehicle Routing Problem (MVRP).
Malashin et al. (Tue,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: