Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider the problem of a travelling merchant that makes money by buying commodities where they are cheap and selling them in other places where he can make a prot. The merchant ships commodities of his own choice in a van of xed capacity. Given the prices of all the commodities in all of the places, and the cost of driving from one place to another, the problem the merchant faces each day is to select a subset of the cities that he can visit in a day, and that allows him to maximise the prot he makes.  call this problem the Merchant Subtour Problem. The MSP models the pricing problem of a rather complex pickup and delivery problem that was given to us by the Dutch logistics company Van Gend & Loos.  show that a special case of the MSP has a totally unimodular constraint matrix. This knowledge enables us to develop a tabu-search algorithm for nding good feasible solutions to the MSP, and a branch-and-price-and-cut algorithm for solving the MSP to optimality. The relaxations solved in each node of the branch-and-bound tree are strengthened by lifted knapsack inequalities, lifted cycle inequalities and mod-k cuts.  present computational results on data sets derived from our main instance of the Van Gend & Loos pickup and delivery problem.
['B Bram Verweij', 'Karen Aardal']
I am writing a research paper on a idea The Merchant Subtour Problem
[{"from": "human", "value": "I am writing a research paper on a idea The Merchant Subtour Problem"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider the problem of a travelling merchant that makes money by buying commodities where they are cheap and selling them in other places where he can make a prot. The merchant ships commodities of his own choice in a van of xed capacity. Given the prices of all the commodities in all of the places, and the cost of driving from one place to another, the problem the merchant faces each day is to select a subset of the cities that he can visit in a day, and that allows him to maximise the prot he makes.  call this problem the Merchant Subtour Problem. The MSP models the pricing problem of a rather complex pickup and delivery problem that was given to us by the Dutch logistics company Van Gend & Loos.  show that a special case of the MSP has a totally unimodular constraint matrix. This knowledge enables us to develop a tabu-search algorithm for nding good feasible solutions to the MSP, and a branch-and-price-and-cut algorithm for solving the MSP to optimality. The relaxations solved in each node of the branch-and-bound tree are strengthened by lifted knapsack inequalities, lifted cycle inequalities and mod-k cuts.  present computational results on data sets derived from our main instance of the Van Gend & Loos pickup and delivery problem."}]