The cumulative capacitated vehicle routing problem with profits under uncertainty

DOI10.1007/978-3-030-34960-8_28MaRDI QIDQ2216014zbMATH OpenOpenAlexFDO

Authors Samuel Nucamendi-Guillén, Sara Khodaparasti, Maria Elena Bruni, Patrizia Beraldi

Publication date 15 December 2020

Full work available at URL https://doi.org/10.1007/978-3-030-34960-8_28

zbMATH Keywords

uncertaintymetaheuristicVRP with profitscumulative capacitated VRP

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Nonlinear programming (90C30) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Recommendations

• A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits
• The risk-averse traveling repairman problem with profits
• The Vehicle Routing Problem with Stochastic Travel Times
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
• A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem

Cited in

(4)

• The vehicle routing problem with profits and consistency constraints
• New formulations and solution approaches for the latency location routing problem
• A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
• A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits

This page was built for publication: The cumulative capacitated vehicle routing problem with profits under uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2216014)