Comparing mathematical and a metaheuristic method for vehicle routing problem with uncertain demand

zbMATH Open1191.90008MaRDI QIDQ3575644FDOQ3575644

Authors: B. F. Moghadam, Seyed Jafar Sadjadi, S. Mohammad Seyed-Hosseini 

Publication date: 28 July 2010

Recommendations

• scientific article; zbMATH DE number 6545534
• The robust capacitated vehicle routing problem under demand uncertainty
• Robust optimization of a broad class of heterogeneous vehicle routing problems under demand uncertainty
• The capacitated vehicle routing problem with evidential demands: a belief-constrained programming approach
• A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands

Mathematics Subject Classification ID

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

This page was built for publication: Comparing mathematical and a metaheuristic method for vehicle routing problem with uncertain demand

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