IDEAS home Printed from https://ideas.repec.org/r/spr/isochp/978-1-4419-1665-5_13.html
   My bibliography  Save this item

Large Neighborhood Search

In: Handbook of Metaheuristics

Citations

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


Cited by:

  1. El Mehdi, Er Raqabi & Ilyas, Himmich & Nizar, El Hachemi & Issmaïl, El Hallaoui & François, Soumis, 2023. "Incremental LNS framework for integrated production, inventory, and vessel scheduling: Application to a global supply chain," Omega, Elsevier, vol. 116(C).
  2. Bach, Lukas & Hasle, Geir & Schulz, Christian, 2019. "Adaptive Large Neighborhood Search on the Graphics Processing Unit," European Journal of Operational Research, Elsevier, vol. 275(1), pages 53-66.
  3. Oliver G. Czibula & Hanyu Gu & Yakov Zinder, 2018. "Planning personnel retraining: column generation heuristics," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 896-915, October.
  4. David Woller & Jakub Rada & Miroslav Kulich, 2023. "The ALNS metaheuristic for the transmission maintenance scheduling," Journal of Heuristics, Springer, vol. 29(2), pages 349-382, June.
  5. Manfred Gilli & Enrico Schumann, 2012. "Heuristic optimisation in financial modelling," Annals of Operations Research, Springer, vol. 193(1), pages 129-158, March.
  6. Arpan Rijal & Marco Bijvank & Asvin Goel & René de Koster, 2021. "Workforce Scheduling with Order-Picking Assignments in Distribution Facilities," Transportation Science, INFORMS, vol. 55(3), pages 725-746, May.
  7. Ohad Eisenhandler & Michal Tzur, 2019. "The Humanitarian Pickup and Distribution Problem," Operations Research, INFORMS, vol. 67(1), pages 10-32, January.
  8. Yin, Jiateng & D’Ariano, Andrea & Wang, Yihui & Yang, Lixing & Tang, Tao, 2021. "Timetable coordination in a rail transit network with time-dependent passenger demand," European Journal of Operational Research, Elsevier, vol. 295(1), pages 183-202.
  9. Guerrero, W.J. & Prodhon, C. & Velasco, N. & Amaya, C.A., 2013. "Hybrid heuristic for the inventory location-routing problem with deterministic demand," International Journal of Production Economics, Elsevier, vol. 146(1), pages 359-370.
  10. Braekers, Kris & Hartl, Richard F. & Parragh, Sophie N. & Tricoire, Fabien, 2016. "A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience," European Journal of Operational Research, Elsevier, vol. 248(2), pages 428-443.
  11. Aksen, Deniz & Kaya, Onur & Sibel Salman, F. & Tüncel, Özge, 2014. "An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem," European Journal of Operational Research, Elsevier, vol. 239(2), pages 413-426.
  12. Mo, Pengli & Yao, Yu & D’Ariano, Andrea & Liu, Zhiyuan, 2023. "The vehicle routing problem with underground logistics: Formulation and algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
  13. Salim Haddadi, 2019. "Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem," 4OR, Springer, vol. 17(3), pages 261-295, September.
  14. Renaud Masson & Anna Trentini & Fabien Lehuédé & Nicolas Malhéné & Olivier Péton & Houda Tlahig, 2017. "Optimization of a city logistics transportation system with mixed passengers and goods," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 81-109, March.
  15. Mohri, Seyed Sina & Asgari, Nasrin & Zanjirani Farahani, Reza & Bourlakis, Michael & Laker, Benjamin, 2020. "Fairness in hazmat routing-scheduling: A bi-objective Stackelberg game," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
  16. Soriano, Adria & Gansterer, Margaretha & Hartl, Richard F., 2023. "The multi-depot vehicle routing problem with profit fairness," International Journal of Production Economics, Elsevier, vol. 255(C).
  17. Turkeš, Renata & Sörensen, Kenneth & Hvattum, Lars Magnus, 2021. "Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search," European Journal of Operational Research, Elsevier, vol. 292(2), pages 423-442.
  18. Zheng Zhang & Bin Ji & Samson S. Yu, 2023. "An Adaptive Tabu Search Algorithm for Solving the Two-Dimensional Loading Constrained Vehicle Routing Problem with Stochastic Customers," Sustainability, MDPI, vol. 15(2), pages 1-23, January.
  19. Christian Brandstätter, 2021. "A metaheuristic algorithm and structured analysis for the Line-haul Feeder Vehicle Routing Problem with Time Windows," 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. 29(1), pages 247-289, March.
  20. Li, Lei & Al Chami, Zaher & Manier, Hervé & Manier, Marie-Ange & Xue, Jian, 2021. "Incorporating fuel delivery in network design for hydrogen fueling stations: Formulation and two metaheuristic approaches," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
  21. Liu, Wenqian & Ke, Ginger Y. & Chen, Jian & Zhang, Lianmin, 2020. "Scheduling the distribution of blood products: A vendor-managed inventory routing approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
  22. Soriano, Adria & Gansterer, Margaretha & Hartl, Richard F., 2022. "Reprint of: The multi-depot vehicle routing problem with profit fairness," International Journal of Production Economics, Elsevier, vol. 250(C).
  23. Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2020. "Integrating first-mile pickup and last-mile delivery on shared vehicle routes for efficient urban e-commerce distribution," Transportation Research Part B: Methodological, Elsevier, vol. 131(C), pages 26-62.
  24. Daniela Guericke & Leena Suhl, 2017. "The home health care problem with working regulations," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 977-1010, October.
  25. Hiermann, Gerhard & Puchinger, Jakob & Ropke, Stefan & Hartl, Richard F., 2016. "The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations," European Journal of Operational Research, Elsevier, vol. 252(3), pages 995-1018.
  26. Michael Drexl, 2021. "On the one-to-one pickup-and-delivery problem with time windows and trailers," 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. 29(3), pages 1115-1162, September.
  27. Michele Garraffa & Deepak Mehta & Barry O’Sullivan & Cemalettin Ozturk & Luis Quesada, 2021. "An adaptive large neighbourhood search algorithm for diameter bounded network design problems," Journal of Heuristics, Springer, vol. 27(5), pages 887-922, October.
  28. Timo Gschwind & Michael Drexl, 2019. "Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem," Transportation Science, INFORMS, vol. 53(2), pages 480-491, March.
  29. Dalmau, Ramon & Gawinowski, Gilles & Anoraud, Camille, 2022. "Comparison of various temporal air traffic flow management models in critical scenarios," Journal of Air Transport Management, Elsevier, vol. 105(C).
  30. Andrea Lodi & Enrico Malaguti & Nicolás E. Stier-Moses & Tommaso Bonino, 2016. "Design and Control of Public-Service Contracts and an Application to Public Transportation Systems," Management Science, INFORMS, vol. 62(4), pages 1165-1187, April.
  31. Matusiak, M. & de Koster, M.B.M. & Saarinen, J., 2015. "Data-driven warehouse optimization," ERIM Report Series Research in Management ERS-2015-008-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.
  32. Colombo, Fabio & Cordone, Roberto & Trubian, Marco, 2014. "Column-generation based bounds for the Homogeneous Areas Problem," European Journal of Operational Research, Elsevier, vol. 236(2), pages 695-705.
  33. Nolz, Pamela C. & Absi, Nabil & Feillet, Dominique & Seragiotto, Clóvis, 2022. "The consistent electric-Vehicle routing problem with backhauls and charging management," European Journal of Operational Research, Elsevier, vol. 302(2), pages 700-716.
  34. Kuhn, Heinrich & Schubert, Daniel & Holzapfel, Andreas, 2021. "Integrated order batching and vehicle routing operations in grocery retail – A General Adaptive Large Neighborhood Search algorithm," European Journal of Operational Research, Elsevier, vol. 294(3), pages 1003-1021.
  35. Korach, Aleksandra & Brouer, Berit Dangaard & Jensen, Rune Møller, 2020. "Matheuristics for slot planning of container vessel bays," European Journal of Operational Research, Elsevier, vol. 282(3), pages 873-885.
  36. de Castro Pena, Guilherme & Santos, Andréa Cynthia & Prins, Christian, 2023. "Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters," European Journal of Operational Research, Elsevier, vol. 306(1), pages 156-172.
  37. Lai, David S.W. & Caliskan Demirag, Ozgun & Leung, Janny M.Y., 2016. "A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 86(C), pages 32-52.
  38. Polten, Lukas & Emde, Simon, 2021. "Scheduling automated guided vehicles in very narrow aisle warehouses," Omega, Elsevier, vol. 99(C).
  39. Timo Hintsch & Stefan Irnich, 2017. "Large Multiple Neighborhood Search for the Clustered Vehicle-Routing Problem," Working Papers 1701, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
  40. Mohamed Abdel-Basset & Reda Mohamed & Karam M. Sallam & Ripon K. Chakrabortty, 2022. "Light Spectrum Optimizer: A Novel Physics-Inspired Metaheuristic Optimization Algorithm," Mathematics, MDPI, vol. 10(19), pages 1-63, September.
  41. Guido, Rosita & Groccia, Maria Carmela & Conforti, Domenico, 2018. "An efficient matheuristic for offline patient-to-bed assignment problems," European Journal of Operational Research, Elsevier, vol. 268(2), pages 486-503.
  42. Lee, Jongsung & Kim, Byung-In & Johnson, Andrew L. & Lee, Kiho, 2014. "The nuclear medicine production and delivery problem," European Journal of Operational Research, Elsevier, vol. 236(2), pages 461-472.
  43. Martina Fischetti & Michele Monaci, 2016. "Proximity search heuristics for wind farm optimal layout," Journal of Heuristics, Springer, vol. 22(4), pages 459-474, August.
  44. Ulrike Ritzinger & Jakob Puchinger & Richard F. Hartl, 2016. "Dynamic programming based metaheuristics for the dial-a-ride problem," Annals of Operations Research, Springer, vol. 236(2), pages 341-358, January.
  45. Anderluh, Alexandra & Nolz, Pamela C. & Hemmelmayr, Vera C. & Crainic, Teodor Gabriel, 2021. "Multi-objective optimization of a two-echelon vehicle routing problem with vehicle synchronization and ‘grey zone’ customers arising in urban logistics," European Journal of Operational Research, Elsevier, vol. 289(3), pages 940-958.
  46. Masson, Renaud & Lahrichi, Nadia & Rousseau, Louis-Martin, 2016. "A two-stage solution method for the annual dairy transportation problem," European Journal of Operational Research, Elsevier, vol. 251(1), pages 36-43.
  47. Timo Hintsch, 2019. "Large Multiple Neighborhood Search for the Soft-Clustered Vehicle-Routing Problem," Working Papers 1904, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
  48. Thomas Kirschstein & Christian Bierwirth, 2018. "The selective Traveling Salesman Problem with emission allocation rules," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(1), pages 97-124, January.
  49. Bongiovanni, Claudia & Kaspi, Mor & Cordeau, Jean-François & Geroliminis, Nikolas, 2022. "A machine learning-driven two-phase metaheuristic for autonomous ridesharing operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).
  50. Ulrike Ritzinger & Jakob Puchinger & Richard Hartl, 2016. "Dynamic programming based metaheuristics for the dial-a-ride problem," Annals of Operations Research, Springer, vol. 236(2), pages 341-358, January.
  51. Lin, Shih-Wei & Ying, Kuo-Ching, 2014. "Minimizing shifts for personnel task scheduling problems: A three-phase algorithm," European Journal of Operational Research, Elsevier, vol. 237(1), pages 323-334.
  52. Wagner, Stefan & Mönch, Lars, 2023. "A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices," European Journal of Operational Research, Elsevier, vol. 304(2), pages 461-475.
  53. Xiaoyuan Liu & Hayato Ushijima-Mwesigwa & Avradip Mandal & Sarvagya Upadhyay & Ilya Safro & Arnab Roy, 2022. "Leveraging special-purpose hardware for local search heuristics," Computational Optimization and Applications, Springer, vol. 82(1), pages 1-29, May.
  54. Haoyuan Hu & Ying Zhang & Jiangwen Wei & Yang Zhan & Xinhui Zhang & Shaojian Huang & Guangrui Ma & Yuming Deng & Siwei Jiang, 2022. "Alibaba Vehicle Routing Algorithms Enable Rapid Pick and Delivery," Interfaces, INFORMS, vol. 52(1), pages 27-41, January.
  55. Nuno Antunes Ribeiro & Alexandre Jacquillat & António Pais Antunes, 2019. "A Large-Scale Neighborhood Search Approach to Airport Slot Allocation," Transportation Science, INFORMS, vol. 53(6), pages 1772-1797, November.
  56. Cui, Huixia & Qiu, Jianlong & Cao, Jinde & Guo, Ming & Chen, Xiangyong & Gorbachev, Sergey, 2023. "Route optimization in township logistics distribution considering customer satisfaction based on adaptive genetic algorithm," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 204(C), pages 28-42.
  57. Peng Xu & Qixing Liu & Yuhu Wu, 2023. "Energy Saving-Oriented Multi-Depot Vehicle Routing Problem with Time Windows in Disaster Relief," Energies, MDPI, vol. 16(4), pages 1-15, February.
  58. Hintsch, Timo & Irnich, Stefan, 2018. "Large multiple neighborhood search for the clustered vehicle-routing problem," European Journal of Operational Research, Elsevier, vol. 270(1), pages 118-131.
  59. Masmoudi, Mohamed Amine & Hosny, Manar & Braekers, Kris & Dammak, Abdelaziz, 2016. "Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 96(C), pages 60-80.
  60. David Bulck & Dries R. Goossens & Frits C. R. Spieksma, 2019. "Scheduling a non-professional indoor football league: a tabu search based approach," Annals of Operations Research, Springer, vol. 275(2), pages 715-730, April.
  61. Simon Emde & Michael Schneider, 2018. "Just-In-Time Vehicle Routing for In-House Part Feeding to Assembly Lines," Transportation Science, INFORMS, vol. 52(3), pages 657-672, June.
  62. Hatzenbühler, Jonas & Jenelius, Erik & Gidófalvi, Gyözö & Cats, Oded, 2023. "Modular vehicle routing for combined passenger and freight transport," Transportation Research Part A: Policy and Practice, Elsevier, vol. 173(C).
  63. Matusiak, Marek & de Koster, René & Saarinen, Jari, 2017. "Utilizing individual picker skills to improve order batching in a warehouse," European Journal of Operational Research, Elsevier, vol. 263(3), pages 888-899.
  64. Gläser, Sina, 2022. "A waste collection problem with service type option," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1216-1230.
  65. Timo Gschwind & Michael Drexl, 2016. "Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem," Working Papers 1624, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
  66. Michael Schneider & Maximilian Löffler, 2019. "Large Composite Neighborhoods for the Capacitated Location-Routing Problem," Service Science, INFORMS, vol. 53(1), pages 301-318, February.
  67. Zheng Wang & Wei Xu & Xiangpei Hu & Yong Wang, 2022. "Inventory allocation to robotic mobile-rack and picker-to-part warehouses at minimum order-splitting and replenishment costs," Annals of Operations Research, Springer, vol. 316(1), pages 467-491, September.
  68. Ruf, Moritz & Cordeau, Jean-François, 2021. "Adaptive large neighborhood search for integrated planning in railroad classification yards," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 26-51.
  69. Maximilian Schiffer & Grit Walther, 2018. "An Adaptive Large Neighborhood Search for the Location-routing Problem with Intra-route Facilities," Transportation Science, INFORMS, vol. 52(2), pages 331-352, March.
  70. Bruck, Bruno P. & Cordeau, Jean-François & Iori, Manuel, 2018. "A practical time slot management and routing problem for attended home services," Omega, Elsevier, vol. 81(C), pages 208-219.
  71. Majid Eskandarpour & Pierre Dejax & Olivier Péton, 2019. "Multi-Directional Local Search for Sustainable Supply Chain Network Design," Post-Print hal-02407741, HAL.
  72. Rincon-Garcia, Nicolas & Waterson, Ben & Cherrett, Tom J. & Salazar-Arrieta, Fernando, 2020. "A metaheuristic for the time-dependent vehicle routing problem considering driving hours regulations – An application in city logistics," Transportation Research Part A: Policy and Practice, Elsevier, vol. 137(C), pages 429-446.
  73. Liu, Chuanju & Zhang, Junlong & Lin, Shaochong & Shen, Zuo-Jun Max, 2023. "Service network design with consistent multiple trips," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 171(C).
  74. Duan, Gang & Aghalari, Amin & Chen, Li & Marufuzzaman, Mohammad & Ma, Junfeng, 2021. "Vessel routing optimization for floating macro-marine debris collection in the ocean considering dynamic velocity and direction," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
  75. Soares, Ricardo & Marques, Alexandra & Amorim, Pedro & Rasinmäki, Jussi, 2019. "Multiple vehicle synchronisation in a full truck-load pickup and delivery problem: A case-study in the biomass supply chain," European Journal of Operational Research, Elsevier, vol. 277(1), pages 174-194.
  76. Efstratios Rappos & Eric Thiémard & Stephan Robert & Jean-François Hêche, 2022. "A mixed-integer programming approach for solving university course timetabling problems," Journal of Scheduling, Springer, vol. 25(4), pages 391-404, August.
  77. Roozbeh, Iman & Hearne, John & Abbasi, Babak & Ozlen, Melih, 2021. "Decision support for wildfire asset protection: A two-stage stochastic programming approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 155(C).
  78. Renaud Masson & Fabien Lehuédé & Olivier Péton, 2013. "An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers," Transportation Science, INFORMS, vol. 47(3), pages 344-355, August.
  79. Marco Antonio Boschetti & Vittorio Maniezzo, 2022. "Matheuristics: using mathematics for heuristic design," 4OR, Springer, vol. 20(2), pages 173-208, June.
  80. Arslan, A.M. & Agatz, N.A.H. & Klapp, M., 2019. "Operational Strategies for On-demand Personal Shopper Services," ERIM Report Series Research in Management ERS-2019-009-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.
  81. Wang, Zheng, 2018. "Delivering meals for multiple suppliers: Exclusive or sharing logistics service," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 496-512.
  82. Emilio Carrizosa & Vanesa Guerrero & Dolores Romero Morales, 2023. "On mathematical optimization for clustering categories in contingency tables," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 17(2), pages 407-429, June.
  83. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
  84. Michael Drexl, 2018. "On the One-to-One Pickup-and-Delivery Problem with Time Windows and Trailers," Working Papers 1816, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
  85. Archetti, Claudia & Doerner, Karl F. & Tricoire, Fabien, 2013. "A heuristic algorithm for the free newspaper delivery problem," European Journal of Operational Research, Elsevier, vol. 230(2), pages 245-257.
  86. Hemmelmayr, Vera C., 2015. "Sequential and parallel large neighborhood search algorithms for the periodic location routing problem," European Journal of Operational Research, Elsevier, vol. 243(1), pages 52-60.
  87. Mancini, Simona & Gansterer, Margaretha, 2022. "Bundle generation for last-mile delivery with occasional drivers," Omega, Elsevier, vol. 108(C).
  88. Santos, Maria João & Curcio, Eduardo & Mulati, Mauro Henrique & Amorim, Pedro & Miyazawa, Flávio Keidi, 2020. "A robust optimization approach for the vehicle routing problem with selective backhauls," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).
  89. Konrad Steiner, 2019. "Schedule-Based Integrated Inter-City Bus Line Planning for Multiple Timetabled Services via Large Multiple Neighborhood Search," Working Papers 1902, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
  90. Hellsten, Erik Orm & Sacramento, David & Pisinger, David, 2020. "An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports," European Journal of Operational Research, Elsevier, vol. 287(2), pages 682-698.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.