A branch-and-bound approach for a Vehicle Routing Problem with Customer Costs
Research output: Contribution to journal › Research article › Contributed › peer-review
Contributors
Abstract
An important aspect in railway maintenance management is the scheduling of tamping actions in which two aspects need to be considered: first, the reduction of travel costs for crews and machinery; and second, the reduction of time-dependent costs caused by bad track condition. We model the corresponding planning problem as a Vehicle Routing Problem with additional customer costs. Due to the particular objective function, this kind of Vehicle Routing Problem is harder to solve with conventional methods. Therefore, we develop a branch-and-bound approach based on a partition and permutation model. We present two branching strategies, the first appends one job at the end of a route in each branching step and the second includes one job inside a route in each branching step; and analyze their pros and cons. Furthermore, different lower bounds for the customer costs and the travel costs are defined and compared. The performance of the branch-and-bound method is analyzed and compared with a commercial solver.
Details
Original language | English |
---|---|
Article number | 100003 |
Number of pages | 11 |
Journal | EURO Journal on Computational Optimization |
Volume | 9 |
Publication status | Published - Mar 2021 |
Peer-reviewed | Yes |
External IDs
Scopus | 85103686682 |
---|
Keywords
Research priority areas of TU Dresden
DFG Classification of Subject Areas according to Review Boards
Subject groups, research areas, subject areas according to Destatis
Sustainable Development Goals
ASJC Scopus subject areas
Keywords
- Branch-and-bound, Customer costs, Railway maintenance scheduling, Vehicle Routing Problem