同時(shí)取送貨的雙層級(jí)選址路徑問(wèn)題建模與樽海鞘算法求解研究

打開(kāi)文本圖片集

中圖分類(lèi)號(hào)：F224.3 文獻(xiàn)標(biāo)志碼：A

Salp swarm algorithm for solving the two-echelon location routing problem with simultaneous pickup and delivery

ZHANG Wenmei， ZHANG Huizhen， HAI Sheshe （Business School， University of Shanghai for Science and Technology，Shanghai 2Ooo93，China）

Abstract： In a two-echelon logistics network， to simultaneously meet the pickup and delivery requirements of each customer， a mixed integer programming model was established to minimize the costs associated with distribution center location， vehicle activation and vehicle transportation. An improved salp swarm algorithm was designed based on the specific characteristics of the model to solve this problem. The greedy clustering algorithm was employed to generate the initial solutions. An adaptive weighting strategy， adjusting food source quantity strategy， elite retention strategy and various search operators were introduced. The constructed model and algorithm were verified through testing instances of different customer sizes，and the original salp swarm algorithm， genetic algorithm， immune algorithm， grey wolf optimizer， and whale optimization algorithm were used for solving the problem. A comparative analysis of the operation results of each algorithm verified the feasibility of the constructed model and the effectiveness of the improved algorithm.

Keywords： location routing problem; two-echelon; simultaneous pickup and delivery; improved salp swarm algorithm

選址路徑問(wèn)題（location routingproblem，LRP）是交通運(yùn)輸以及運(yùn)籌優(yōu)化領(lǐng)域的重要研究?jī)?nèi)容之一，需同時(shí)考慮兩方面的決策問(wèn)題：設(shè)施選址問(wèn)題（facilitylocationproblem，F(xiàn)LP）和車(chē)輛路徑問(wèn)題（vehicle routing problem，VRP）[1]。（剩余13614字）