Branch-Price-and-Cut algorithms for the team orienteering problem with interval-varying profits
Author
Abstract
Suggested Citation
DOI: 10.1016/j.ejor.2024.07.015
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
- Li, Jiliu & Qin, Hu & Baldacci, Roberto & Zhu, Wenbin, 2020. "Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
- Roberto Baldacci & Enrico Bartolini & Aristide Mingozzi, 2011. "An Exact Algorithm for the Pickup and Delivery Problem with Time Windows," Operations Research, INFORMS, vol. 59(2), pages 414-426, April.
- Rasmussen, Matias Sevel & Justesen, Tor & Dohn, Anders & Larsen, Jesper, 2012. "The Home Care Crew Scheduling Problem: Preference-based visit clustering and temporal dependencies," European Journal of Operational Research, Elsevier, vol. 219(3), pages 598-610.
- E. Erkut & J. Zhang, 1996. "The maximum collection problem with time‐dependent rewards," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(5), pages 749-763, August.
- Roberto Roberti & Aristide Mingozzi, 2014. "Dynamic ng-Path Relaxation for the Delivery Man Problem," Transportation Science, INFORMS, vol. 48(3), pages 413-424, August.
- 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.
- Wouter Souffriau & Pieter Vansteenwegen & Greet Vanden Berghe & Dirk Van Oudheusden, 2013. "The Multiconstraint Team Orienteering Problem with Multiple Time Windows," Transportation Science, INFORMS, vol. 47(1), pages 53-63, February.
- Bruce L. Golden & Larry Levy & Rakesh Vohra, 1987. "The orienteering problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(3), pages 307-318, June.
- Hanafi, Saïd & Mansini, Renata & Zanotti, Roberto, 2020. "The multi-visit team orienteering problem with precedence constraints," European Journal of Operational Research, Elsevier, vol. 282(2), pages 515-529.
- Yu, Qinxiao & Fang, Kan & Zhu, Ning & Ma, Shoufeng, 2019. "A matheuristic approach to the orienteering problem with service time dependent profits," European Journal of Operational Research, Elsevier, vol. 273(2), pages 488-503.
- Morteza Keshtkaran & Koorush Ziarati & Andrea Bettinelli & Daniele Vigo, 2016. "Enhanced exact solution methods for the Team Orienteering Problem," International Journal of Production Research, Taylor & Francis Journals, vol. 54(2), pages 591-601, January.
- Dontas, Michael & Sideris, Georgios & Manousakis, Eleftherios G. & Zachariadis, Emmanouil E., 2023. "An adaptive memory matheuristic for the set orienteering problem," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1010-1023.
- 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.
- Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
- Wang, Zheng & Sheu, Jiuh-Biing, 2019. "Vehicle routing problem with drones," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 350-364.
- Wu, Qinghua & He, Mu & Hao, Jin-Kao & Lu, Yongliang, 2024. "An effective hybrid evolutionary algorithm for the clustered orienteering problem," European Journal of Operational Research, Elsevier, vol. 313(2), pages 418-434.
- Vansteenwegen, Pieter & Souffriau, Wouter & Oudheusden, Dirk Van, 2011. "The orienteering problem: A survey," European Journal of Operational Research, Elsevier, vol. 209(1), pages 1-10, February.
- Qinxiao Yu & Yossiri Adulyasak & Louis-Martin Rousseau & Ning Zhu & Shoufeng Ma, 2022. "Team Orienteering with Time-Varying Profit," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 262-280, January.
- Chao, I-Ming & Golden, Bruce L. & Wasil, Edward A., 1996. "The team orienteering problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 464-474, February.
- Jesse Pietz & Johannes O. Royset, 2013. "Generalized orienteering problem with resource dependent rewards," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(4), pages 294-312, June.
- Chen, Xiaoyu & Reinelt, Gerhard & Dai, Guangming & Spitz, Andreas, 2019. "A mixed integer linear programming model for multi-satellite scheduling," European Journal of Operational Research, Elsevier, vol. 275(2), pages 694-707.
- Christos Orlis & Nicola Bianchessi & Roberto Roberti & Wout Dullaert, 2020. "The Team Orienteering Problem with Overlaps: An Application in Cash Logistics," Transportation Science, INFORMS, vol. 54(2), pages 470-487, March.
- Zhixing Luo & Hu Qin & Wenbin Zhu & Andrew Lim, 2016. "Branch‐and‐price‐and‐cut for the manpower routing problem with synchronization constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(2), pages 138-171, March.
- Santini, Alberto & Plum, Christian E.M. & Ropke, Stefan, 2018. "A branch-and-price approach to the feeder network design problem," European Journal of Operational Research, Elsevier, vol. 264(2), pages 607-622.
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.- Qinxiao Yu & Yossiri Adulyasak & Louis-Martin Rousseau & Ning Zhu & Shoufeng Ma, 2022. "Team Orienteering with Time-Varying Profit," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 262-280, January.
- Wu, Qinghua & He, Mu & Hao, Jin-Kao & Lu, Yongliang, 2024. "An effective hybrid evolutionary algorithm for the clustered orienteering problem," European Journal of Operational Research, Elsevier, vol. 313(2), pages 418-434.
- Yu, Qinxiao & Fang, Kan & Zhu, Ning & Ma, Shoufeng, 2019. "A matheuristic approach to the orienteering problem with service time dependent profits," European Journal of Operational Research, Elsevier, vol. 273(2), pages 488-503.
- Christos Orlis & Nicola Bianchessi & Roberto Roberti & Wout Dullaert, 2020. "The Team Orienteering Problem with Overlaps: An Application in Cash Logistics," Transportation Science, INFORMS, vol. 54(2), pages 470-487, March.
- Dursunoglu, Cagla F. & Arslan, Okan & Demir, Sebnem Manolya & Kara, Bahar Y. & Laporte, Gilbert, 2025. "A unifying framework for selective routing problems," European Journal of Operational Research, Elsevier, vol. 320(1), pages 1-19.
- He, Mu & Wu, Qinghua & Benlic, Una & Lu, Yongliang & Chen, Yuning, 2024. "An effective multi-level memetic search with neighborhood reduction for the clustered team orienteering problem," European Journal of Operational Research, Elsevier, vol. 318(3), pages 778-801.
- Kim, Hyunjoon & Kim, Byung-In, 2022. "Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem," European Journal of Operational Research, Elsevier, vol. 303(2), pages 550-566.
- Li, Jiliu & Qin, Hu & Baldacci, Roberto & Zhu, Wenbin, 2020. "Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
- 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.
- Orlis, Christos & Laganá, Demetrio & Dullaert, Wout & Vigo, Daniele, 2020. "Distribution with Quality of Service Considerations: The Capacitated Routing Problem with Profits and Service Level Requirements," Omega, Elsevier, vol. 93(C).
- Zhang, Guowei & Jia, Ning & Zhu, Ning & Adulyasak, Yossiri & Ma, Shoufeng, 2023. "Robust drone selective routing in humanitarian transportation network assessment," European Journal of Operational Research, Elsevier, vol. 305(1), pages 400-428.
- Yang, Yu & Yan, Chiwei & Cao, Yufeng & Roberti, Roberto, 2023. "Planning robust drone-truck delivery routes under road traffic uncertainty," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1145-1160.
- Kadri Sylejmani & Vigan Abdurrahmani & Arben Ahmeti & Egzon Gashi, 2024. "Solving the tourist trip planning problem with attraction patterns using meta-heuristic techniques," Information Technology & Tourism, Springer, vol. 26(4), pages 633-678, December.
- Shima Azizi & Özge Aygül & Brenton Faber & Sharon Johnson & Renata Konrad & Andrew C. Trapp, 2023. "Select, route and schedule: optimizing community paramedicine service delivery with mandatory visits and patient prioritization," Health Care Management Science, Springer, vol. 26(4), pages 719-746, December.
- Yu, Bin & Shan, Wenxuan & Sheu, Jiuh-Biing & Diabat, Ali, 2022. "Branch-and-price for a combined order selection and distribution problem in online community group-buying of perishable products," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 341-373.
- Michael D. Moskal & Erdi Dasdemir & Rajan Batta, 2023. "Unmanned Aerial Vehicle Information Collection Missions with Uncertain Characteristics," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 120-137, January.
- Antonio R. Uguina & Juan F. Gomez & Javier Panadero & Anna Martínez-Gavara & Angel A. Juan, 2024. "A Learnheuristic Algorithm Based on Thompson Sampling for the Heterogeneous and Dynamic Team Orienteering Problem," Mathematics, MDPI, vol. 12(11), pages 1-19, June.
- Afsaneh Amiri & Majid Salari, 2019. "Time-constrained maximal covering routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 415-468, June.
- Ann-Kathrin Rothenbächer, 2019. "Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures," Transportation Science, INFORMS, vol. 53(3), pages 850-866, May.
- Sun, Peng & Veelenturf, Lucas P. & Hewitt, Mike & Van Woensel, Tom, 2018. "The time-dependent pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 1-24.
More about this item
Keywords
Team orienteering problem; Interval-varying profits; Mixed-integer linear programming; Dantzig-Wolfe decomposition; Branch-Price-and-Cut;All these keywords.
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:319:y:2024:i:3:p:793-807. 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.