IDEAS home Printed from https://ideas.repec.org/r/inm/oropre/v21y1973i2p498-516.html
   My bibliography  Save this item

An Effective Heuristic Algorithm for the Traveling-Salesman Problem

Citations

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


Cited by:

  1. Vicente Campos & Estefanía Piñana & Rafael Martí, 2011. "Adaptive memory programming for matrix bandwidth minimization," Annals of Operations Research, Springer, vol. 183(1), pages 7-23, March.
  2. Erwin Knippenberg & Dean Jolliffe & John Hoddinott, 2020. "Land Fragmentation and Food Insecurity in Ethiopia," American Journal of Agricultural Economics, John Wiley & Sons, vol. 102(5), pages 1557-1577, October.
  3. 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.
  4. Qiu, Yuzhuo & Zhou, Dan & Du, Yanan & Liu, Jie & Pardalos, Panos M. & Qiao, Jun, 2021. "The two-echelon production routing problem with cross-docking satellites," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
  5. Bouška, Michal & Šůcha, Přemysl & Novák, Antonín & Hanzálek, Zdeněk, 2023. "Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness," European Journal of Operational Research, Elsevier, vol. 308(3), pages 990-1006.
  6. Bektas, Tolga, 2006. "The multiple traveling salesman problem: an overview of formulations and solution procedures," Omega, Elsevier, vol. 34(3), pages 209-219, June.
  7. Pablo Moscato & Michael G. Norman, 1998. "On the Performance of Heuristics on Finite and Infinite Fractal Instances of the Euclidean Traveling Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 10(2), pages 121-132, May.
  8. Goldbarg, M.C. & Bagi, L.B. & Goldbarg, E.F.G., 2009. "Transgenetic algorithm for the Traveling Purchaser Problem," European Journal of Operational Research, Elsevier, vol. 199(1), pages 36-45, November.
  9. Yanwei Zhao & Longlong Leng & Chunmiao Zhang, 2021. "A novel framework of hyper-heuristic approach and its application in location-routing problem with simultaneous pickup and delivery," Operational Research, Springer, vol. 21(2), pages 1299-1332, June.
  10. van der Bruggen, Lambert & Gruson, Ruud & Salomon, Marc, 1995. "Reconsidering the distribution structure of gasoline products for a large oil company," European Journal of Operational Research, Elsevier, vol. 81(3), pages 460-473, March.
  11. Naji-Azimi, Zahra & Salari, Majid & Toth, Paolo, 2010. "A heuristic procedure for the Capacitated m-Ring-Star problem," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1227-1234, December.
  12. Ahmed Kheiri & Alina G. Dragomir & David Mueller & Joaquim Gromicho & Caroline Jagtenberg & Jelke J. Hoorn, 2019. "Tackling a VRP challenge to redistribute scarce equipment within time windows using metaheuristic algorithms," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 561-595, December.
  13. Ghosh, Diptesh, 2016. "Exploring Lin Kernighan neighborhoods for the indexing problem," IIMA Working Papers WP2016-02-13, Indian Institute of Management Ahmedabad, Research and Publication Department.
  14. Wex, Felix & Schryen, Guido & Feuerriegel, Stefan & Neumann, Dirk, 2014. "Emergency response in natural disaster management: Allocation and scheduling of rescue units," European Journal of Operational Research, Elsevier, vol. 235(3), pages 697-708.
  15. Michael Schneider & Michael Drexl, 2017. "A survey of the standard location-routing problem," Annals of Operations Research, Springer, vol. 259(1), pages 389-414, December.
  16. Zhou, Lin & Baldacci, Roberto & Vigo, Daniele & Wang, Xu, 2018. "A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution," European Journal of Operational Research, Elsevier, vol. 265(2), pages 765-778.
  17. Christian Prins & Caroline Prodhon & Angel Ruiz & Patrick Soriano & Roberto Wolfler Calvo, 2007. "Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic," Transportation Science, INFORMS, vol. 41(4), pages 470-483, November.
  18. Voudouris, Christos & Tsang, Edward, 1999. "Guided local search and its application to the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 113(2), pages 469-499, March.
  19. Katayama, Kengo & Narihisa, Hiroyuki, 2001. "Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem," European Journal of Operational Research, Elsevier, vol. 134(1), pages 103-119, October.
  20. Thomas Weise & Yuezhong Wu & Raymond Chiong & Ke Tang & Jörg Lässig, 2016. "Global versus local search: the impact of population sizes on evolutionary algorithm performance," Journal of Global Optimization, Springer, vol. 66(3), pages 511-534, November.
  21. Valle, Cristiano Arbex & Beasley, John E. & da Cunha, Alexandre Salles, 2017. "Optimally solving the joint order batching and picker routing problem," European Journal of Operational Research, Elsevier, vol. 262(3), pages 817-834.
  22. 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.
  23. Gang Du & Xi Liang & Chuanwang Sun, 2017. "Scheduling Optimization of Home Health Care Service Considering Patients’ Priorities and Time Windows," Sustainability, MDPI, vol. 9(2), pages 1-22, February.
  24. Tino Henke & M. Grazia Speranza & Gerhard Wäscher, 2014. "The Multi-Compartment Vehicle Routing Problem with Flexible Compartment Sizes," FEMM Working Papers 140006, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
  25. Skålnes, Jørgen & Ben Ahmed, Mohamed & Hvattum, Lars Magnus & Stålhane, Magnus, 2024. "New benchmark instances for the inventory routing problem," European Journal of Operational Research, Elsevier, vol. 313(3), pages 992-1014.
  26. Ninio, Matan & Schneider, Johannes J., 2005. "Weight annealing," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 349(3), pages 649-666.
  27. Ransberger, Martin & Morgenstern, Ingo & Schneider, Johannes J., 2011. "Influence of rounding errors on the quality of heuristic optimization algorithms," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(13), pages 2571-2581.
  28. Claudia Archetti & Natashia Boland & Grazia Speranza, 2017. "A Matheuristic for the Multivehicle Inventory Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 377-387, August.
  29. Tian, Peng & Ma, Jian & Zhang, Dong-Mo, 1999. "Application of the simulated annealing algorithm to the combinatorial optimisation problem with permutation property: An investigation of generation mechanism," European Journal of Operational Research, Elsevier, vol. 118(1), pages 81-94, October.
  30. Douglas G. Macharet & Armando Alves Neto & Vila F. Camara Neto & Mario F. M. Campos, 2018. "Dynamic region visit routing problem for vehicles with minimum turning radius," Journal of Heuristics, Springer, vol. 24(1), pages 83-109, February.
  31. Arbex Valle, Cristiano & Beasley, John E, 2020. "Order batching using an approximation for the distance travelled by pickers," European Journal of Operational Research, Elsevier, vol. 284(2), pages 460-484.
  32. Anurag Agarwal, 2009. "Theoretical insights into the augmented-neural-network approach for combinatorial optimization," Annals of Operations Research, Springer, vol. 168(1), pages 101-117, April.
  33. Sebastian Herrmann & Gabriela Ochoa & Franz Rothlauf, 2018. "PageRank centrality for performance prediction: the impact of the local optima network model," Journal of Heuristics, Springer, vol. 24(3), pages 243-264, June.
  34. Vincent F. Yu & Shin-Yu Lin, 2016. "Solving the location-routing problem with simultaneous pickup and delivery by simulated annealing," International Journal of Production Research, Taylor & Francis Journals, vol. 54(2), pages 526-549, January.
  35. Michael Brusco & Hans-Friedrich Köhn, 2009. "Exemplar-Based Clustering via Simulated Annealing," Psychometrika, Springer;The Psychometric Society, vol. 74(3), pages 457-475, September.
  36. Li, Jianxiang & Chu, Feng & Chen, Haoxun, 2011. "A solution approach to the inventory routing problem in a three-level distribution system," European Journal of Operational Research, Elsevier, vol. 210(3), pages 736-744, May.
  37. Tomoshi Otsuki & Kazuyuki Aihara, 2016. "New variable depth local search for multiple depot vehicle scheduling problems," Journal of Heuristics, Springer, vol. 22(4), pages 567-585, August.
  38. K Sang-Ho & G Young-Gun & K Maing-Kyu, 2003. "Application of the out-of-kilter algorithm to the asymmetric traveling salesman problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(10), pages 1085-1092, October.
  39. ARNOLD, Florian & SÖRENSEN, Kenneth, 2017. "A simple, deterministic, and efficient knowledge-driven heuristic for the vehicle routing problem," Working Papers 2017012, University of Antwerp, Faculty of Business and Economics.
  40. Jean Bertrand Gauthier & Stefan Irnich, 2020. "Inter-Depot Moves and Dynamic-Radius Search for Multi-Depot Vehicle Routing Problems," Working Papers 2004, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
  41. Yves Molenbruch & Kris Braekers & An Caris, 2017. "Operational effects of service level variations for the dial-a-ride 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. 25(1), pages 71-90, March.
  42. Sebastian Herrmann & Gabriela Ochoa & Franz Rothlauf, 2016. "Communities of Local Optima as Funnels in Fitness Landscapes," Working Papers 1609, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
  43. Mutsunori Yagiura & Toshihide Ibaraki & Fred Glover, 2004. "An Ejection Chain Approach for the Generalized Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 133-151, May.
  44. Edmund K. Burke & Timothy Curtois & Rong Qu & Greet Vanden Berghe, 2013. "A Time Predefined Variable Depth Search for Nurse Rostering," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 411-419, August.
  45. Naji-Azimi, Zahra & Salari, Majid & Toth, Paolo, 2012. "An Integer Linear Programming based heuristic for the Capacitated m-Ring-Star Problem," European Journal of Operational Research, Elsevier, vol. 217(1), pages 17-25.
  46. 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.
  47. Vishal Gaur & Marshall L. Fisher, 2004. "A Periodic Inventory Routing Problem at a Supermarket Chain," Operations Research, INFORMS, vol. 52(6), pages 813-822, December.
  48. S. Irnich, 2008. "A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics," INFORMS Journal on Computing, INFORMS, vol. 20(2), pages 270-287, May.
  49. Sandra Zajac, 2018. "On a two-phase solution approach for the bi-objective k-dissimilar vehicle routing problem," Journal of Heuristics, Springer, vol. 24(3), pages 515-550, June.
  50. Sleegers, Joeri & Olij, Richard & van Horn, Gijs & van den Berg, Daan, 2020. "Where the really hard problems aren’t," Operations Research Perspectives, Elsevier, vol. 7(C).
  51. D R Hains & L D Whitley & A E Howe, 2011. "Revisiting the big valley search space structure in the TSP," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(2), pages 305-312, February.
  52. Jeanette Schmidt & Stefan Irnich, 2020. "New Neighborhoods and an Iterated Local Search Algorithm for the Generalized Traveling Salesman Problem," Working Papers 2020, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
  53. Keisuke Murakami, 2018. "Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(04), pages 1-22, August.
  54. T. Ibaraki & S. Imahori & M. Kubo & T. Masuda & T. Uno & M. Yagiura, 2005. "Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints," Transportation Science, INFORMS, vol. 39(2), pages 206-232, May.
  55. Archetti, Claudia & Corberán, Ángel & Plana, Isaac & Sanchis, José Maria & Speranza, M. Grazia, 2015. "A matheuristic for the Team Orienteering Arc Routing Problem," European Journal of Operational Research, Elsevier, vol. 245(2), pages 392-401.
  56. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms," Transportation Science, INFORMS, vol. 39(1), pages 104-118, February.
  57. Rego, Cesar, 1998. "Relaxed tours and path ejections for the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 522-538, April.
  58. W-C Chiang & R A Russell, 2004. "A metaheuristic for the vehicle-routeing problem with soft time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1298-1310, December.
  59. repec:jss:jstsof:23:i02 is not listed on IDEAS
  60. Yagiura, Mutsunori & Ibaraki, Toshihide, 1996. "The use of dynamic programming in genetic algorithms for permutation problems," European Journal of Operational Research, Elsevier, vol. 92(2), pages 387-401, July.
  61. Prodhon, Caroline, 2011. "A hybrid evolutionary algorithm for the periodic location-routing problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 204-212, April.
  62. Anurag Agarwal & Selcuk Colak & Jason Deane, 2010. "NeuroGenetic approach for combinatorial optimization: an exploratory analysis," Annals of Operations Research, Springer, vol. 174(1), pages 185-199, February.
  63. Rodriguez-Tello, Eduardo & Hao, Jin-Kao & Torres-Jimenez, Jose, 2008. "An improved simulated annealing algorithm for bandwidth minimization," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1319-1335, March.
  64. Rego, César & Gamboa, Dorabela & Glover, Fred & Osterman, Colin, 2011. "Traveling salesman problem heuristics: Leading methods, implementations and latest advances," European Journal of Operational Research, Elsevier, vol. 211(3), pages 427-441, June.
  65. Henke, Tino & Speranza, M. Grazia & Wäscher, Gerhard, 2015. "The multi-compartment vehicle routing problem with flexible compartment sizes," European Journal of Operational Research, Elsevier, vol. 246(3), pages 730-743.
  66. Daniel Martins & Gabriel M. Vianna & Isabel Rosseti & Simone L. Martins & Alexandre Plastino, 2018. "Making a state-of-the-art heuristic faster with data mining," Annals of Operations Research, Springer, vol. 263(1), pages 141-162, April.
  67. Gabriela Ochoa & Nadarajen Veerapen, 2018. "Mapping the global structure of TSP fitness landscapes," Journal of Heuristics, Springer, vol. 24(3), pages 265-294, June.
  68. Carolina Almeida & Richard Gonçalves & Elizabeth Goldbarg & Marco Goldbarg & Myriam Delgado, 2012. "An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem," Annals of Operations Research, Springer, vol. 199(1), pages 305-341, October.
  69. S I Brown & R G McGarvey & J A Ventura, 2004. "Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(6), pages 614-621, June.
  70. Han, Anthony Fu-Wha & Chu, Yu-Ching, 2016. "A multi-start heuristic approach for the split-delivery vehicle routing problem with minimum delivery amounts," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 88(C), pages 11-31.
  71. Aritra Pal & Hadi Charkhgard, 2019. "A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 115-133, February.
  72. 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.
  73. Pan-Li Zhang & Xiao-Bo Sun & Ji-Quan Wang & Hao-Hao Song & Jin-Ling Bei & Hong-Yu Zhang, 2022. "The Discrete Carnivorous Plant Algorithm with Similarity Elimination Applied to the Traveling Salesman Problem," Mathematics, MDPI, vol. 10(18), pages 1-34, September.
  74. TALARICO, Luca & MEISEL, Frank & SÖRENSEN, Kenneth, 2014. "Ambulance routing for disaster response with patient groups," Working Papers 2014005, University of Antwerp, Faculty of Business and Economics.
  75. Sivrikaya-Serifoglu, Funda & Ulusoy, Gunduz, 1998. "A bicriteria two-machine permutation flowshop problem," European Journal of Operational Research, Elsevier, vol. 107(2), pages 414-430, June.
  76. Ze Pan & Xinyun Wu & Caiquan Xiong, 2023. "Dual-Neighborhood Search for Solving the Minimum Dominating Tree Problem," Mathematics, MDPI, vol. 11(19), pages 1-20, October.
  77. Rafael Martí & Abraham Duarte & Manuel Laguna, 2009. "Advanced Scatter Search for the Max-Cut Problem," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 26-38, February.
  78. Chris Clifton & Ananth Iyer & Richard Cho & Wei Jiang & Murat Kantarc{i}ou{g}lu & Jaideep Vaidya, 2008. "An Approach to Securely Identifying Beneficial Collaboration in Decentralized Logistics Systems," Manufacturing & Service Operations Management, INFORMS, vol. 10(1), pages 108-125, January.
  79. Hongyu Zhou & Zheng Dong & Gennady Verkhivker & Brian D Zoltowski & Peng Tao, 2019. "Allosteric mechanism of the circadian protein Vivid resolved through Markov state model and machine learning analysis," PLOS Computational Biology, Public Library of Science, vol. 15(2), pages 1-28, February.
  80. Daniels, Richard L. & Rummel, Jeffrey L. & Schantz, Robert, 1998. "A model for warehouse order picking," European Journal of Operational Research, Elsevier, vol. 105(1), pages 1-17, February.
  81. Wagner, Bret J. & Davis, Darwin J., 2002. "A search heuristic for the sequence-dependent economic lot scheduling problem," European Journal of Operational Research, Elsevier, vol. 141(1), pages 133-146, August.
  82. Burger, M. & Su, Z. & De Schutter, B., 2018. "A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 265(2), pages 463-477.
  83. Escobar, John Willmer & Linfati, Rodrigo & Baldoquin, Maria G. & Toth, Paolo, 2014. "A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 344-356.
  84. Qiu, Yuzhuo & Ni, Ming & Wang, Liang & Li, Qinqin & Fang, Xuanjing & Pardalos, Panos M., 2018. "Production routing problems with reverse logistics and remanufacturing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 111(C), pages 87-100.
  85. Petra Schuurman & Tjark Vredeveld, 2007. "Performance Guarantees of Local Search for Multiprocessor Scheduling," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 52-63, February.
  86. Tânia Rodrigues Pereira Ramos & Maria Isabel Gomes & Ana Paula Barbosa-Póvoa, 2020. "A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(1), pages 75-110, March.
  87. Yannis Marinakis & Athanasios Migdalas & Panos M. Pardalos, 2009. "Multiple phase neighborhood Search—GRASP based on Lagrangean relaxation, random backtracking Lin–Kernighan and path relinking for the TSP," Journal of Combinatorial Optimization, Springer, vol. 17(2), pages 134-156, February.
  88. Gamboa, Dorabela & Rego, Cesar & Glover, Fred, 2005. "Data structures and ejection chains for solving large-scale traveling salesman problems," European Journal of Operational Research, Elsevier, vol. 160(1), pages 154-171, January.
  89. Dijkstra, Arjan S. & Roodbergen, Kees Jan, 2017. "Exact route-length formulas and a storage location assignment heuristic for picker-to-parts warehouses," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 102(C), pages 38-59.
  90. Zi-bin Jiang & Qiong Yang, 2016. "A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem," PLOS ONE, Public Library of Science, vol. 11(11), pages 1-15, November.
  91. Verena Schmid & Karl F. Doerner, 2014. "Examination and Operating Room Scheduling Including Optimization of Intrahospital Routing," Transportation Science, INFORMS, vol. 48(1), pages 59-77, February.
  92. Agustín Montero & Juan José Miranda-Bront & Isabel Méndez-Díaz, 2017. "An ILP-based local search procedure for the VRP with pickups and deliveries," Annals of Operations Research, Springer, vol. 259(1), pages 327-350, December.
  93. Stefan Poikonen & Bruce Golden, 2020. "The Mothership and Drone Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 249-262, April.
  94. Carrese, Stefano & Cuneo, Valerio & Nigro, Marialisa & Pizzuti, Raffaele & Ardito, Cosimo Federico & Marseglia, Guido, 2022. "Optimization of downstream fuel logistics based on road infrastructure conditions and exposure to accident events," Transport Policy, Elsevier, vol. 124(C), pages 96-105.
  95. Mor, A. & Speranza, M.G. & Viegas, J.M., 2020. "Efficient loading and unloading operations via a booking system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
  96. L Zeng & H L Ong & K M Ng, 2007. "A generalized crossing local search method for solving vehicle routing problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(4), pages 528-532, April.
  97. Steven Prestwich, 2007. "Exploiting relaxation in local search for LABS," Annals of Operations Research, Springer, vol. 156(1), pages 129-141, December.
  98. Jonatas B. C. Chagas & Julian Blank & Markus Wagner & Marcone J. F. Souza & Kalyanmoy Deb, 2021. "A non-dominated sorting based customized random-key genetic algorithm for the bi-objective traveling thief problem," Journal of Heuristics, Springer, vol. 27(3), pages 267-301, June.
  99. CASTRO, Marco & SÖRENSEN, Kenneth & GOOS, Peter & VANSTEENWEGEN, Pieter, 2014. "The multiple travelling salesperson problem with hotel selection," Working Papers 2014030, University of Antwerp, Faculty of Business and Economics.
  100. Hipólito Hernández-Pérez & Juan-José Salazar-González, 2004. "Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem," Transportation Science, INFORMS, vol. 38(2), pages 245-255, May.
  101. Taillard, Éric D. & Helsgaun, Keld, 2019. "POPMUSIC for the travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 272(2), pages 420-429.
  102. R Aringhieri & R Cordone, 2011. "Comparing local search metaheuristics for the maximum diversity problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(2), pages 266-280, February.
  103. Xiaoyan Zhang & Donglei Du & Gregory Gutin & Qiaoxia Ming & Jian Sun, 2022. "Approximation algorithms with constant ratio for general cluster routing problems," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2499-2514, November.
  104. Van Breedam, Alex, 1995. "Improvement heuristics for the Vehicle Routing Problem based on simulated annealing," European Journal of Operational Research, Elsevier, vol. 86(3), pages 480-490, November.
  105. J Faulin & A García del Valle, 2008. "Solving the capacitated vehicle routing problem using the ALGELECT electrostatic algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(12), pages 1685-1695, December.
  106. Ozgur, C. O. & Brown, J. R., 1995. "A two-stage traveling salesman procedure for the single machine sequence-dependent scheduling problem," Omega, Elsevier, vol. 23(2), pages 205-219, April.
  107. Sun, T. & Meakin, P. & Jøssang, T., 1993. "A fast optimization method based on a hierarchical strategy for the travelling salesman problem," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 199(2), pages 232-242.
  108. Ziauddin Ursani & David W. Corne, 2016. "Introducing Complexity Curtailing Techniques for the Tour Construction Heuristics for the Travelling Salesperson Problem," Journal of Optimization, Hindawi, vol. 2016, pages 1-15, August.
  109. de Koster, M.B.M. & Le-Duc, T. & Roodbergen, K.J., 2006. "Design and Control of Warehouse Order Picking: a literature review," ERIM Report Series Research in Management ERS-2006-005-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.
  110. N. A. Arellano-Arriaga & J. Molina & S. E. Schaeffer & A. M. Álvarez-Socarrás & I. A. Martínez-Salazar, 2019. "A bi-objective study of the minimum latency problem," Journal of Heuristics, Springer, vol. 25(3), pages 431-454, June.
  111. William Cook & Paul Seymour, 2003. "Tour Merging via Branch-Decomposition," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 233-248, August.
  112. Chen, Yu-Wang & Zhu, Yao-Jia & Yang, Gen-Ke & Lu, Yong-Zai, 2011. "Improved extremal optimization for the asymmetric traveling salesman problem," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(23), pages 4459-4465.
  113. Bassetto, Tatiana & Mason, Francesco, 2011. "Heuristic algorithms for the 2-period balanced Travelling Salesman Problem in Euclidean graphs," European Journal of Operational Research, Elsevier, vol. 208(3), pages 253-262, February.
  114. Julia Rieck & Jürgen Zimmermann & Matthias Glagow, 2007. "Tourenplanung mittelständischer Speditionsunternehmen in Stückgutkooperationen: Modellierung und heuristische Lösungsverfahren," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 17(4), pages 365-388, January.
  115. Francesco Carrabs & Jean-François Cordeau & Gilbert Laporte, 2007. "Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 618-632, November.
  116. Calvete, Herminia I. & Galé, Carmen & Iranzo, José A., 2013. "An efficient evolutionary algorithm for the ring star problem," European Journal of Operational Research, Elsevier, vol. 231(1), pages 22-33.
  117. Federica Ricca & Andrea Scozzari & Bruno Simeone, 2013. "Political Districting: from classical models to recent approaches," Annals of Operations Research, Springer, vol. 204(1), pages 271-299, April.
  118. Lin Zhou & Xu Wang & Lin Ni & Yun Lin, 2016. "Location-Routing Problem with Simultaneous Home Delivery and Customer’s Pickup for City Distribution of Online Shopping Purchases," Sustainability, MDPI, vol. 8(8), pages 1-20, August.
  119. Angelelli, E. & Archetti, C. & Vindigni, M., 2014. "The Clustered Orienteering Problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 404-414.
  120. Lamb, John D., 2012. "Variable neighbourhood structures for cycle location problems," European Journal of Operational Research, Elsevier, vol. 223(1), pages 15-26.
  121. Colin Osterman & César Rego, 2016. "A k-level data structure for large-scale traveling salesman problems," Annals of Operations Research, Springer, vol. 244(2), pages 583-601, September.
  122. Rego, Cesar, 2001. "Technical note on the paper "An empirical study of a new metaheuristic for the traveling salesman problem" (by Shigeru Tsubakitani, James R. Evans, European Journal of Operational Research 1," European Journal of Operational Research, Elsevier, vol. 129(2), pages 456-459, March.
  123. Thomas Breugem & Twan Dollevoet & Dennis Huisman, 2022. "Is Equality Always Desirable? Analyzing the Trade-Off Between Fairness and Attractiveness in Crew Rostering," Management Science, INFORMS, vol. 68(4), pages 2619-2641, April.
  124. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
  125. Xu, Jiefeng & Sohoni, Milind & McCleery, Mike & Bailey, T. Glenn, 2006. "A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems," European Journal of Operational Research, Elsevier, vol. 169(3), pages 978-993, March.
  126. Yannis Marinakis & Athanasios Migdalas & Panos M. Pardalos, 2005. "A Hybrid Genetic—GRASP Algorithm Using Lagrangean Relaxation for the Traveling Salesman Problem," Journal of Combinatorial Optimization, Springer, vol. 10(4), pages 311-326, December.
  127. Rajabighamchi, Farzaneh & van Hoesel, Stan & Defryn, Christof, 2023. "The order picking problem under a scattered storage policy," Research Memorandum 006, Maastricht University, Graduate School of Business and Economics (GSBE).
  128. Jung, Jung Woo & Lee, Young Hae, 2010. "Heuristic algorithms for production and transportation planning through synchronization of a serial supply chain," International Journal of Production Economics, Elsevier, vol. 124(2), pages 433-447, April.
  129. Lucas García & Pedro M. Talaván & Javier Yáñez, 2022. "The 2-opt behavior of the Hopfield Network applied to the TSP," Operational Research, Springer, vol. 22(2), pages 1127-1155, April.
  130. Gary R. Waissi & Pragya Kaushal, 2020. "A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP," OPSEARCH, Springer;Operational Research Society of India, vol. 57(1), pages 73-87, March.
  131. R Torres-Velázquez & V Estivill-Castro, 2004. "Local search for Hamiltonian Path with applications to clustering visitation paths," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(7), pages 737-748, July.
  132. David Applegate & William Cook & André Rohe, 2003. "Chained Lin-Kernighan for Large Traveling Salesman Problems," INFORMS Journal on Computing, INFORMS, vol. 15(1), pages 82-92, February.
  133. Richa Agarwal & Özlem Ergun, 2008. "Ship Scheduling and Network Design for Cargo Routing in Liner Shipping," Transportation Science, INFORMS, vol. 42(2), pages 175-196, May.
  134. Lozano, M. & Molina, D. & GarcI´a-MartI´nez, C., 2011. "Iterated greedy for the maximum diversity problem," European Journal of Operational Research, Elsevier, vol. 214(1), pages 31-38, October.
  135. Sleman Saliba, 2006. "Heuristics for the lexicographic max-ordering vehicle routing 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. 14(3), pages 313-336, September.
  136. George Vairaktarakis & Janice Kim Winch, 1999. "Worker Cross-Training in Paced Assembly Lines," Manufacturing & Service Operations Management, INFORMS, vol. 1(2), pages 112-131.
  137. Jari Kyngäs & Kimmo Nurmi & Nico Kyngäs & George Lilley & Thea Salter & Dries Goossens, 2017. "Scheduling the Australian Football League," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(8), pages 973-982, August.
  138. Erfan Babaee Tirkolaee & Alireza Goli & Selma Gütmen & Gerhard-Wilhelm Weber & Katarzyna Szwedzka, 2023. "A novel model for sustainable waste collection arc routing problem: Pareto-based algorithms," Annals of Operations Research, Springer, vol. 324(1), pages 189-214, May.
  139. Luca Maria Gambardella & Marco Dorigo, 2000. "An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 237-255, August.
  140. Paolo Gianessi & Laurent Alfandari & Lucas Létocart & Roberto Wolfler Calvo, 2016. "The Multicommodity-Ring Location Routing Problem," Transportation Science, INFORMS, vol. 50(2), pages 541-558, May.
  141. Hyun Seop Uhm & Young Hoon Lee, 2022. "Vehicle routing problem under safe separation distance for multiple unmanned aerial vehicle operation," Operational Research, Springer, vol. 22(5), pages 5107-5136, November.
  142. Yuichi Nagata & Shigenobu Kobayashi, 2013. "A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 346-363, May.
  143. Emde, Simon & Tahirov, Nail & Gendreau, Michel & Glock, Christoph H., 2021. "Routing automated lane-guided transport vehicles in a warehouse handling returns," European Journal of Operational Research, Elsevier, vol. 292(3), pages 1085-1098.
  144. de Koster, Rene & Le-Duc, Tho & Roodbergen, Kees Jan, 2007. "Design and control of warehouse order picking: A literature review," European Journal of Operational Research, Elsevier, vol. 182(2), pages 481-501, October.
  145. Ellegood, William A. & Solomon, Stanislaus & North, Jeremy & Campbell, James F., 2020. "School bus routing problem: Contemporary trends and research directions," Omega, Elsevier, vol. 95(C).
  146. Triki, E. & Collette, Y. & Siarry, P., 2005. "A theoretical study on the behavior of simulated annealing leading to a new cooling schedule," European Journal of Operational Research, Elsevier, vol. 166(1), pages 77-92, October.
  147. R. Dekker & M. B. M. de Koster & K. J. Roodbergen & H. van Kalleveen, 2004. "Improving Order-Picking Response Time at Ankor's Warehouse," Interfaces, INFORMS, vol. 34(4), pages 303-313, August.
  148. Haitao Xu & Pan Pu & Feng Duan, 2018. "Dynamic Vehicle Routing Problems with Enhanced Ant Colony Optimization," Discrete Dynamics in Nature and Society, Hindawi, vol. 2018, pages 1-13, February.
  149. Taillard, Éric D., 2022. "A linearithmic heuristic for the travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 297(2), pages 442-450.
  150. Chiang, Wen-Chyuan & Russell, Robert A., 2004. "Integrating purchasing and routing in a propane gas supply chain," European Journal of Operational Research, Elsevier, vol. 154(3), pages 710-729, May.
  151. Heather S. Lutz & Trevor S. Hale & Faizul Huq, 2020. "Technical note: the expected length of an orderly path," Annals of Operations Research, Springer, vol. 289(2), pages 463-472, June.
  152. TALARICO, Luca & SÖRENSEN, Kenneth & SPRINGAEL, Johan, 2013. "The k-dissimilar vehicle routing problem," Working Papers 2013029, University of Antwerp, Faculty of Business and Economics.
  153. J Renaud & F F Boctor & G Laporte, 2004. "Efficient heuristics for Median Cycle Problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 179-186, February.
  154. Jaszkiewicz, Andrzej, 2018. "Many-Objective Pareto Local Search," European Journal of Operational Research, Elsevier, vol. 271(3), pages 1001-1013.
  155. 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.
  156. 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.
  157. Dominik Goeke & Michael Schneider, 2021. "Modeling Single-Picker Routing Problems in Classical and Modern Warehouses," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 436-451, May.
  158. Rego, César & Duarte, Renato, 2009. "A filter-and-fan approach to the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 194(3), pages 650-662, May.
  159. Talarico, L. & Sörensen, K. & Springael, J., 2015. "The k-dissimilar vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 129-140.
  160. Zhou, Lin & Zhen, Lu & Baldacci, Roberto & Boschetti, Marco & Dai, Ying & Lim, Andrew, 2021. "A Heuristic Algorithm for solving a large-scale real-world territory design problem," Omega, Elsevier, vol. 103(C).
  161. Di Placido, Andrea & Archetti, Claudia & Cerrone, Carmine & Golden, Bruce, 2023. "The generalized close enough traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 310(3), pages 974-991.
  162. Andrzej Jaszkiewicz & Thibaut Lust, 2017. "Proper balance between search towards and along Pareto front: biobjective TSP case study," Annals of Operations Research, Springer, vol. 254(1), pages 111-130, July.
  163. Riera-Ledesma, Jorge & Salazar-Gonzalez, Juan Jose, 2005. "A heuristic approach for the Travelling Purchaser Problem," European Journal of Operational Research, Elsevier, vol. 162(1), pages 142-152, April.
  164. He, Pengfei & Hao, Jin-Kao, 2023. "Memetic search for the minmax multiple traveling salesman problem with single and multiple depots," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1055-1070.
  165. Claudia Archetti & Luca Bertazzi & Alain Hertz & M. Grazia Speranza, 2012. "A Hybrid Heuristic for an Inventory Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 101-116, February.
  166. William J. Wolfe, 1999. "A Fuzzy Hopfield-Tank Traveling Salesman Problem Model," INFORMS Journal on Computing, INFORMS, vol. 11(4), pages 329-344, November.
  167. Negenman, Ebbe G., 2001. "Local search algorithms for the multiprocessor flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 128(1), pages 147-158, January.
  168. Rego, Cesar & Roucairol, Catherine, 1995. "Using Tabu search for solving a dynamic multi-terminal truck dispatching problem," European Journal of Operational Research, Elsevier, vol. 83(2), pages 411-429, June.
  169. repec:jss:jstsof:25:i03 is not listed on IDEAS
  170. 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.
  171. Archetti, Claudia & Carrabs, Francesco & Cerulli, Raffaele, 2018. "The Set Orienteering Problem," European Journal of Operational Research, Elsevier, vol. 267(1), pages 264-272.
  172. Ren, Jintong & Hao, Jin-Kao & Wu, Feng & Fu, Zhang-Hua, 2023. "An effective hybrid search algorithm for the multiple traveling repairman problem with profits," European Journal of Operational Research, Elsevier, vol. 304(2), pages 381-394.
  173. Tsubakitani, Shigeru & Evans, James R., 1998. "An empirical study of a new metaheuristic for the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 104(1), pages 113-128, January.
  174. F. Mendivil & R. Shonkwiler & M. C. Spruill, 2005. "Analysis of Random Restart and Iterated Improvement for Global Optimization with Application to the Traveling Salesman Problem," Journal of Optimization Theory and Applications, Springer, vol. 124(2), pages 407-433, February.
  175. Calvete, Herminia I. & Galé, Carmen & Iranzo, José A., 2016. "MEALS: A multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem," European Journal of Operational Research, Elsevier, vol. 250(2), pages 377-388.
  176. Li, Jianxiang & Chen, Haoxun & Chu, Feng, 2010. "Performance evaluation of distribution strategies for the inventory routing problem," European Journal of Operational Research, Elsevier, vol. 202(2), pages 412-419, April.
  177. Chuck Holland & Jack Levis & Ranganath Nuggehalli & Bob Santilli & Jeff Winters, 2017. "UPS Optimizes Delivery Routes," Interfaces, INFORMS, vol. 47(1), pages 8-23, February.
  178. Li, Yantong & Chu, Feng & Chu, Chengbin & Zhu, Zhanguo, 2019. "An efficient three-level heuristic for the large-scaled multi-product production routing problem with outsourcing," European Journal of Operational Research, Elsevier, vol. 272(3), pages 914-927.
  179. Hwang, Heung-Suk, 2005. "An integrated distribution routing model in multi-supply center system," International Journal of Production Economics, Elsevier, vol. 98(2), pages 136-142, November.
  180. César Rego & Fred Glover, 2010. "Ejection chain and filter-and-fan methods in combinatorial optimization," Annals of Operations Research, Springer, vol. 175(1), pages 77-105, March.
  181. Chu, Ching-Wu, 2005. "A heuristic algorithm for the truckload and less-than-truckload problem," European Journal of Operational Research, Elsevier, vol. 165(3), pages 657-667, September.
  182. Yves Molenbruch & Kris Braekers & An Caris, 2017. "Typology and literature review for dial-a-ride problems," Annals of Operations Research, Springer, vol. 259(1), pages 295-325, December.
  183. Jiang, Zhongzhou & Liu, Jing & Wang, Shuai, 2016. "Traveling salesman problems with PageRank Distance on complex networks reveal community structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 463(C), pages 293-302.
  184. Irnich, Stefan, 2008. "Solution of real-world postman problems," European Journal of Operational Research, Elsevier, vol. 190(1), pages 52-67, October.
  185. Gahm, Christian & Brabänder, Christian & Tuma, Axel, 2017. "Vehicle routing with private fleet, multiple common carriers offering volume discounts, and rental options," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 97(C), pages 192-216.
  186. Sönke Wieczorrek & Christian Thies & Christian Weckenborg & Martin Grunewald & Thomas S. Spengler, 2024. "Volkswagen Group Logistics Applies Operations Research to Optimize Supplier Development," Interfaces, INFORMS, vol. 54(2), pages 147-161, March.
  187. Sheldon H. Jacobson & Shane N. Hall & Laura A. McLay & Jeffrey E. Orosz, 2005. "Performance Analysis of Cyclical Simulated Annealing Algorithms," Methodology and Computing in Applied Probability, Springer, vol. 7(2), pages 183-201, June.
  188. Elena Nechita & Gloria Cerasela Crişan & Laszlo Barna Iantovics & Yitong Huang, 2020. "On the Resilience of Ant Algorithms. Experiment with Adapted MMAS on TSP," Mathematics, MDPI, vol. 8(5), pages 1-20, May.
  189. Farasat, Alireza & Nikolaev, Alexander G., 2016. "Signed social structure optimization for shift assignment in the nurse scheduling problem," Socio-Economic Planning Sciences, Elsevier, vol. 56(C), pages 3-13.
  190. 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.
  191. Yuan Sun & Andreas Ernst & Xiaodong Li & Jake Weiner, 2021. "Generalization of machine learning for problem reduction: a case study on travelling salesman problems," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(3), pages 607-633, September.
  192. Nikolakopoulos, Athanassios & Sarimveis, Haralambos, 2007. "A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1911-1929, March.
  193. Egon Balas & Neil Simonetti, 2001. "Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study," INFORMS Journal on Computing, INFORMS, vol. 13(1), pages 56-75, February.
  194. Bruce Golden & Zahra Naji-Azimi & S. Raghavan & Majid Salari & Paolo Toth, 2012. "The Generalized Covering Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 24(4), pages 534-553, November.
  195. Sohrabi, Somayeh & Ziarati, Koorush & Keshtkaran, Morteza, 2020. "A Greedy Randomized Adaptive Search Procedure for the Orienteering Problem with Hotel Selection," European Journal of Operational Research, Elsevier, vol. 283(2), pages 426-440.
  196. Wayne Desarbo, 1982. "Gennclus: New models for general nonhierarchical clustering analysis," Psychometrika, Springer;The Psychometric Society, vol. 47(4), pages 449-475, December.
  197. Karapetyan, D. & Gutin, G., 2011. "Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 208(3), pages 221-232, February.
  198. G Babin & S Deneault & G Laporte, 2007. "Improvements to the Or-opt heuristic for the symmetric travelling salesman problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(3), pages 402-407, March.
  199. James P. Kelly & Jiefeng Xu, 1999. "A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 161-172, May.
  200. 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.
  201. Rui Xu & Yumiao Huang & Wei Xiao, 2023. "A Two-Level Variable Neighborhood Descent for a Split Delivery Clustered Vehicle Routing Problem with Soft Cluster Conflicts and Customer-Related Costs," Sustainability, MDPI, vol. 15(9), pages 1-22, May.
  202. Li, Yanzhi & Tao, Yi & Wang, Fan, 2009. "A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning," European Journal of Operational Research, Elsevier, vol. 199(2), pages 553-560, December.
  203. Xuanjing Fang & Yanan Du & Yuzhuo Qiu, 2017. "Reducing Carbon Emissions in a Closed-Loop Production Routing Problem with Simultaneous Pickups and Deliveries under Carbon Cap-and-Trade," Sustainability, MDPI, vol. 9(12), pages 1-15, November.
  204. Talarico, Luca & Sörensen, Kenneth & Springael, Johan, 2015. "Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 244(2), pages 457-470.
  205. N. Absi & C. Archetti & S. Dauzère-Pérès & D. Feillet, 2015. "A Two-Phase Iterative Heuristic Approach for the Production Routing Problem," Transportation Science, INFORMS, vol. 49(4), pages 784-795, November.
  206. L Vogt & C A Poojari & J E Beasley, 2007. "A tabu search algorithm for the single vehicle routing allocation problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(4), pages 467-480, April.
  207. Michael Brusco & Hans-Friedrich Köhn, 2008. "Optimal Partitioning of a Data Set Based on the p-Median Model," Psychometrika, Springer;The Psychometric Society, vol. 73(1), pages 89-105, March.
  208. Pei-Chann Chang & Shih-Hsin Chen & Chin-Yuan Fan & V. Mani, 2010. "Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems," Annals of Operations Research, Springer, vol. 180(1), pages 197-211, November.
  209. Chris Groër & Bruce Golden & Edward Wasil, 2011. "A Parallel Algorithm for the Vehicle Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 23(2), pages 315-330, May.
  210. G Laporte, 2010. "A concise guide to the Traveling Salesman Problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(1), pages 35-40, January.
  211. Helsgaun, Keld, 2000. "An effective implementation of the Lin-Kernighan traveling salesman heuristic," European Journal of Operational Research, Elsevier, vol. 126(1), pages 106-130, October.
  212. William Cook & André Rohe, 1999. "Computing Minimum-Weight Perfect Matchings," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 138-148, May.
  213. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
  214. Akiyoshi Shioura, 2015. "Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 192-225, February.
  215. Joao CARDOSO NETO & Cleibson Aparecido de ALMEIDA & Giovani ROVEROTO & José Danilo Haick TAVARES, 2012. "Applications of Operational Research Techniques in Optimization to Visit Tourist Points of Vina del Mar," Informatica Economica, Academy of Economic Studies - Bucharest, Romania, vol. 16(2), pages 5-13.
  216. Karen Aardal & Cor Hurkens & Jan Karel Lenstra & Sergey Tiourine, 2002. "Algorithms for Radio Link Frequency Assignment: The Calma Project," Operations Research, INFORMS, vol. 50(6), pages 968-980, December.
  217. Jamal Ouenniche & Prasanna K. Ramaswamy & Michel Gendreau, 2017. "A dual local search framework for combinatorial optimization problems with TSP application," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(11), pages 1377-1398, November.
  218. Chris Walshaw, 2002. "A Multilevel Approach to the Travelling Salesman Problem," Operations Research, INFORMS, vol. 50(5), pages 862-877, October.
  219. Breugem, T. & Dollevoet, T.A.B. & Huisman, D., 2017. "Is Equality always desirable?," Econometric Institute Research Papers EI2017-30, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
  220. Luc Muyldermans & Patrick Beullens & Dirk Cattrysse & Dirk Van Oudheusden, 2005. "Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem," Operations Research, INFORMS, vol. 53(6), pages 982-995, December.
  221. Çavdar, Bahar & Sokol, Joel, 2015. "TSP Race: Minimizing completion time in time-sensitive applications," European Journal of Operational Research, Elsevier, vol. 244(1), pages 47-54.
  222. Gliesch, Alex & Ritt, Marcus, 2021. "A hybrid heuristic for the maximum dispersion problem," European Journal of Operational Research, Elsevier, vol. 288(3), pages 721-735.
  223. Soylu, Mustafa & Ozdemirel, Nur E. & Kayaligil, Sinan, 2000. "A self-organizing neural network approach for the single AGV routing problem," European Journal of Operational Research, Elsevier, vol. 121(1), pages 124-137, February.
  224. Braekers, Kris & Caris, An & Janssens, Gerrit K., 2014. "Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 166-186.
  225. Don A. Grundel & Pavlo A. Krokhmal & Carlos A. S. Oliveira & Panos M. Pardalos, 2007. "On the number of local minima for the multidimensional assignment problem," Journal of Combinatorial Optimization, Springer, vol. 13(1), pages 1-18, January.
  226. Amit Verma & Ann Melissa Campbell, 2019. "Strategic placement of telemetry units considering customer usage correlation," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(1), pages 35-64, March.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.