Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Inventory routing problems combine the optimization of product deliveries (or pickups) with inventory control at customer sites. The application that motivates this paper concerns the planning of single-product pickups over time; each site accumulates stock at a deterministic rate; the stock is emptied on each visit. At the tactical planning stage considered here, the objective is to minimize a surrogate measure of routing cost while achieving some form of regional clustering by partitioning the sites beten the vehicles. The fleet size is given but can potentially be reduced. Planning consists of assigning customers to vehicles in each time period, but the routing, i.e., the actual sequence in which vehicles visit customers, is considered an “operational” decision. The planning is due to be repeated over the time horizon with constrained periodicity.  develop a truncated branch-and-price-and-cut algorithm combined with rounding and local search heuristics that yield both primal solutions and dual boun...
['Sophie Michel', 'François Vanderbeck']
I am writing a research paper on a idea A Column-Generation Based Tactical Planning Method for Inventory Routing
[{"from": "human", "value": "I am writing a research paper on a idea A Column-Generation Based Tactical Planning Method for Inventory Routing"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Inventory routing problems combine the optimization of product deliveries (or pickups) with inventory control at customer sites. The application that motivates this paper concerns the planning of single-product pickups over time; each site accumulates stock at a deterministic rate; the stock is emptied on each visit. At the tactical planning stage considered here, the objective is to minimize a surrogate measure of routing cost while achieving some form of regional clustering by partitioning the sites beten the vehicles. The fleet size is given but can potentially be reduced. Planning consists of assigning customers to vehicles in each time period, but the routing, i.e., the actual sequence in which vehicles visit customers, is considered an \u201coperational\u201d decision. The planning is due to be repeated over the time horizon with constrained periodicity.  develop a truncated branch-and-price-and-cut algorithm combined with rounding and local search heuristics that yield both primal solutions and dual boun..."}]