We 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 profit. The merchant ships commodities of his own choice in a van of fixed 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 profit he makes. We 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. We 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 finding 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. We present computational results on data sets derived from our main instance of the Van Gend & Loos pickup and delivery problem. 1
|
5824
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 1990
|
|
1587
|
Computational Complexity
– Papadimitriou
- 1994
|
|
971
|
Theory of Linear and Integer Programming
– Schrijver
- 1986
|
|
804
|
Combinatorial Optimization: Algorithms and Complexity
– Papadimitriou, Steiglitz
- 1982
|
|
782
|
Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics 2. SpringerVerlag
– Grötschel, Lovász, et al.
- 1988
|
|
731
|
Integer and Combinatorial Optimization
– Nemhauser, Wolsey
- 1988
|
|
658
|
A Note on Two Problems in Connexion with Graphs. Numerische Mathematik
– Dijkstra
- 1959
|
|
364
|
Network Flows
– Ahuja, Magnanti, et al.
- 1993
|
|
273
|
The Traveling Salesman problem
– Lawler, Lenstra
- 1984
|
|
215
|
The Traveling Salesman Problem: A Case Study in Local Optimization
– Johnson, McGeoch
- 1997
|
|
162
|
Multi-commodity network flows
– Hu
- 1963
|
|
132
|
Integer Programming
– Wolsey
- 1998
|
|
97
|
A Tabu Search heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
– Gendreau, Laporte, et al.
- 1996
|
|
96
|
Solving Large-Scale Zero-One Linear Programming Problems
– Crowder, Johnson, et al.
- 1982
|
|
83
|
An Analysis of Several Heuristics for the Traveling Salesman Problem
– Rosenkrantz, Stearns, et al.
- 1977
|
|
77
|
On the facial structure of set packing polyhedra
– Padberg
- 1973
|
|
62
|
The prize collecting traveling salesman problem. Networks
– Balas
- 1989
|
|
48
|
Facets of the knapsack polytope
– Balas
- 1975
|
|
40
|
Faces for a linear inequality in 0-1 variables
– Wolsey
- 1975
|
|
37
|
A faster algorithm for finding the minimum cut in a graph
– Hao, Orlin
- 1992
|
|
32
|
Polyhedral theory
– Grotschel, Padberg
- 1985
|
|
29
|
A computational study of search strategies for mixed integer programming
– Linderoth, Savelsbergh
- 1999
|
|
27
|
Facet identification for the symmetric traveling salesman polytope
– Padberg, Rinaldi
- 1990
|
|
25
|
Lifted cover inequalities for 0-1 integer programs: Complexity
– Gu, Nemhauser, et al.
- 1999
|
|
23
|
Facets of regular 0-1 polytopes
– Hammer, Johnson, et al.
- 1975
|
|
21
|
Solving mixed integer programming problems using automatic reformulation
– Roy, Wolsey
- 1987
|
|
20
|
Vehicle routing: Handling edge exchanges
– Kindervater, Savelsbergh
- 1997
|
|
20
|
On the 0/1 knapsack polytope
– Weismantel
- 1997
|
|
18
|
Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time
– Fleischer
- 1999
|
|
15
|
The circuit polytope: facets
– Bauer
- 1997
|
|
11
|
On the separation of maximally violated mod-kcuts
– Caprara, Fischetti, et al.
|
|
11
|
Computational Complexity
– Johnson, Papadimitriou
- 1985
|
|
9
|
Selected Applications of Integer Programming: A Computational Study
– Verweij
- 2000
|
|
6
|
Valid inequalities for mixed integer programs with generalised and variable upper bound constraints
– Wolsey
- 1990
|
|
3
|
A Branch and Cut approach to the Cardinality Constrained Circuit Problem
– Bauer, Linderoth, et al.
- 1998
|
|
1
|
Lifted cycle inequalities for the asymmetric traveling salesman problem
– Balas, Fischetti
- 1999
|
|
1
|
On the structure of all minimum cuts in networks
– Picard, Queranne
- 1980
|
|
