点击次数：

发布时间：2019-03-11

论文类型：会议论文

发表时间：2016-09-05

收录刊物：SCIE、CPCI-S、EI

卷号：96

页面范围：1211-1220

关键字：perishable food distribution; freshness; MO-VRPTW-P; temporal-spatial distance; VNS; genetic algorithm

摘要：For perishable food products, customer satisfaction mainly reflects on the freshness. Due to the highly value lost in the distribution process, the complexity of perishable food vehicle routing problem increases. So it is important to design an effective distribution route that can minimize the total costs and maximize the freshness state of the delivered products. We propose a multi-objective vehicle routing problem with time windows dealing with Perishability (MO-VRPTW-P). A two-phase heuristic algorithm based on Pareto variable neighborhood search-genetic algorithm considering temporal-spatial distance (STVNS-GA) is applied to solve the problem. Several numerical examples are presented. The results illustrate that the algorithm is effective and efficient. (C) 2016 The Authors. Published by Elsevier B.V.