Scholarlink

The Multi-Compartment Vehicle Routing Problem (MCVRP) with stochastic customers (MC-VRPSC) is a complex and dynamic variant of the classic Vehicle Routing Problem (VRP), essential for industries requiring simultaneous delivery of multiple types of goods with uncertain demands. This study explores novel extensions of the MCVRP, addressing customer-presence uncertainty and multi-compartment constraints. A stochastic programming model based on Monte Carlo simulation and scenario analysis is proposed. To solve this problem, a hybridized simulated annealing (HSA) algorithm is introduced, optimizing vehicle routing to minimize total travel distance or cost while meeting all delivery requirements.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A Hybridized Simulated Annealing Algorithm for Solving the Multi-compartment Vehicle Routing Problem with Stochastic Customers

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Chaymaa Beneich,
  • Sidi Mohamed Douiri

摘要

The Multi-Compartment Vehicle Routing Problem (MCVRP) with stochastic customers (MC-VRPSC) is a complex and dynamic variant of the classic Vehicle Routing Problem (VRP), essential for industries requiring simultaneous delivery of multiple types of goods with uncertain demands. This study explores novel extensions of the MCVRP, addressing customer-presence uncertainty and multi-compartment constraints. A stochastic programming model based on Monte Carlo simulation and scenario analysis is proposed. To solve this problem, a hybridized simulated annealing (HSA) algorithm is introduced, optimizing vehicle routing to minimize total travel distance or cost while meeting all delivery requirements.