Heuristics for a Stochastic and Dynamic Routing Problem in Industrial Shipping
Recent years have shown that static and deterministic vehicle routing problems can be solved to near optimality with acceptable computational times using metaheuristics. However, many real world applications are dynamic and include stochastic aspects, such as unknown future customer requests. Research has revealed that explicitly taking into account available stochastic information may yield benefits in these cases. Extending this research to industrial shipping, three different heuristics are considered and evaluated in terms of their ability to minimize transportation costs in this dynamic maritime planning problem.
Maritime transportation Scenario Simulation Tabu Search
Lars Magnus Hvattum Gregorio Tirado Kjetil Fagerholt Jean-Fran(c)ois Cordeau
Norwegian University of Science and Technology, Trondheim, Norway Universidad Complutense, Madrid, Spain HEC Montréal, Montréal, Canada
国际会议
上海
英文
387-388
2010-12-10（万方平台首次上网日期，不代表论文的发表时间）