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

The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm

Author

Listed:
  • Deitch, Ray
  • Ladany, Shaul P.

Abstract

No abstract is available for this item.

Suggested Citation

  • Deitch, Ray & Ladany, Shaul P., 2000. "The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm," European Journal of Operational Research, Elsevier, vol. 127(1), pages 69-77, November.
    • Handle: RePEc:eee:ejores:v:127:y:2000:i:1:p:69-77
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(99)00323-9
    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. B. L. Golden & Qiwen Wang & Li Liu, 1988. "A multifaceted heuristic for the orienteering problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(3), pages 359-366, June.
    2. Shaul P. Ladany, 1999. "Optimal Tourist Bus Tours," Tourism Economics, , vol. 5(2), pages 175-190, June.
    3. 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.
    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. 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.
    2. Colombi, Marco & Mansini, Renata, 2014. "New results for the Directed Profitable Rural Postman Problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 760-773.
    3. Oruc, Buse Eylul & Kara, Bahar Yetis, 2018. "Post-disaster assessment routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 76-102.
    4. Dominique Feillet & Pierre Dejax & Michel Gendreau, 2005. "Traveling Salesman Problems with Profits," Transportation Science, INFORMS, vol. 39(2), pages 188-205, May.
    5. Ruiz-Meza, José & Montoya-Torres, Jairo R., 2022. "A systematic literature review for the tourist trip design problem: Extensions, solution techniques and future research lines," Operations Research Perspectives, Elsevier, vol. 9(C).
    6. Dominique Feillet & Pierre Dejax & Michel Gendreau, 2005. "The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm," Transportation Science, INFORMS, vol. 39(4), pages 539-552, November.
    7. Colombi, Marco & Corberán, Ángel & Mansini, Renata & Plana, Isaac & Sanchis, José M., 2017. "The directed profitable rural postman problem with incompatibility constraints," European Journal of Operational Research, Elsevier, vol. 261(2), pages 549-562.
    8. Aráoz, Julián & Fernández, Elena & Meza, Oscar, 2009. "Solving the Prize-collecting Rural Postman Problem," European Journal of Operational Research, Elsevier, vol. 196(3), pages 886-896, August.
    9. Julián Aráoz & Elena Fernández & Carles Franquesa, 2009. "The Clustered Prize-Collecting Arc Routing Problem," Transportation Science, INFORMS, vol. 43(3), pages 287-300, August.
    10. José Ruiz-Meza & Jairo R. Montoya-Torres, 2021. "Tourist trip design with heterogeneous preferences, transport mode selection and environmental considerations," Annals of Operations Research, Springer, vol. 305(1), pages 227-249, October.
    11. Enrique Benavent & Ángel Corberán & Luís Gouveia & Maria Mourão & Leonor Pinto, 2015. "Profitable mixed capacitated arc routing and related problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(1), pages 244-274, April.
    12. Oleg Shcherbina & Elena Shembeleva, 2014. "Modeling recreational systems using optimization techniques and information technologies," Annals of Operations Research, Springer, vol. 221(1), pages 309-329, October.

    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. Chao, I-Ming & Golden, Bruce L. & Wasil, Edward A., 1996. "A fast and effective heuristic for the orienteering problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 475-489, February.
    2. Sadan Kulturel-Konak & Bryan A. Norman & David W. Coit & Alice E. Smith, 2004. "Exploiting Tabu Search Memory in Constrained Problems," INFORMS Journal on Computing, INFORMS, vol. 16(3), pages 241-254, August.
    3. 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.
    4. Vansteenwegen, Pieter & Souffriau, Wouter & Berghe, Greet Vanden & Oudheusden, Dirk Van, 2009. "A guided local search metaheuristic for the team orienteering problem," European Journal of Operational Research, Elsevier, vol. 196(1), pages 118-127, July.
    5. H Tang & E Miller-Hooks, 2005. "Algorithms for a stochastic selective travelling salesperson problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 439-452, April.
    6. 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.
    7. Dominique Feillet & Pierre Dejax & Michel Gendreau, 2005. "Traveling Salesman Problems with Profits," Transportation Science, INFORMS, vol. 39(2), pages 188-205, May.
    8. Krzysztof Ostrowski & Joanna Karbowska-Chilinska & Jolanta Koszelew & Pawel Zabielski, 2017. "Evolution-inspired local improvement algorithm solving orienteering problem," Annals of Operations Research, Springer, vol. 253(1), pages 519-543, June.
    9. Angelelli, E. & Archetti, C. & Vindigni, M., 2014. "The Clustered Orienteering Problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 404-414.
    10. 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.
    11. 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.
    12. 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.
    13. Dikas, G. & Minis, I., 2014. "Scheduled paratransit transport systems," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 18-34.
    14. Lu, Yongliang & Benlic, Una & Wu, Qinghua, 2018. "A memetic algorithm for the Orienteering Problem with Mandatory Visits and Exclusionary Constraints," European Journal of Operational Research, Elsevier, vol. 268(1), pages 54-69.
    15. Larco Martinelli, J.A. & Dekker, R. & Kaymak, U., 2007. "Distributed Services with Foreseen and Unforeseen Tasks: The Mobile Re-allocation Problem," ERIM Report Series Research in Management ERS-2007-087-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    16. Balcik, Burcu, 2017. "Site selection and vehicle routing for post-disaster rapid needs assessment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 101(C), pages 30-58.
    17. Markus Sinnl, 2021. "Mixed-integer programming approaches for the time-constrained maximal covering routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 497-542, June.
    18. Gambardella, L.M. & Montemanni, R. & Weyland, D., 2012. "Coupling ant colony systems with strong local searches," European Journal of Operational Research, Elsevier, vol. 220(3), pages 831-843.
    19. Xia, Jun & Wang, Kai & Wang, Shuaian, 2019. "Drone scheduling to monitor vessels in emission control areas," Transportation Research Part B: Methodological, Elsevier, vol. 119(C), pages 174-196.
    20. Oleg Shcherbina & Elena Shembeleva, 2014. "Modeling recreational systems using optimization techniques and information technologies," Annals of Operations Research, Springer, vol. 221(1), pages 309-329, October.

    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:127:y:2000:i:1:p:69-77. 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.