Key Laboratory of Special Equipment Manufacturing and Advanced Processing Technology, Ministry of Education, Zhejiang University of Technology, Hangzhou 310023, China.
Int J Environ Res Public Health. 2019 Jun 11;16(11):2064. doi: 10.3390/ijerph16112064.
In this paper, we consider a variant of the location-routing problem (LRP), namely the the multiobjective regional low-carbon LRP (MORLCLRP). The MORLCLRP seeks to minimize service duration, client waiting time, and total costs, which includes carbon emission costs and total depot, vehicle, and travelling costs with respect to fuel consumption, and considers three practical constraints: simultaneous pickup and delivery, heterogeneous fleet, and hard time windows. We formulated a multiobjective mixed integer programming formulations for the problem under study. Due to the complexity of the proposed problem, a general framework, named the multiobjective hyper-heuristic approach (MOHH), was applied for obtaining Pareto-optimal solutions. Aiming at improving the performance of the proposed approach, four selection strategies and three acceptance criteria were developed as the high-level heuristic (HLH), and three multiobjective evolutionary algorithms (MOEAs) were designed as the low-level heuristics (LLHs). The performance of the proposed approach was tested for a set of different instances and comparative analyses were also conducted against eight domain-tailored MOEAs. The results showed that the proposed algorithm produced a high-quality Pareto set for most instances. Additionally, extensive analyses were also carried out to empirically assess the effects of domain-specific parameters (i.e., fleet composition, client and depot distribution, and zones area) on key performance indicators (i.e., hypervolume, inverted generated distance, and ratio of nondominated individuals). Several management insights are provided by analyzing the Pareto solutions.
在本文中,我们考虑了定位-路线问题(LRP)的一种变体,即多目标区域低碳 LRP(MORLCLRP)。MORLCLRP 的目标是最小化服务持续时间、客户等待时间和总成本,总成本包括碳排放量成本和与燃料消耗相关的总仓库、车辆和行驶成本,并考虑了三个实际约束:同时取货和送货、异质车队和硬时间窗口。我们为所研究的问题制定了一个多目标混合整数规划公式。由于所提出问题的复杂性,应用了一种名为多目标超启发式方法(MOHH)的通用框架来获得帕累托最优解。为了提高所提出方法的性能,开发了四种选择策略和三种接受标准作为高层启发式(HLH),并设计了三种多目标进化算法(MOEAs)作为低层启发式(LLHs)。我们对一组不同的实例测试了所提出方法的性能,并与八个领域定制的 MOEAs 进行了比较分析。结果表明,对于大多数实例,所提出的算法产生了高质量的帕累托解集。此外,还进行了广泛的分析,以实证评估特定领域参数(即车队组成、客户和仓库分布以及区域面积)对关键绩效指标(即超体积、生成距离的倒数和非支配个体的比例)的影响。通过分析帕累托解提供了一些管理见解。