This paper presents a new variant of the well-known vehicle routing problem with time windows (VRPTW). More precisely, this paper addresses a multi-compartment vehicle routing problem with time windows and profit (MCVRPTW with profit). The aim of this problem is to serve a set of customers by using a set of vehicles with multiple compartments, under a minimum traveling cost. The vehicles, starting and ending at the depot, have a limited capacity and each compartment is dedicated to one product. A customer is served only within a given time windows and, when it is visited a profit is collected (i.e. a profit not low than a preset profit bound). To solve this problem, an hybrid approach combining the genetic algorithm (GA) and the iterated local search (ILS) is used.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Hybrid algorithm for solving the multi-compartment vehicle routing problem with time windows and profit


    Contributors:


    Publication date :

    2015-07-01


    Size :

    130065 byte



    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Solving Vehicle Routing Problem with Time Windows by Genetic Algorithm

    Jiang, Dali / Zhang, Mingshan / Wang, Feng | ASCE | 2002


    Solving Vehicle Routing Problem with Time Windows by Genetic Algorithm

    Jiang, D. / Zhang, M. / Wang, F. et al. | British Library Conference Proceedings | 2002


    The Multi-Compartment Vehicle Routing Problem with Flexible Compartment Sizes

    Henke, Tino / Speranza, M. Grazia / Wäscher, Gerhard | DataCite | 2014



    A HYBRID GENETIC ALGORITHM IMPLEMENTATION FOR VEHICLE ROUTING PROBLEM WITH TIME WINDOWS

    Ibrahim, Muhammad Faisal / Masudin, Ilyas / Saputro, Thomy Eko | BASE | 2016

    Free access