A genetic algorithm for the multi-compartment vehicle routing problem with stochastic demands and flexible compartment sizes

DOI10.1007/978-3-031-24907-5_50zbMATH Open1547.90023MaRDI QIDQ6606580FDOQ6606580

Authors: Shabanaz Chamurally, Julia Rieck 

Publication date: 17 September 2024

Recommendations

• A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
• The multi-compartment vehicle routing problem with flexible compartment sizes
• A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
• A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes
• Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes

zbMATH Keywords

genetic algorithmstochastic demandsmulti-compartmentflexible compartment sizes

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)

Cites Work

• The multi-compartment vehicle routing problem with flexible compartment sizes
• GVR: A New Genetic Representation for the Vehicle Routing Problem
• Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions

This page was built for publication: A genetic algorithm for the multi-compartment vehicle routing problem with stochastic demands and flexible compartment sizes

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