A Scenario Decomposition Algorithm for Strategic Time Window Assignment Vehicle Routing Problems

@article{Subramanyam2018ASD,
  title={A Scenario Decomposition Algorithm for Strategic Time Window Assignment Vehicle Routing Problems},
  author={Anirudh Subramanyam and Akang Wang and Chrysanthos E. Gounaris},
  journal={ArXiv},
  year={2018},
  volume={abs/1806.03220}
}
  • Anirudh Subramanyam, Akang Wang, Chrysanthos E. Gounaris
  • Published in ArXiv 2018
  • Economics, Computer Science, Mathematics
  • Abstract We study the strategic decision-making problem of assigning time windows to customers in the context of vehicle routing applications that are affected by operational uncertainty. This problem, known as the Time Window Assignment Vehicle Routing Problem, can be viewed as a two-stage stochastic optimization problem, where time window assignments constitute first-stage decisions, vehicle routes adhering to the assigned time windows constitute second-stage decisions, and the objective is… CONTINUE READING
    3
    Twitter Mentions

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 40 REFERENCES

    A branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem

    VIEW 9 EXCERPTS
    HIGHLY INFLUENTIAL

    The Time Window Assignment Vehicle Routing Problem

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    The discrete time window assignment vehicle routing problem

    VIEW 10 EXCERPTS
    HIGHLY INFLUENTIAL

    The Consistent Vehicle Routing Problem

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL