IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v160y2005i3p599-613.html
   My bibliography  Save this article

The biobjective travelling purchaser problem

Author

Listed:
  • Riera-Ledesma, Jorge
  • Salazar-Gonzalez, Juan Jose

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:160:y:2005:i:3:p:599-613
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00660-X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Singh, Kashi N. & van Oudheusden, Dirk L., 1997. "A branch and bound algorithm for the traveling purchaser problem," European Journal of Operational Research, Elsevier, vol. 97(3), pages 571-579, March.
    2. Golden, Bruce & Levy, Larry & Dahl, Roy, 1981. "Two generalizations of the traveling salesman problem," Omega, Elsevier, vol. 9(4), pages 439-441.
    3. Alves, Maria Joao & Climaco, Joao, 1999. "Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems," European Journal of Operational Research, Elsevier, vol. 117(3), pages 565-577, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Palomo-Martínez, Pamela J. & Salazar-Aguilar, M. Angélica, 2019. "The bi-objective traveling purchaser problem with deliveries," European Journal of Operational Research, Elsevier, vol. 273(2), pages 608-622.
    2. Carolina Almeida & Richard Gonçalves & Elizabeth Goldbarg & Marco Goldbarg & Myriam Delgado, 2012. "An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem," Annals of Operations Research, Springer, vol. 199(1), pages 305-341, October.
    3. Miriam Enzi & Sophie N. Parragh & Jakob Puchinger, 2022. "The bi-objective multimodal car-sharing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 307-348, June.
    4. Markus Leitner & Ivana Ljubić & Markus Sinnl, 2015. "A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 118-134, February.
    5. Jaehn, Florian & Meissner, Finn, 2022. "The rebound effect in transportation," Omega, Elsevier, vol. 108(C).
    6. Caballero, William N. & Lunday, Brian J. & Meissner, Finn, 2024. "Regulating the rebound effect in the traveling purchaser problem," European Journal of Operational Research, Elsevier, vol. 317(3), pages 660-677.
    7. 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.
    8. Pablo A. Miranda-Gonzalez & Javier Maturana-Ross & Carola A. Blazquez & Guillermo Cabrera-Guerrero, 2021. "Exact Formulation and Analysis for the Bi-Objective Insular Traveling Salesman Problem," Mathematics, MDPI, vol. 9(21), pages 1-33, October.
    9. Karsu, Özlem & Kocaman, Ayse Selin, 2021. "Towards the Sustainable Development Goals: A Bi-objective framework for electricity access," Energy, Elsevier, vol. 216(C).
    10. Bérubé, Jean-François & Gendreau, Michel & Potvin, Jean-Yves, 2009. "An exact [epsilon]-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits," European Journal of Operational Research, Elsevier, vol. 194(1), pages 39-50, April.
    11. 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.

    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.
    1. Jaehn, Florian & Meissner, Finn, 2022. "The rebound effect in transportation," Omega, Elsevier, vol. 108(C).
    2. 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.
    3. Goldbarg, M.C. & Bagi, L.B. & Goldbarg, E.F.G., 2009. "Transgenetic algorithm for the Traveling Purchaser Problem," European Journal of Operational Research, Elsevier, vol. 199(1), pages 36-45, November.
    4. Gilbert Laporte & Jorge Riera-Ledesma & Juan-José Salazar-González, 2003. "A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem," Operations Research, INFORMS, vol. 51(6), pages 940-951, December.
    5. Kang, Seungmo & Ouyang, Yanfeng, 2011. "The traveling purchaser problem with stochastic prices: Exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 209(3), pages 265-272, March.
    6. E. Angelelli & R. Mansini & M. Vindigni, 2009. "Exploring greedy criteria for the dynamic traveling purchaser problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 17(2), pages 141-158, June.
    7. Palomo-Martínez, Pamela J. & Salazar-Aguilar, M. Angélica, 2019. "The bi-objective traveling purchaser problem with deliveries," European Journal of Operational Research, Elsevier, vol. 273(2), pages 608-622.
    8. Riera-Ledesma, Jorge & Salazar-Gonzalez, Juan Jose, 2005. "A heuristic approach for the Travelling Purchaser Problem," European Journal of Operational Research, Elsevier, vol. 162(1), pages 142-152, April.
    9. Renaud, Jacques & Boctor, Fayez F., 1998. "An efficient composite heuristic for the symmetric generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 108(3), pages 571-584, August.
    10. Jorge Riera-Ledesma & Juan-José Salazar-González, 2006. "Solving the asymmetric traveling purchaser problem," Annals of Operations Research, Springer, vol. 144(1), pages 83-97, April.
    11. Alves, Maria Joao & Climaco, Joao, 2004. "A note on a decision support system for multiobjective integer and mixed-integer programming problems," European Journal of Operational Research, Elsevier, vol. 155(1), pages 258-265, May.
    12. Carolina Almeida & Richard Gonçalves & Elizabeth Goldbarg & Marco Goldbarg & Myriam Delgado, 2012. "An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem," Annals of Operations Research, Springer, vol. 199(1), pages 305-341, October.
    13. Demirtas, Ezgi Aktar & Üstün, Özden, 2008. "An integrated multiobjective decision making process for supplier selection and order allocation," Omega, Elsevier, vol. 36(1), pages 76-90, February.
    14. Alves, Maria Joao & Climaco, Joao, 2007. "A review of interactive methods for multiobjective integer and mixed-integer programming," European Journal of Operational Research, Elsevier, vol. 180(1), pages 99-115, July.
    15. Mingyu Xiao & Jianan Zhang & Weibo Lin, 0. "Parameterized algorithms and complexity for the traveling purchaser problem and its variants," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-17.
    16. Alves, Maria Joao & Climaco, Joao, 2000. "An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound," European Journal of Operational Research, Elsevier, vol. 124(3), pages 478-494, August.
    17. Kataoka, Seiji & Yamada, Takeo & Morito, Susumu, 1998. "Minimum directed 1-subtree relaxation for score orienteering problem," European Journal of Operational Research, Elsevier, vol. 104(1), pages 139-153, January.
    18. 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.
    19. Mingyu Xiao & Jianan Zhang & Weibo Lin, 2022. "Parameterized algorithms and complexity for the traveling purchaser problem and its variants," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2269-2285, November.
    20. Oruc, Buse Eylul & Kara, Bahar Yetis, 2018. "Post-disaster assessment routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 76-102.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:160:y:2005:i:3:p:599-613. 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.