IDEAS home Printed from https://ideas.repec.org/r/inm/ortrsc/v47y2013i1p53-63.html
   My bibliography  Save this item

The Multiconstraint Team Orienteering Problem with Multiple Time Windows

Citations

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


Cited by:

  1. Dumez, Dorian & Lehuédé, Fabien & Péton, Olivier, 2021. "A large neighborhood search approach to the vehicle routing problem with delivery options," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 103-132.
  2. 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.
  3. Evers, Lanah & Barros, Ana Isabel & Monsuur, Herman & Wagelmans, Albert, 2014. "Online stochastic UAV mission planning with time windows and time-sensitive targets," European Journal of Operational Research, Elsevier, vol. 238(1), pages 348-362.
  4. Magdalena A. K. Lang & Catherine Cleophas & Jan Fabian Ehmke, 2021. "Anticipative Dynamic Slotting for Attended Home Deliveries," SN Operations Research Forum, Springer, vol. 2(4), pages 1-39, December.
  5. Zelda B. Zabinsky & Pattamon Dulyakupt & Shabnam Zangeneh-Khamooshi & Cao Xiao & Pengbo Zhang & Seksan Kiatsupaibul & Joseph A. Heim, 2020. "Optimal collection of medical specimens and delivery to central laboratory," Annals of Operations Research, Springer, vol. 287(1), pages 537-564, April.
  6. Ernesto Tarantino & Ivanoe De Falco & Umberto Scafuri, 2019. "A mobile personalized tourist guide and its user evaluation," Information Technology & Tourism, Springer, vol. 21(3), pages 413-455, September.
  7. Maaike Hoogeboom & Wout Dullaert & David Lai & Daniele Vigo, 2020. "Efficient Neighborhood Evaluations for the Vehicle Routing Problem with Multiple Time Windows," Transportation Science, INFORMS, vol. 54(2), pages 400-416, March.
  8. Stavropoulou, F. & Repoussis, P.P. & Tarantilis, C.D., 2019. "The Vehicle Routing Problem with Profits and consistency constraints," European Journal of Operational Research, Elsevier, vol. 274(1), pages 340-356.
  9. Hu, Qian & Lim, Andrew, 2014. "An iterative three-component heuristic for the team orienteering problem with time windows," European Journal of Operational Research, Elsevier, vol. 232(2), pages 276-286.
  10. Zhang, Shu & Ohlmann, Jeffrey W. & Thomas, Barrett W., 2020. "Multi-period orienteering with uncertain adoption likelihood and waiting at customers," European Journal of Operational Research, Elsevier, vol. 282(1), pages 288-303.
  11. Ivanoe De Falco & Umberto Scafuri & Ernesto Tarantino, 2016. "Optimizing Personalized Touristic Itineraries by a Multiobjective Evolutionary Algorithm," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 15(06), pages 1269-1312, November.
  12. Aldy Gunawan & Hoong Chuin Lau & Pieter Vansteenwegen & Kun Lu, 2017. "Well-tuned algorithms for the Team Orienteering Problem with Time Windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(8), pages 861-876, August.
  13. Si, Guojin & Xia, Tangbin & Zhu, Ying & Du, Shichang & Xi, Lifeng, 2019. "Triple-level opportunistic maintenance policy for leasehold service network of multi-location production lines," Reliability Engineering and System Safety, Elsevier, vol. 190(C), pages 1-1.
  14. 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.
  15. 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.
  16. Kadri Sylejmani & Jürgen Dorn & Nysret Musliu, 2017. "Planning the trip itinerary for tourist groups," Information Technology & Tourism, Springer, vol. 17(3), pages 275-314, September.
  17. Rahma Lahyani & Mahdi Khemakhem & Frédéric Semet, 2017. "A unified matheuristic for solving multi-constrained traveling salesman problems with profits," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 393-422, September.
  18. Kotiloglu, S. & Lappas, T. & Pelechrinis, K. & Repoussis, P.P., 2017. "Personalized multi-period tour recommendations," Tourism Management, Elsevier, vol. 62(C), pages 76-88.
  19. Oktay Yılmaz & Ertan Yakıcı & Mumtaz Karatas, 2019. "A UAV location and routing problem with spatio-temporal synchronization constraints solved by ant colony optimization," Journal of Heuristics, Springer, vol. 25(4), pages 673-701, October.
  20. Mei, Yi & Salim, Flora D. & Li, Xiaodong, 2016. "Efficient meta-heuristics for the Multi-Objective Time-Dependent Orienteering Problem," European Journal of Operational Research, Elsevier, vol. 254(2), pages 443-457.
  21. Fangzhou Yan & Huaxin Qiu & Dongya Han, 2023. "Lagrangian Heuristic for Multi-Depot Technician Planning of Product Distribution and Installation with a Lunch Break," Mathematics, MDPI, vol. 11(3), pages 1-22, January.
  22. Lang, Magdalena A.K. & Cleophas, Catherine & Ehmke, Jan Fabian, 2021. "Multi-criteria decision making in dynamic slotting for attended home deliveries," Omega, Elsevier, vol. 102(C).
  23. 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.
  24. Kadri Sylejmani & Jürgen Dorn & Nysret Musliu, 0. "Planning the trip itinerary for tourist groups," Information Technology & Tourism, Springer, vol. 0, pages 1-40.
  25. 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.
  26. 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).
  27. Fleckenstein, David & Klein, Robert & Steinhardt, Claudius, 2023. "Recent advances in integrating demand management and vehicle routing: A methodological review," European Journal of Operational Research, Elsevier, vol. 306(2), pages 499-518.
  28. Zamorano, Emilio & Stolletz, Raik, 2017. "Branch-and-price approaches for the Multiperiod Technician Routing and Scheduling Problem," European Journal of Operational Research, Elsevier, vol. 257(1), pages 55-68.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.