期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 289, 期 2, 页码 470-484出版社
ELSEVIER
DOI: 10.1016/j.ejor.2020.07.032
关键词
Routing; Pickup and delivery; Split loads; Transshipments; Branch-and-cut
资金
- Austrian Federal Ministry for Digital and Economic Affairs
- National Foundation for Research, Technology and Development
- Christian Doppler Research Association
- Gobierno de Canarias [ProID2017010132]
- MINECO/FEDER [MTM2015-63680-R]
This paper discusses the design of routes for a fleet of vehicles serving customer requests, targeting to minimize the sum of travel costs and transshipment costs. An arc-based mixed-integer formulation and a branch-and-cut algorithm are proposed and extensively tested to showcase the algorithm's performance.
This paper addresses the design of routes for a fleet of vehicles serving customer requests. It is a pickup and delivery problem where each customer location can be visited several times, and load may be transshipped from one vehicle to another at specific locations. The aim is to minimize the sum of travel costs and transshipment costs. We present an arc-based mixed-integer formulation for the problem and propose a branch-and-cut algorithm for solving it. Extensive computational results illustrate the performance of the algorithm. (C) 2020 The Author(s). Published by Elsevier B.V.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据