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

New Insertion and Postoptimization Procedures 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. Michel Gendreau & Manuel Iori & Gilbert Laporte & Silvano Martello, 2006. "A Tabu Search Algorithm for a Routing and Container Loading Problem," Transportation Science, INFORMS, vol. 40(3), pages 342-350, August.
  2. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
  3. X-Y Li & P Tian & S C H Leung, 2009. "An ant colony optimization metaheuristic hybridized with tabu search for open vehicle routing problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(7), pages 1012-1025, July.
  4. 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.
  5. Bagchi, Tapan P. & Gupta, Jatinder N.D. & Sriskandarajah, Chelliah, 2006. "A review of TSP based approaches for flowshop scheduling," European Journal of Operational Research, Elsevier, vol. 169(3), pages 816-854, March.
  6. Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2014. "Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem," Transportation Science, INFORMS, vol. 48(1), pages 20-45, February.
  7. F Alonso & M J Alvarez & J E Beasley, 2008. "A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(7), pages 963-976, July.
  8. C. Archetti & M. G. Speranza & A. Hertz, 2006. "A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem," Transportation Science, INFORMS, vol. 40(1), pages 64-73, February.
  9. Imran, Arif & Salhi, Said & Wassan, Niaz A., 2009. "A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 197(2), pages 509-518, September.
  10. Gianpaolo Ghiani & Gilbert Laporte & Frédéric Semet, 2006. "The Black and White Traveling Salesman Problem," Operations Research, INFORMS, vol. 54(2), pages 366-378, April.
  11. Brandão, José, 2009. "A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 195(3), pages 716-728, June.
  12. Ulsrud, Karl Petter & Vandvik, Anders Helgeland & Ormevik, Andreas Breivik & Fagerholt, Kjetil & Meisel, Frank, 2022. "A time-dependent vessel routing problem with speed optimization," European Journal of Operational Research, Elsevier, vol. 303(2), pages 891-907.
  13. Derigs, Ulrich & Kurowsky, René & Vogel, Ulrich, 2011. "Solving a real-world vehicle routing problem with multiple use of tractors and trailers and EU-regulations for drivers arising in air cargo road feeder services," European Journal of Operational Research, Elsevier, vol. 213(1), pages 309-319, August.
  14. 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.
  15. Kitamura, Ryuichi & Chen, Cynthia & Chen, Jiayu, 1999. "Daily Activity and Multimodal Travel Planner: Phase II Final Report," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt5354w222, Institute of Transportation Studies, UC Berkeley.
  16. Hemmelmayr, Vera C. & Doerner, Karl F. & Hartl, Richard F., 2009. "A variable neighborhood search heuristic for periodic routing problems," European Journal of Operational Research, Elsevier, vol. 195(3), pages 791-802, June.
  17. Biao Yuan & Zhibin Jiang, 2017. "Disruption Management for the Real-Time Home Caregiver Scheduling and Routing Problem," Sustainability, MDPI, vol. 9(12), pages 1-15, November.
  18. I.N. Kamal Abadi & Nicholas G. Hall & Chelliah Sriskandarajah, 2000. "Minimizing Cycle Time in a Blocking Flowshop," Operations Research, INFORMS, vol. 48(1), pages 177-180, February.
  19. Berbotto, Leonardo & García, Sergio & Nogales, Francisco J., 2011. "A vehicle routing model with split delivery and stop nodes," DES - Working Papers. Statistics and Econometrics. WS ws110906, Universidad Carlos III de Madrid. Departamento de Estadística.
  20. Fleszar, Krzysztof & Osman, Ibrahim H. & Hindi, Khalil S., 2009. "A variable neighbourhood search algorithm for the open vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 195(3), pages 803-809, June.
  21. Liu, Ran & Xie, Xiaolan & Garaix, Thierry, 2014. "Hybridization of tabu search with feasible and infeasible local searches for periodic home health care logistics," Omega, Elsevier, vol. 47(C), pages 17-32.
  22. 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.
  23. Steven Chamberland & Brunilde Sansò, 2001. "On the Design Problem of Multitechnology Networks," INFORMS Journal on Computing, INFORMS, vol. 13(3), pages 245-256, August.
  24. 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.
  25. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
  26. Brandao, Jose & Mercer, Alan, 1997. "A tabu search algorithm for the multi-trip vehicle routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 100(1), pages 180-191, July.
  27. Cattaruzza, Diego & Absi, Nabil & Feillet, Dominique & Vidal, Thibaut, 2014. "A memetic algorithm for the Multi Trip Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 236(3), pages 833-848.
  28. Mohan, Srimathy & Gendreau, Michel & Rousseau, Jean-Marc, 2010. "Heuristics for the Stochastic Eulerian Tour Problem," European Journal of Operational Research, Elsevier, vol. 203(1), pages 107-117, May.
  29. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 1-31, July.
  30. Li, Kunpeng & Chen, Bin & Sivakumar, Appa Iyer & Wu, Yong, 2014. "An inventory–routing problem with the objective of travel time minimization," European Journal of Operational Research, Elsevier, vol. 236(3), pages 936-945.
  31. Ahmadi, Reza H. & Mamer, John W., 1999. "Routing heuristics for automated pick and place machines," European Journal of Operational Research, Elsevier, vol. 117(3), pages 533-552, September.
  32. Ann M. Campbell & Barrett W. Thomas, 2008. "Probabilistic Traveling Salesman Problem with Deadlines," Transportation Science, INFORMS, vol. 42(1), pages 1-21, February.
  33. Zhao, Qiu-Hong & Wang, Shou-Yang & Lai, K.K., 2007. "A partition approach to the inventory/routing problem," European Journal of Operational Research, Elsevier, vol. 177(2), pages 786-802, March.
  34. C D Tarantilis & G Ioannou & C T Kiranoudis & G P Prastacos, 2005. "Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(5), pages 588-596, May.
  35. Sumanta Basu & Ghosh, Diptesh, 2008. "A review of the Tabu Search Literature on Traveling Salesman Problems," IIMA Working Papers WP2008-10-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
  36. Dominique Feillet & Pierre Dejax & Michel Gendreau, 2005. "Traveling Salesman Problems with Profits," Transportation Science, INFORMS, vol. 39(2), pages 188-205, May.
  37. 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.
  38. I N Kamal Abadi, 2007. "A new algorithm for minimizing makespan, C max, in blocking flow-shop problem through slowing down the operations," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(1), pages 134-140, January.
  39. Brandao, Jose, 2004. "A tabu search algorithm for the open vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 157(3), pages 552-564, September.
  40. Jeffrey W. Ohlmann & Barrett W. Thomas, 2007. "A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 80-90, February.
  41. Leonardo Berbotto & Sergio García & Francisco Nogales, 2014. "A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem," Annals of Operations Research, Springer, vol. 222(1), pages 153-173, November.
  42. Bahram Alidaee & Haibo Wang, 2017. "A note on heuristic approach based on UBQP formulation of the maximum diversity problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(1), pages 102-110, January.
  43. Hoff, Arild & Gribkovskaia, Irina & Laporte, Gilbert & Løkketangen, Arne, 2009. "Lasso solution strategies for the vehicle routing problem with pickups and deliveries," European Journal of Operational Research, Elsevier, vol. 192(3), pages 755-766, February.
  44. Ho, Sin C. & Szeto, W.Y., 2014. "Solving a static repositioning problem in bike-sharing systems using iterated tabu search," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 69(C), pages 180-198.
  45. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
  46. 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.
  47. François, Véronique & Arda, Yasemin & Crama, Yves & Laporte, Gilbert, 2016. "Large neighborhood search for multi-trip vehicle routing," European Journal of Operational Research, Elsevier, vol. 255(2), pages 422-441.
  48. 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.
  49. Majed G. Alharbi & Ahmed Stohy & Mohammed Elhenawy & Mahmoud Masoud & Hamiden Abd El-Wahed Khalifa, 2021. "Solving Traveling Salesman Problem with Time Windows Using Hybrid Pointer Networks with Time Features," Sustainability, MDPI, vol. 13(22), pages 1-12, November.
  50. Ali Diabat & Tarek Abdallah & Tung Le, 2016. "A hybrid tabu search based heuristic for the periodic distribution inventory problem with perishable goods," Annals of Operations Research, Springer, vol. 242(2), pages 373-398, July.
  51. I H Osman & S Ahmadi, 2007. "Guided construction search metaheuristics for the capacitated p-median problem with single source constraint," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(1), pages 100-114, January.
  52. Renaud, Jacques & Boctor, Fayez F., 2002. "A sweep-based algorithm for the fleet size and mix vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 140(3), pages 618-628, August.
  53. Bernhard Fleischmann & Martin Gietz & Stefan Gnutzmann, 2004. "Time-Varying Travel Times in Vehicle Routing," Transportation Science, INFORMS, vol. 38(2), pages 160-173, May.
  54. Gendreau, Michel & Laporte, Gilbert & Semet, Frederic, 1998. "A tabu search heuristic for the undirected selective travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 539-545, April.
  55. Crainic, Teodor Gabriel & Laporte, Gilbert, 1997. "Planning models for freight transportation," European Journal of Operational Research, Elsevier, vol. 97(3), pages 409-438, March.
  56. Atefi, Reza & Salari, Majid & C. Coelho, Leandro & Renaud, Jacques, 2018. "The open vehicle routing problem with decoupling points," European Journal of Operational Research, Elsevier, vol. 265(1), pages 316-327.
  57. 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.
  58. Hichem Kamoun & Nicholas G. Hall & Chelliah Sriskandarajah, 1999. "Scheduling in Robotic Cells: Heuristics and Cell Design," Operations Research, INFORMS, vol. 47(6), pages 821-835, December.
  59. Zhao, Qiu-Hong & Chen, Shuang & Zang, Cun-Xun, 2008. "Model and algorithm for inventory/routing decision in a three-echelon logistics system," European Journal of Operational Research, Elsevier, vol. 191(3), pages 623-635, December.
  60. 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.
  61. Crevier, Benoit & Cordeau, Jean-Francois & Laporte, Gilbert, 2007. "The multi-depot vehicle routing problem with inter-depot routes," European Journal of Operational Research, Elsevier, vol. 176(2), pages 756-773, January.
  62. Brandao, Jose, 2006. "A new tabu search algorithm for the vehicle routing problem with backhauls," European Journal of Operational Research, Elsevier, vol. 173(2), pages 540-555, September.
  63. Karen Smilowitz & Maciek Nowak & Tingting Jiang, 2013. "Workforce Management in Periodic Delivery Operations," Transportation Science, INFORMS, vol. 47(2), pages 214-230, May.
  64. Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2014. "Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 103-120, February.
  65. Armentano, Vinicius Amaral & de Franca Filho, Moacir Felizardo, 2007. "Minimizing total tardiness in parallel machine scheduling with setup times: An adaptive memory-based GRASP approach," European Journal of Operational Research, Elsevier, vol. 183(1), pages 100-114, November.
  66. 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.
  67. Kitamura, Ryuichi & Chen, Cynthia, 1998. "Daily Activity and Multimodal Travel Planner: Phase 1 Report," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt2jq8524g, Institute of Transportation Studies, UC Berkeley.
  68. Caraffa, Vince & Ianes, Stefano & P. Bagchi, Tapan & Sriskandarajah, Chelliah, 2001. "Minimizing makespan in a blocking flowshop using genetic algorithms," International Journal of Production Economics, Elsevier, vol. 70(2), pages 101-115, March.
  69. 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.
  70. E. G. Birgin & J. M. Martínez, 2022. "Block coordinate descent for smooth nonconvex constrained minimization," Computational Optimization and Applications, Springer, vol. 83(1), pages 1-27, September.
  71. Franca, Paulo M. & Gendreau, Michel & Laporte, Gilbert & Muller, Felipe M., 1996. "A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times," International Journal of Production Economics, Elsevier, vol. 43(2-3), pages 79-89, June.
  72. Zachariadis, Emmanouil E. & Tarantilis, Christos D. & Kiranoudis, Christos T., 2009. "A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 195(3), pages 729-743, June.
  73. 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.
  74. Zheng, Jianfeng & Meng, Qiang & Sun, Zhuo, 2015. "Liner hub-and-spoke shipping network design," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 75(C), pages 32-48.
  75. Johanns, Patrick & Lowe, Tim & Plante, Robert, 2001. "Selection and sequencing heuristics to reduce variance in gas turbine engine nozzle assemblies," European Journal of Operational Research, Elsevier, vol. 132(3), pages 490-504, August.
  76. Erdogan, Günes & Cordeau, Jean-François & Laporte, Gilbert, 2010. "The Attractive Traveling Salesman Problem," European Journal of Operational Research, Elsevier, vol. 203(1), pages 59-69, May.
  77. Steven Chamberland & Brunilde Sansò & Odile Marcotte, 2000. "Topological Design of Two-Level Telecommunication Networks with Modular Switches," Operations Research, INFORMS, vol. 48(5), pages 745-760, October.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.