• Title of article

    A memeticalgorithmforthemulti-compartmentvehicleroutingproblemwith stochastic demands

  • Author/Authors

    Jorge L. Mendoza، نويسنده , , BrunoCastanier، نويسنده , , ChristelleGuéret، نويسنده , , AndrésL.Medagliab، نويسنده , , NubiaVelascob، نويسنده ,

  • Issue Information
    ماهنامه با شماره پیاپی سال 2010
  • Pages
    13
  • From page
    1886
  • To page
    1898
  • Abstract
    The multi-compartmentvehicleroutingproblem(MC-VRP)consistsofdesigningtransportationroutes to satisfythedemandsofasetofcustomersforseveralproductsthat,becauseofincompatibilitycon- straints, mustbeloadedinindependentvehiclecompartments.Despiteitswidepracticalapplicability the MC-VRPhasnotreceivedmuchattentionintheliterature,andthefewexistingmethodsassume perfect knowledgeofthecustomerdemands,regardlessoftheirstochasticnature.Thispaperextends the MC-VRPbyintroducinguncertaintyonwhatitisknownastheMC-VRPwithstochasticdemands (MC-VRPSD). TheMC-VRPSDismodeledasastochasticprogramwithrecourseandsolvedbymeans of amemeticalgorithm.Theproposedmemeticalgorithmcouplesgeneticoperatorsandlocalsearch procedures proventobeeffectiveondeterministicroutingproblemswithanovelindividualevaluation and reparationstrategythataccountsforthestochasticnatureoftheproblem.Thealgorithmwastested on instancesofupto484customers,anditsresultswerecomparedtothoseobtainedbyasavings-based heuristic andamemeticalgorithm(MA/SCS)fortheMC-VRPthatusesasparecapacitystrategytohandle demand fluctuations.InadditiontoeffectivelysolvetheMC-VRPSD,theproposedMA/SCSalsoimproved 14 bestknownsolutionsina40-problemtestbedfortheMC-VRP.
  • Keywords
    Multi-compartment vehicle routing problem , Stochastic demands , Evolutionary algorithms , Memetic algorithms
  • Journal title
    Computers and Operations Research
  • Serial Year
    2010
  • Journal title
    Computers and Operations Research
  • Record number

    927795

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=927795