A general variable neighborhood search for the swap-body vehicle routing problem

详细信息    查看全文

• 作者：Raca Todosijević^a ; ^b ; ^e ; ^{racatodosijevic@gmail.com} ; Saï ; d Hanafi^a ; ^{said.hanafi@univ-valenciennes.fr} ; Dragan Uro&scaron ; ević^b ; ^{draganu@turing.mi.sanu.ac.rs} ; Bassem Jarboui^c ; ^{bassem_jarboui@yahoo.fr} ; Bernard Gendron^d ; ^{Bernard.Gendron@cirrelt.ca}
• 关键词：Vehicle routing ; Swap body ; Variable neighborhood search
• 刊名：Computers & Operations Research
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：78
• 期：Complete
• 页码：468-479
• 全文大小：1250 K
• 卷排序：78

文摘

This work considers a real-world Swap-Body Vehicle Routing Problem (SBVRP). A mixed Integer programming (MIP) formulation of SBVRP proposed. Constructive heuristic for generating an initial solution proposed. Two general variable neighborhood search heuristics implemented. Parallel general variable neighborhood search developed.