Richard F. Hartl

A Branch-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands and Probabilistic Duration Constraints

  • Alexandre M. Florio
  • Juan-José Salazar-González
  • Richard F. Hartl
  • Stefan Minner
    • Categories Applications - OR and Management Sciences

    In many routing applications, it is necessary to place limits on the duration of the individual routes. When demands are stochastic and restocking during route execution is allowed, the durations of the resulting routes are also stochastic. In this paper, we consider the vehicle routing problem with stochastic demands and (probabilistic) duration constraints (VRPSD-DC). We … Read more

    Beam Search for integer multi-objective optimization

  • Thibaut Barthelemy
  • Sophie N. Parragh
  • Richard F. Hartl
  • Fabien Tricoire
    • Categories Meta Heuristics, Multi-Criteria Optimization

    Beam search is a tree search procedure where, at each level of the tree, at most W nodes are kept. This results in a metaheuristic whose solving time is polynomial in W. Popular for single-objective problems, beam search has only received little attention in the context of multi-objective optimization. By introducing the concepts of oracle … Read more