Making the most of fleets: A profit-maximizing multi-vehicle pickup and delivery selection problem

详细信息    查看全文

• 作者：Xiaoqiu Qiu ; ^{jimworks@gmail.com} ; Stefan Feuerriegel ^{stefan.feuerriegel@is.uni-freiburg.de} ; Dirk Neumann ^{dirk.neumann@is.uni-freiburg.de}
• 关键词：Decision support systems ; Transportation ; Logistics ; Branch and bound ; Heuristics
• 刊名：European Journal of Operational Research
• 出版年：2017
• 出版时间：16 May 2017
• 年：2017
• 卷：259
• 期：1
• 页码：155-168
• 全文大小：1351 K
• 卷排序：259

文摘

We model a novel Profit-Maximizing Pickup and Delivery Selection Problem (PPDSP). PPDSP is solved optimally by our graph search, which is faster than GUROBI. We identify factors that influence computation time and optimal profit of PPDSP. We develop two efficient heuristics: a randomized search and a greedy heuristic. Homogeneous fleets are modeled as Maximum Set Packing for faster optimization.