文章詳目資料

Journal of Computers EIMEDLINEScopus

  • 加入收藏
  • 下載文章
篇名 MN_GLS for VRP with Simultaneous Delivery and Pickup
卷期 28:6
作者 Haodong ZhuJiamei FengHongchan Li
頁次 001-012
關鍵字 guided local searchmultiple neighborhoodpenalty strategyvehicle routing problemEIMEDLINEScopus
出刊日期 201712
DOI 10.3966/199115992017122806001

中文摘要

英文摘要

This Paper proposed a Multiple Neighborhood Guided Local Search Algorithm (MN_GLS) to solve vehicle routing problem (VRP) with simultaneous delivery and pickup. Firstly, it used the nearest neighbor method to build the initial solution. Secondly, it did the local search in multi-operator from the initial solution, and found the bow which had the biggest utility of punishment value when the solution fail into the local optimal solution, then changed the punishment of features value and objective function value. Thirdly, it selected the current optimal solution from the local optimal solutions, and then did the local optimization in multioperator again from the current optimal solution which has the new objective function value. By means of 54 examples, the simulation results illustrate that MN_GLS is an effective and stabilize method for Vehicle Routing Problem with Simultaneous Delivery and Pickup.

本卷期文章目次

相關文獻