An optimal solution procedure for the multiple tour maximum collection problem using column generation

Computers and Operations Research

Volumn 26, Issue 4, 1999, Pages 427-441

  Butt, Steven E ^a   Ryan, David M ^b  

^a Western Michigan University   (United States)

^b UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Column generation; Constraint branching; Optimization; Traveling salesman; Vehicle routing

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING;

K-BEST SOLUTIONS; MULTIPLE TOUR MAXIMUM COLLECTION PROBLEM (MTMCP);

TRAVELING SALESMAN PROBLEM;

ALGORITHM; METHODOLOGY;

EID: 0032764836     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(98)00071-9     Document Type: Article

References (21)

1. [1] Butt SE, Cavalier TM. A heuristic for the multiple tour maximum collection problem. Computers and Operations Research 1994;21(1):101-11.
2. [2] Wu T. Optimization models for underway replenishment of a dispersed carrier battle group. Masters Thesis, Naval Postgraduate School, Monterey, California, USA, March 1992.
3. [3] Dunn JS. Scheduling underway replenishment as a generalized orienteering problem. Masters Thesis, Naval Postgraduate School, Monterey, California, USA, June 1992.
4. [4] Golden B, Assad A, Dahl R. Analysis of a large scale vehicle routing problem with an inventory component. Large Scale Systems 1984;7:181-90.
5. [5] Davis S, Ceto N. Jr, Rabb JM. A comprehensive check processing simulation model. Journal of Bank Research 1982;13:185-94.
6. [6] Golden B, Levy L, Vohra R. The orienteering problem. Naval Research Logistics 1987;34:307-18.
7. [7] Gensch DH. An industrial application of the traveling salesman's subtour problem. AIIE Transactions 1978;10(4): 362-70.
8. [8] Golden B, Levy L, Dahl R. Two generalizations of the traveling salesman problem. OMEGA 1981;9(4):439-41.
9. [9] Golden B, Wang Q, Liu L. A multifaceted heuristic for the orienteering problem. Naval Research Logistics 1988;35: 359-66.
10. [10] Tsiligirides T. Heuristic methods applied to orienteering. Journal of the Operational Research Society 1984;35(9): 797-809.
11. [11] Ramesh R, Brown K. An efficient four-phase heuristic for the generalized orienteering problem. Computers and Operations Research 1991;18(2):151-65.
12. [12] Kataoka S, Morito S. An algorithm for the single constraint maximum collection problem. Journal of the Operations Research Society of Japan 1988;31(4):515-31.
13. [13] Ramesh R, Yoon Y, Karwan M. An optimal algorithm for the orienteering tour problem. ORSA Journal on Computing 1992;4(2):155-65.
14. [14] Keller C, Goodchild M. The multiobjective vending problem: a generalization of the travelling salesman problem. Environment and Planning B: Planning and Design 1988;15:447-60.
15. [15] Balas E. The prize collecting traveling salesman problem. Networks 1989;19:621-36.
16. [16] Brideau RJ, III, Cavalier TM. The maximum collection problem with time dependent rewards. Working Paper, Department of Industrial and Manufacturing Engineering, The Pennsylvania State University, University Park, Pennsylvania, USA, 1994.
17. [17] Erkut E, Zhang J. The maximum collection problem with time dependent rewards. Working Paper, Department of Finance and Management Science, University of Alberta, Canada, February 1995.
18. [18] Ryan DM. ZIP-a zero-one integer programming package for scheduling. Research Report #CSS85, AERE, Harwell, 1980.
19. [19] Carpaneto G, Dell'amico M, Toth P. Exact solution of large-scale, asymmetric traveling salesman problems. ACM Transactions on Mathematical Software 1995;21(4);394-409.
20. [20] Ryan DM, Falkner JC. On the integer properties of scheduling set partitioning models. European Journal of Operational Research 1988;35:442-56.
21. [21] Schneider GM, Bruell SC. Concepts in data structures and software development: a text for the second course in computer science. St. Paul, MN: West Publishing Company, 1991.