The paper deals with a new variant of the profitable tour problem with electric vehicles. In order to avoid one of the main disadvantages encountered in this type of problem, i.e. the idle time imposed by recharging the battery, we propose a version where this operation is synchronized with lunch breaks. Such a policy requires multi-period agreements with clusters of restaurants. It leads to the multi-period profitable tour problem with electric vehicles and mandatory stops. This problem arises in scenarios of tourist trip design, blood mobile collection, or street marketing activities planning when the fleet is composed of electric vehicles. A mathematical model and a Branch-and-Price algorithm are proposed. In the solution method, the subproblem is solved following two different approaches, one exact approach using elementary paths and a relaxed approach allowing ng-paths. The numerical tests on instances with up to 100 clients and 3 periods show that both approaches produce excellent quality solutions in a very reasonable amount of time.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Multi-period profitable tour problem with electric vehicles and mandatory stops


    Contributors:


    Publication date :

    2023-05-02


    Size :

    17 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    Consequences of Mandatory Stops at Railroad-Highway Crossings

    B. L. Bowman / K. P. McCarthy | NTIS | 1985


    The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm

    Feillet, D. / Dejax, P. / Gendreau, M. | British Library Online Contents | 2005



    The real-time dynamic online feeder service with a maximum headway at mandatory stops

    Galarza Montenegro, Bryan David / Sörensen, Kenneth / Vansteenwegen, Pieter | Taylor & Francis Verlag | 2025