The biobjective travelling purchaser problem

European Journal of Operational Research

Volumn 160, Issue 3, 2005, Pages 599-613

  Riera Ledesma, Jorge ^a   Salazar González, Juan José ^a  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

Combinatorial optimization; Multiple criteria analysis; Travelling salesman

Indexed keywords

ALGORITHMS; COST ACCOUNTING; HEURISTIC METHODS; LINEAR PROGRAMMING; OPTIMIZATION; SET THEORY; TRAVELING SALESMAN PROBLEM;

COMBINATORIAL OPTIMIZATION; LINEAR COMBINATION; MULTIPLE CRITERIA ANALYSIS; TRAVEL DISTANCE;

COMBINATORIAL MATHEMATICS;

EID: 4444221764     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2003.10.003     Document Type: Article

References (21)

1. Alves M.J., Clímaco J. Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems. European Journal of Operational Research. 117:1999;565-577.
2. Burstall R.M. A heuristic method for a job sequencing problem. Operational Research Quarterly. 17:1966;291-304.
3. Buzacott J.A., Dutta S.K. Sequencing many jobs on a multipurpose facility. Naval Research Logistics Quarterly. 18:1971;75-82.
4. Ehrgott M. Multicriteria Optimization. Lecture Notes in Economics and Mathematical Systems. 2000;Springer Verlag, Berlin.
5. M. Ehrgott, X. Gandibleux, An Annotated Bibliography of Multi-objective Combinatorial Optimization, Tech. Rep. 62/2000, Fachbereich Mathematik, Universitat Kaiserslutern, 2000.
6. Golden B.L., Levy L., Dahl R. Two generalizations of the traveling salesman problem. Omega. 9:1981;439-445.
7. Jünger M., Reinelt G., Rinaldi G. The traveling salesman problem. Ball M.O., Magnanti T.L., Monma C.L., Nemhauser G.L. Handbooks in Operations Research and Management Science: Network Models. 1995;North-Holland, Amsterdam. (Chapter 4).
8. Jünger M., Thienel S. Introduction to ABACUS - a branch-and-cut system. Operations Research Letters. 22:1998;83-95.
9. Karg R.L., Thompson G.L. A heuristic approach to solving traveling salesman problem. Management Science. 10:1964;225-248.
10. G. Laporte, J. Riera-Ledesma, J.J. Salazar-González, A branch-and-cut algorithm for the undirected traveling purchaser problem, Operations Research, in press.
11. Nemhauser G.L., Wolsey L. Integer and Combinatorial Optimization. 1999;John Wiley & Sons, New York.
12. Ong H.L. Approximate algorithms for the traveling purchaser problem. Operations Research Letters. 1:1982;201-205.
13. Padberg M., Rinaldi G. A branch and cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Review. 33:1991;60-100.
14. Pearn W.L., Chien R.C. Improved solutions for the traveling purchaser problem. Computers & Operations Research. 25:1998;879-885.
15. Ramesh T. Traveling purchaser problem. Opsearch. 18:1981;78-91.
16. Saigal I. Algorithms for solving the two-criterion large-scale travelling salesman problem. Computational Mathematics and Mathematical Physics. 34:1994;33-43.
17. Singh K.N., van Oudheusden D.L. A branch and bound algorithm for the traveling purchaser problem. European Journal of Operational Research. 97:1997;571-579.
18. Soland R.M. Multicriteria optimization: A general characterization of efficient solutions. Decision Sciences. 10:1979;27-38.
19. Steuer R.E. Multiple Criteria Optimization: Theory, Computation, and Application. 1986;Wiley, New York.
20. T'kindt V., Billaut J.-C., Proust C. An interactive algorithm to solve bicriteria scheduling problems on unrelated parallelmachines. European Journal of Operational Research. 135:2001;42-49.
21. Visée M., Teghem J., Pirlot M., Ulungu E. Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem. Journal of Global Optimization. 12:1998;139-155.