On solving the multi-vehicle routing problem with stochastic demand: mathematical formulations and efficient heuristics
碩士 === 國立成功大學 === 工業與資訊管理學系碩博士班 === 95 === We consider the multi-vehicle routing problem, in which demands of customers are stochastic. Due to this randomness, a vehicle may fail to satisfy the demand of some customers when accumulated demands of customers in a designated route exceed the capacity...
Main Authors: | Yu-hsin Hsu, 許玉欣 |
---|---|
Other Authors: | Shine-Der Lee |
Format: | Others |
Language: | zh-TW |
Published: |
2007
|
Online Access: | http://ndltd.ncl.edu.tw/handle/09090590870878908328 |
Similar Items
-
Sim-heuristic algorithms for Robust Vehicle Routing Problem with Stochastic Demand
by: Almutairi, Abdulwahab
Published: (2016) -
A Three-phase Efficient Heuristic for Solving the Multi-compartment Vehicle Routing Problem
by: Yi-ChunYao, et al.
Published: (2014) -
An efficient meta-heuristic algorithm for solving capacitated vehicle routing problem
by: Alfian Faiz, et al.
Published: (2018-11-01) -
An efficient heuristic for the multi-compartment vehicle routing problem
by: Silvestrin, Paulo Vitor
Published: (2016) -
An efficient heuristic for the multi-compartment vehicle routing problem
by: Silvestrin, Paulo Vitor
Published: (2016)