数学优化
计算机科学
可扩展性
多目标优化
布线(电子设计自动化)
线性规划
帕累托原理
能量(信号处理)
进化算法
最优化问题
数学模型
帕累托最优
设施选址问题
混合算法(约束满足)
程序设计范式
作者
Bernard Atta Adjei,Sampson Takyi Appiah,Banabas Agyeman Korang,Francisca Asare-Bediako
摘要
This research addresses a multiobjective mixed‐fleet location routing problem with time windows. It combines routing, energy management, and charging infrastructure within a single mathematical framework. The problem is formulated as a mixed‐integer linear programming (MILP) model. The formulated MILP incorporates vehicle routing, time‐window constraints, and energy/fuel propagation dynamics. To solve this problem, and due to the NP‐hard nature of the proposed model, a hybrid solution methodology is developed. A multiobjective evolutionary algorithm is designed for scalable solution generation and the MILP formulation is proposed for validating solutions obtained. Computational experiments have shown the effectiveness of our approach to produce Pareto‐optimal solutions. The Pareto solutions has made it possible to analyze the trade‐offs between operational cost, infrastructure investment, and energy cost characteristics that aids on discussing the mathematical structure of integrated routing‐location problems.
科研通智能强力驱动
Strongly Powered by AbleSci AI