• English
  • Deutsch
  • Log In
    Password Login
    Research Outputs
    Fundings & Projects
    Researchers
    Institutes
    Statistics
Repository logo
Fraunhofer-Gesellschaft
  1. Home
  2. Fraunhofer-Gesellschaft
  3. Artikel
  4. A branch-and-bound approach for a Vehicle Routing Problem with Customer Costs
 
  • Details
  • Full
Options
2021
Journal Article
Title

A branch-and-bound approach for a Vehicle Routing Problem with Customer Costs

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 c ompared with a commercial solver.
Author(s)
Theurich, Franziska  
Fraunhofer-Institut für Verkehrs- und Infrastruktursysteme IVI  
Fischer, Andreas
Technische Universität Dresden
Scheithauer, Guntram
Technische Universität Dresden
Journal
EURO journal on computational optimization  
Open Access
DOI
10.1016/j.ejco.2020.100003
Language
English
Fraunhofer-Institut für Verkehrs- und Infrastruktursysteme IVI  
Keyword(s)
  • vehicle routing problem

  • railway infrastructure maintenance scheduling

  • customer costs

  • branch-and-bound

  • Cookie settings
  • Imprint
  • Privacy policy
  • Api
  • Contact
© 2024