An extended robust approach for a cooperative inventory routing problem
作者：
Highlights：
• Using geographical location in distance matrixes cause extra optimization process.
• The result of solved mixed integer programing is the input for metaheuristics.
• Ant colony algorithm is selected metaheuristic for applying in promotion stage.
• Horizontal collaboration of suppliers would lead to cost saving for these agents.
• Shapley value and tau value are reliable payoff sharing technique for the problem.
摘要
•Using geographical location in distance matrixes cause extra optimization process.•The result of solved mixed integer programing is the input for metaheuristics.•Ant colony algorithm is selected metaheuristic for applying in promotion stage.•Horizontal collaboration of suppliers would lead to cost saving for these agents.•Shapley value and tau value are reliable payoff sharing technique for the problem.
论文关键词：Cooperative game theory,Robust inventory routing problem,Demand uncertainty,Metaheuristic algorithms,Simulated annealing,Genetic algorithm,Ant colony algorithm
论文评审过程：Received 2 May 2018, Revised 1 September 2018, Accepted 1 September 2018, Available online 14 September 2018, Version of Record 21 September 2018.
论文官网地址：https://doi.org/10.1016/j.eswa.2018.09.002
