Highlights A new variant (FSMVRPB) of the classical Vehicle Routing Problem is introduced. A mathematical formulation, optimal solutions, lower/upper bounds are presented. We have also developed hybrid heuristic based on set partitioning. New data instances are created; results can be used for future benchmarking.

    Abstract In this paper we present a new variant of the classical Vehicle Routing Problem – the Fleet Size and Mix Vehicle Routing Problem with Backhauls (FSMVRPB). An ILP formulation of the FSMVRPB is presented. Optimal solutions for small size instances are produced and upper and lower bounds are generated for larger ones. In this paper we also propose a Set Partitioning Problem (SPP) based heuristic. Three frameworks are developed and tested on a set of new FSMVRPB data instances which we generated. Computational results are presented which can be used for future benchmarking.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The Fleet Size and Mix Vehicle Routing Problem with Backhauls: Formulation and Set Partitioning-based Heuristics


    Contributors:
    Salhi, Said (author) / Wassan, Niaz (author) / Hajarat, Mutaz (author)


    Publication date :

    2013-05-18


    Size :

    14 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    Genetic Algorithm for Vehicle Routing Problem with Backhauls

    WA, W.Nurfahizul Ifwah. / Shaiful, M. / Shamsunarnie, M.Z et al. | BASE | 2012

    Free access

    Bi-objective inventory routing problem with backhauls under transportation risks: two meta-heuristics

    Arab, R. / Ghaderi, S.F. / Tavakkoli-Moghaddam, R. | Taylor & Francis Verlag | 2020


    Capacitated-Vehicle Routing Problem with Backhauls on Trees

    Kumar, Roshan / Unnikrishnan, Avinash / Waller, S. Travis | Transportation Research Record | 2011