The mixed capacitated general routing problem (MCGRP) is defined over a mixed graph, for which some nodes, arcs, and edges must be serviced. The problem consists of determining a set of routes of minimum cost that satisfy the demand. Some problems like salt spreading have a time‐dependent demand which was ignored in the previous studies. This variation of demand is due to the weather or traffic conditions. This study presents a mixed integer programming model without graph transformation to node routing. We use CPLEX to solve small instances and we develop a Slack Induction by String Removals metaheuristic for large instances adapted to this problem. The proposed model and metaheuristic were tested on problems derived from a set of classical instances of the MCGRP with some modifications to include time‐dependent demands.

中文翻译：

---

具有时间依赖需求的混合容量一般路由问题

混合容量通用路由问题（MCGRP）是在混合图上定义的，必须为其提供某些节点，弧和边的服务。问题在于确定满足需求的一组最低成本的路线。诸如撒盐之类的一些问题具有随时间变化的需求，在先前的研究中忽略了这些问题。需求的变化是由于天气或交通状况造成的。这项研究提出了一种混合整数规划模型，该模型没有图转换为节点路由。我们使用CPLEX解决小型实例，并针对适应此问题的大型实例开发了通过“字符串移除”元启发式的松弛归纳法。在从MCGRP的一组经典实例衍生而来的问题上进行了测试，对所提出的模型和元启发式方法进行了一些修改，以包括随时间变化的需求。