Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 289, Issue 2, Pages 470-484Publisher
ELSEVIER
DOI: 10.1016/j.ejor.2020.07.032
Keywords
Routing; Pickup and delivery; Split loads; Transshipments; Branch-and-cut
Funding
- 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]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available