In this work, we consider the internal logistics processes in the car assembling company SEAT S.A (where SEAT is Sociedad Española de Automóviles de Turismo). We focus on the design of the supplying routes from the warehouse toward the workstations along a production line. The in-house logistics routing problem (ILRP) can be seen as an extension of the classical vehicle routing problem considering special features such as long-term fixed routes, unknown orders, backorders, and homogeneous fleet. To solve the ILRP, we propose an integer linear programming (ILP) model and a simulation-based iterated local search (SimILS) algorithm. We conduct two computational experiments. The first experiment analyzes the methods' performance, and the second experiment compares the SimILS results with the current company's routes, considering real data provided by SEAT S.A. The results show that the SimILS provides the best overall results overcoming both the ILP approach and the current company's solution, leading to a significant improvement in the company's processes.

中文翻译：

---

内部物流路线问题

在这项工作中，我们考虑了汽车装配公司 SEAT SA（其中 SEAT 是 Sociedad Española de Automóviles de Turismo）的内部物流流程。我们专注于设计从仓库到生产线工作站的供应路线。内部物流路线问题（ILRP）可以看作是经典车辆路线问题的扩展，考虑了长期固定路线、未知订单、延期交货和同质车队等特殊特征。为了解决 ILRP，我们提出了整数线性规划 (ILP) 模型和基于仿真的迭代局部搜索 (SimILS) 算法。我们进行了两个计算实验。第一个实验分析方法的性能，第二个实验将 SimILS 结果与当前公司的路线进行比较，