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

The distance constrained multiple vehicle traveling purchaser problem

Author

Listed:
  • Bianchessi, N.
  • Mansini, R.
  • Speranza, M.G.

Abstract

In the Distance Constrained Multiple Vehicle Traveling Purchaser Problem (DC-MVTPP) a fleet of vehicles is available to visit suppliers offering products at different prices and with different quantity availabilities. The DC-MVTPP consists in selecting a subset of suppliers so to satisfy products demand at the minimum traveling and purchasing costs, while ensuring that the distance traveled by each vehicle does not exceed a predefined upper bound. The problem generalizes the classical Traveling Purchaser Problem (TPP) and adds new realistic features to the decision problem. In this paper we present different mathematical programming formulations for the problem. A branch-and-price algorithm is also proposed to solve a set partitioning formulation where columns represent feasible routes for the vehicles. At each node of the branch-and-bound tree, the linear relaxation of the set partitioning formulation, augmented by the branching constraints, is solved through column generation. The pricing problem is solved using dynamic programming. A set of instances has been derived from benchmark instances for the asymmetric TPP. Instances with up to 100 suppliers and 200 products have been solved to optimality.

Suggested Citation

  • Bianchessi, N. & Mansini, R. & Speranza, M.G., 2014. "The distance constrained multiple vehicle traveling purchaser problem," European Journal of Operational Research, Elsevier, vol. 235(1), pages 73-87.
    • Handle: RePEc:eee:ejores:v:235:y:2014:i:1:p:73-87
    DOI: 10.1016/j.ejor.2013.10.018
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221713008412
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2013.10.018?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. 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.
    2. Zhang, Ju-liang & Zhang, Ming-yu, 2011. "Supplier selection and purchase problem with fixed cost and constrained order quantities under stochastic demand," International Journal of Production Economics, Elsevier, vol. 129(1), pages 1-7, January.
    3. 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.
    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. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    6. Mansini, Renata & Savelsbergh, Martin W.P. & Tocchella, Barbara, 2012. "The supplier selection problem with quantity discounts and truckload shipping," Omega, Elsevier, vol. 40(4), pages 445-455.
    7. Stefan Irnich & Daniel Villeneuve, 2006. "The Shortest-Path Problem with Resource Constraints and k -Cycle Elimination for k (ge) 3," INFORMS Journal on Computing, INFORMS, vol. 18(3), pages 391-406, August.
    8. Chauhan, Satyaveer Singh & Proth, Jean-Marie, 2003. "The concave cost supply problem," European Journal of Operational Research, Elsevier, vol. 148(2), pages 374-383, July.
    9. Moshe Dror, 1994. "Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW," Operations Research, INFORMS, vol. 42(5), pages 977-978, October.
    10. Meir J. Rosenblatt & Yale T. Herer & Ilan Hefter, 1998. "Note. An Acquisition Policy for a Single Item Multi-Supplier System," Management Science, INFORMS, vol. 44(11-Part-2), pages 96-100, November.
    11. Manerba, Daniele & Mansini, Renata, 2012. "An exact algorithm for the Capacitated Total Quantity Discount Problem," European Journal of Operational Research, Elsevier, vol. 222(2), pages 287-300.
    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. Zahra Sadat Hasanpour Jesri & Kourosh Eshghi & Majid Rafiee & Tom Van Woensel, 2022. "The Multi-Depot Traveling Purchaser Problem with Shared Resources," Sustainability, MDPI, vol. 14(16), pages 1-26, August.
    2. 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.
    3. Nicola Bianchessi & Stefan Irnich & Christian Tilk, 2020. "A Branch-Price-and-Cut Algorithm for the Capacitated Multiple Vehicle Traveling Purchaser Problem with Unitary Demand," Working Papers 2003, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    4. Archetti, Claudia & Bertazzi, Luca & Laganà, Demetrio & Vocaturo, Francesca, 2017. "The Undirected Capacitated General Routing Problem with Profits," European Journal of Operational Research, Elsevier, vol. 257(3), pages 822-833.
    5. E. Angelelli & R. Mansini & M. Vindigni, 2016. "The Stochastic and Dynamic Traveling Purchaser Problem," Transportation Science, INFORMS, vol. 50(2), pages 642-658, May.
    6. Gambella, Claudio & Maggioni, Francesca & Vigo, Daniele, 2019. "A stochastic programming model for a tactical solid waste management problem," European Journal of Operational Research, Elsevier, vol. 273(2), pages 684-694.
    7. Jaehn, Florian & Meissner, Finn, 2022. "The rebound effect in transportation," Omega, Elsevier, vol. 108(C).
    8. 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.
    9. 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.
    10. Gendreau, Michel & Manerba, Daniele & Mansini, Renata, 2016. "The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach," European Journal of Operational Research, Elsevier, vol. 248(1), pages 59-71.
    11. 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.
    12. Mohammad Khosroabadi & Jafar Gheidar-Kheljani & Mohammad Hosein Karimi Gavareshki, 2024. "Utilizing Multi-vehicle Traveling Purchaser Problem for Multiple-Supplier Selection and Multi-period Lot-Sizing in a Fuzzy Demand Environment," SN Operations Research Forum, Springer, vol. 5(4), pages 1-28, December.
    13. Ruslan Sadykov & François Vanderbeck & Artur Pessoa & Issam Tahiri & Eduardo Uchoa, 2019. "Primal Heuristics for Branch and Price: The Assets of Diving Methods," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 251-267, April.

    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. Manerba, Daniele & Mansini, Renata, 2012. "An exact algorithm for the Capacitated Total Quantity Discount Problem," European Journal of Operational Research, Elsevier, vol. 222(2), pages 287-300.
    2. Mansini, Renata & Savelsbergh, Martin W.P. & Tocchella, Barbara, 2012. "The supplier selection problem with quantity discounts and truckload shipping," Omega, Elsevier, vol. 40(4), pages 445-455.
    3. 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.
    4. Ali Ekici & Baṣak Altan & Okan Örsan Özener, 2016. "Pricing decisions in a strategic single retailer/dual suppliers setting under order size constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 54(7), pages 1887-1898, April.
    5. Jaehn, Florian & Meissner, Finn, 2022. "The rebound effect in transportation," Omega, Elsevier, vol. 108(C).
    6. Li, Zhaolin & Ou, Jinwen & Liang, Guitian, 2021. "Optimizing hospital drug procurement with rebate contracts," Omega, Elsevier, vol. 105(C).
    7. Stefan Irnich & Guy Desaulniers & Jacques Desrosiers & Ahmed Hadjar, 2010. "Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 297-313, May.
    8. Miao Yu & Viswanath Nagarajan & Siqian Shen, 2022. "Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 953-973, March.
    9. Manerba, Daniele & Mansini, Renata & Perboli, Guido, 2018. "The Capacitated Supplier Selection problem with Total Quantity Discount policy and Activation Costs under uncertainty," International Journal of Production Economics, Elsevier, vol. 198(C), pages 119-132.
    10. Guy Desaulniers & Diego Pecin & Claudio Contardo, 2019. "Selective pricing in branch-price-and-cut algorithms for vehicle routing," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(2), pages 147-168, June.
    11. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    12. Guy Desaulniers & François Lessard & Ahmed Hadjar, 2008. "Tabu Search, Partial Elementarity, and Generalized k -Path Inequalities for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 42(3), pages 387-404, August.
    13. Yang, Liu & Millstein, Mitch A. & Campbell, James F., 2022. "Unlocking cost savings hidden in hospital tier contracts," Omega, Elsevier, vol. 113(C).
    14. Tan, Tarkan & Alp, Osman, 2016. "Optimal sourcing from alternative capacitated suppliers with general cost structures," Omega, Elsevier, vol. 58(C), pages 26-32.
    15. Mads Jepsen & Bjørn Petersen & Simon Spoorendonk & David Pisinger, 2008. "Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows," Operations Research, INFORMS, vol. 56(2), pages 497-511, April.
    16. Bode, Claudia & Irnich, Stefan, 2014. "The shortest-path problem with resource constraints with (k,2)-loop elimination and its application to the capacitated arc-routing problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 415-426.
    17. Faiza Hamdi & Ahmed Ghorbel & Faouzi Masmoudi & Lionel Dupont, 2018. "Optimization of a supply portfolio in the context of supply chain risk management: literature review," Journal of Intelligent Manufacturing, Springer, vol. 29(4), pages 763-788, April.
    18. Bani, Abderrahman & El Hallaoui, Issmail & Corréa, Ayoub Insa & Tahir, Adil, 2023. "Solving a real-world multi-depot multi-period petrol replenishment problem with complex loading constraints," European Journal of Operational Research, Elsevier, vol. 311(1), pages 154-172.
    19. Jiliu Li & Zhixing Luo & Roberto Baldacci & Hu Qin & Zhou Xu, 2023. "A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 31-49, January.
    20. Dollevoet, T.A.B. & Pecin, D. & Spliet, R., 2020. "The path programming problem and a partial path relaxation," Econometric Institute Research Papers EI-2020-04, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.

    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:235:y:2014:i:1:p:73-87. 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.