An exact [epsilon]-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Laumanns, Marco & Thiele, Lothar & Zitzler, Eckart, 2006. "An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method," European Journal of Operational Research, Elsevier, vol. 169(3), pages 932-942, March.
- Serpil Say{i}n & Panos Kouvelis, 2005. "The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm," Management Science, INFORMS, vol. 51(10), pages 1572-1581, October.
- JosÉ Figueira & Salvatore Greco & Matthias Ehrogott, 2005. "Multiple Criteria Decision Analysis: State of the Art Surveys," International Series in Operations Research and Management Science, Springer, number 978-0-387-23081-8, April.
- Riera-Ledesma, Jorge & Salazar-Gonzalez, Juan Jose, 2005. "The biobjective travelling purchaser problem," European Journal of Operational Research, Elsevier, vol. 160(3), pages 599-613, February.
- Ted Ralphs & Matthew Saltzman & Margaret Wiecek, 2006. "An improved algorithm for solving biobjective integer programs," Annals of Operations Research, Springer, vol. 147(1), pages 43-70, October.
- Dominique Feillet & Pierre Dejax & Michel Gendreau, 2005. "Traveling Salesman Problems with Profits," Transportation Science, INFORMS, vol. 39(2), pages 188-205, May.
- Namorado Climaco, Joao Carlos & Queiros Vieira Martins, Ernesto, 1982. "A bicriterion shortest path algorithm," European Journal of Operational Research, Elsevier, vol. 11(4), pages 399-404, December.
- Eugene L. Lawler, 1972. "A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem," Management Science, INFORMS, vol. 18(7), pages 401-405, March.
- Panos Kouvelis & Serpil Sayın, 2006. "Algorithm robust for the bicriteria discrete optimization problem," Annals of Operations Research, Springer, vol. 147(1), pages 71-85, October.
- Matteo Fischetti & Juan José Salazar González & Paolo Toth, 1998. "Solving the Orienteering Problem through Branch-and-Cut," INFORMS Journal on Computing, INFORMS, vol. 10(2), pages 133-148, May.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- David Bergman & Merve Bodur & Carlos Cardonha & Andre A. Cire, 2022. "Network Models for Multiobjective Discrete Optimization," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 990-1005, March.
- Angelo Aliano Filho & Antonio Carlos Moretti & Margarida Vaz Pato & Washington Alves Oliveira, 2021. "An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems," Annals of Operations Research, Springer, vol. 296(1), pages 35-69, January.
- Kerstin Dächert & Kathrin Klamroth, 2015. "A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems," Journal of Global Optimization, Springer, vol. 61(4), pages 643-676, April.
- Miranda, Pablo A. & Blazquez, Carola A. & Obreque, Carlos & Maturana-Ross, Javier & Gutierrez-Jarpa, Gabriel, 2018. "The bi-objective insular traveling salesman problem with maritime and ground transportation costs," European Journal of Operational Research, Elsevier, vol. 271(3), pages 1014-1036.
- Kobeaga, Gorka & Rojas-Delgado, Jairo & Merino, María & Lozano, Jose A., 2024. "A revisited branch-and-cut algorithm for large-scale orienteering problems," European Journal of Operational Research, Elsevier, vol. 313(1), pages 44-68.
- Ioanna Makarouni & John Psarras & Eleftherios Siskos, 2015. "Interactive bicriterion decision support for a large scale industrial scheduling system," Annals of Operations Research, Springer, vol. 227(1), pages 45-61, April.
- Kirlik, Gokhan & Sayın, Serpil, 2014. "A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems," European Journal of Operational Research, Elsevier, vol. 232(3), pages 479-488.
- Klamroth, Kathrin & Köbis, Elisabeth & Schöbel, Anita & Tammer, Christiane, 2017. "A unified approach to uncertain optimization," European Journal of Operational Research, Elsevier, vol. 260(2), pages 403-420.
- Manerba, Daniele & Mansini, Renata & Riera-Ledesma, Jorge, 2017. "The Traveling Purchaser Problem and its variants," European Journal of Operational Research, Elsevier, vol. 259(1), pages 1-18.
- Gunawan, Aldy & Lau, Hoong Chuin & Vansteenwegen, Pieter, 2016. "Orienteering Problem: A survey of recent variants, solution approaches and applications," European Journal of Operational Research, Elsevier, vol. 255(2), pages 315-332.
- Stacey Faulkenberg & Margaret Wiecek, 2012. "Generating equidistant representations in biobjective programming," Computational Optimization and Applications, Springer, vol. 51(3), pages 1173-1210, April.
- Hartillo-Hermoso, María Isabel & Jiménez-Tafur, Haydee & Ucha-Enríquez, José María, 2020. "An exact algebraic ϵ-constraint method for bi-objective linear integer programming based on test sets," European Journal of Operational Research, Elsevier, vol. 282(2), pages 453-463.
- Mohammad S. Roni & Sandra D. Eksioglu & Kara G. Cafferty & Jacob J. Jacobson, 2017. "A multi-objective, hub-and-spoke model to design and manage biofuel supply chains," Annals of Operations Research, Springer, vol. 249(1), pages 351-380, February.
- Natashia Boland & Hadi Charkhgard & Martin Savelsbergh, 2015. "A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method," INFORMS Journal on Computing, INFORMS, vol. 27(4), pages 735-754, November.
- Lanah Evers & Twan Dollevoet & Ana Barros & Herman Monsuur, 2014. "Robust UAV mission planning," Annals of Operations Research, Springer, vol. 222(1), pages 293-315, November.
- Gorka Kobeaga & María Merino & Jose A. Lozano, 2021. "On solving cycle problems with Branch-and-Cut: extending shrinking and exact subcycle elimination separation algorithms," Annals of Operations Research, Springer, vol. 305(1), pages 107-136, October.
- Bulhões, Teobaldo & Hà, Minh Hoàng & Martinelli, Rafael & Vidal, Thibaut, 2018. "The vehicle routing problem with service level constraints," European Journal of Operational Research, Elsevier, vol. 265(2), pages 544-558.
- Bian, Zheyong & Liu, Xiang, 2018. "A real-time adjustment strategy for the operational level stochastic orienteering problem: A simulation-aided optimization approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 115(C), pages 246-266.
- Erdogan, Günes & Cordeau, Jean-François & Laporte, Gilbert, 2010. "The Attractive Traveling Salesman Problem," European Journal of Operational Research, Elsevier, vol. 203(1), pages 59-69, May.
- Alexander Engau, 2017. "Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 119-134, January.
More about this item
Keywords
Bi-objective combinatorial optimization [epsilon]-constraint problem Pareto front Branch-and-cut Traveling Salesman Problem with Profits;Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:194:y:2009:i:1:p:39-50. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.