资源分类
》 资源 》论文》Fleet Design Optimisation from Historical Data Using Constraint Programming and Large Neighbourhood Search

Fleet Design Optimisation from Historical Data Using Constraint Programming and Large Neighbourhood Search

2019-11-25 | |  52 |   43 |   0
Abstract We present an original approach to compute efficient mid-term fleet configurations at the request of a Queensland-based long-haul trucking carrier. Our approach considers one year’s worth of demand data, and employs a constraint programming (CP) model and an adaptive large neighbourhood search (LNS) scheme to solve the underlying multiday multi-commodity split delivery capacitated vehicle routing problem1 .

上一篇：The Dependence of Effective Planning Horizon on Model Accuracy

下一篇：Deep Neural Decision Forests

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...