The Pickup and Delivery Problem with Split Loads and Transshipments: A Branch-and-Cut Solution Approach
Autor: | David Wolfinger, Juan-José Salazar-González |
---|---|
Rok vydání: | 2021 |
Předmět: |
050210 logistics & transportation
Mathematical optimization 021103 operations research Information Systems and Management General Computer Science Transshipment (information security) Computer science 05 social sciences 0211 other engineering and technologies 02 engineering and technology Management Science and Operations Research Industrial and Manufacturing Engineering Transshipment Modeling and Simulation 0502 economics and business Pickup Routing (electronic design automation) Branch and cut |
Zdroj: | European Journal of Operational Research. 289:470-484 |
ISSN: | 0377-2217 |
DOI: | 10.1016/j.ejor.2020.07.032 |
Popis: | 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. |
Databáze: | OpenAIRE |
Externí odkaz: |
Pro tento záznam nejsou dostupné žádné jednotky.