A PATH-EXCHANGE-TYPE LOCAL SEARCH ALGORITHM FOR VEHICLE ROUTING AND ITS EFFICIENT SEARCH STRATEGY

スポンサーリンク

概要

• 論文の詳細を見る

• This paper proposes a fast path-exchange-type local search algorithm for vehicle routing problems(VRPs) that uses a new search strategy to restrict the search to promising neighbors. An efficient search strategy for path exchange that uses edge lengths to give search radii is proposed. Intensive numerical experiments with VRP instances of up to 10,000 vertices were conducted, and the results are compared with those given by the k-Opt algorithms. It is shown that our algorithm is faster than the 3-Opt and yields the quality of the solution comparable with the 4-Opt.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Okano Hiroyuki

  IBM Research, Tokyo Research Laboratory

• Imai Hiroshi

  The University of Tokyo

• Okano H

  Ibm Res.

• Okano Hiroyuki

  Ibm Research Tokyo Research Laboratory

• Park Narihiro

  The University of Tokyo

関連論文

• A NEW STOCHASTIC LEARNING ALGORITHM FOR NEURAL NETWORKS
• NUMBERS OF PRIMAL AND DUAL BASES OF NETWORK FLOW AND UNIMODULAR INTEGER PROGRAMS
• Reactive Planar Magnetron Sputtering System with Obliquely Facing Targets of Zn : Thin Films
• A SCANLINE-BASED ALGORITHM FOR THE 2D FREE-FORM BIN PACKING PROBLEM
• A PATH-EXCHANGE-TYPE LOCAL SEARCH ALGORITHM FOR VEHICLE ROUTING AND ITS EFFICIENT SEARCH STRATEGY
• MAXIMIN LOCATION OF CONVEX OBJECTS IN A POLYGON AND RELATED DYNAMIC VORONOI DIAGRAMS

スポンサーリンク