A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks
作者: Jonatas B. C. ChagasUlisses E. F. SilveiraAndré G. SantosMarcone J. F. Souza
作者单位: 1Departamento de Computação Universidade Federal de Ouro Preto Ouro Preto Brazil
2 Departamento de Informática Universidade Federal de Viçosa Viçosa Brazil
刊名: International Transactions in Operational Research, 2020, Vol.27 (1), pp.112-137
来源数据库: Wiley Journal
DOI: 10.1111/itor.12623
关键词: Vehicle routingPickup and deliveryLoading constraintsMathematical formulationVariable neighborhood search
原始语种摘要: Abstract(#br)This paper addresses the double vehicle routing problem with multiple stacks (DVRPMS) in which a fleet of vehicles must collect items in a pickup region and then travel to a delivery region where all items are delivered. The load compartment of all vehicles is divided into rows (horizontal stacks) of fixed profundity (horizontal heights), and on each row, the unloading process must respect the last‐in‐first‐out policy. The objective of the DVRPMS is to find optimal routes visiting all pickup and delivery points while ensuring the feasibility of the vehicle loading plans. We propose a new integer linear programming formulation, which was useful to find inconsistencies in the results of exact algorithms proposed in the literature, and a variable neighborhood search based...
全文获取路径: Wiley  (合作)

  • neighborhood 邻域
  • stacks 堆集室
  • routing 定线
  • horizontal 水平线
  • heuristic 试探
  • vehicle 
  • algorithm 算法
  • formulation 配方
  • items 贵重物品
  • variable 变量