A simheuristic algorithm for the stochastic one-commodity pickup and delivery travelling salesman problem

References

• Berbeglia, G., Cordeau, J.-F., & Laporte, G. (2010). Dynamic pickup and delivery problems. European Journal of Operational Research, 202 (1), 8–15. https://doi.org/10.1016/j.ejor.2009.04.024.
   Web of Science ®Google Scholar
• Caceres Cruz, J., Grasman, S., Juan, A., Bektas, T., & Faulin, J. (2012, 12). Combining monte-carlo simulation with heuristics for solving the inventory routing problem with stochastic demands. In 2012 winter simulation conference, Berlin, Germany (p. 1–9).
   Google Scholar
• Dell’Amico, M., Hadjicostantinou, E., Iori, M., & Novellani, S. (2014). The bike sharing rebalancing problem: Mathematical formulations and benchmark instances. Omega, 45(0305–0483), 7–19. https://doi.org/10.1016/j.omega.2013.12.001
   Google Scholar
• Dell’Amico, M., Iori, M., Novellani, S., & Subramanian, A. (2018). The bike sharing rebalancing problem with stochastic demands. Transportation Research Part B: Methodological, 118(0191–2615), 362–380. https://doi.org/10.1016/j.trb.2018.10.015
   Google Scholar
• Elhenawy, M., & Rakha, H. (2017, June). A heuristic for rebalancing bike sharing systems based on a deferred acceptance algorithm. In 2017 5th ieee international conference on models and technologies for intelligent transportation systems (mt-its), Naples, Italy (p. 188–193).
   Google Scholar
• Ferone, D., Gruler, A., Festa, P., & Juan, A. (2016, 12). Combining simulation with a grasp metaheuristic for solving the permutation flow-shop problem with stochastic processing times, Washington, DC, USA. (p. 2205–2215).
   Google Scholar
• Festa, P., Pastore, T., Ferone, D., Juan, A., & Bayliss, C. (2018). Integrating biased- randomized grasp with monte carlo simulation for solving the vehicle routing problem with stochastic demands. In M. Rabe, A. A. Juan, N. Mustafee, A. Skoogh, S. Jain, & B. Johansson (Eds.), Pr oceedings of the 2018 winter simulation conference, Piscataway, New Jersey (p. 2989–3000).
   Google Scholar
• Ghorpade, T., & Corlu, C. G. Orlando, FL, USA (2020). Selective pick-up and delivery problem: A simheuristic approach. In 2020 winter simulation conference (wsc) (pp. 1468–1479).
   Google Scholar
• González-Martín, S., Riera, D., Juan, A., Elizondo, M. G., & Casas, P. (2012). Simrandsharp: A hybrid algorithm for solving the arc routing problem with stochastic demands. 2012 winter simulation conference, Berlin, Germany, 1–11.
   Google Scholar
• Grasas, A., Juan, A., Faulin, J., de Armas, J., & Ramalhinho, H. (2017). Biased randomization of heuristics using skewed probability distributions: A survey and some applications. Computers Industrial Engin E Ering, 110(0360–8352), 216–228. https://doi.org/10.1016/j.cie.2017.06.019
   Google Scholar
• Grasas, A., Juan, A., & Lourenço, H. (2014 7). Simils: A simulation-based extension of the iterated local search metaheuristic for stochastic combinatorial optimization. Journal of Simulation, 10(1), 69–77. doi:10.1057/jos.2014.25. https://doi.org/10.1057/jos.2014.25
   Web of Science ®Google Scholar
• Gruler, A., Panadero, J., de Armas, J., Perez, J. A. M., & Juan, A. (2020). A variable neighborhood search simheuristic for the multi- period inventory routing problem with stochastic demands. International Transactions in Operational Research, 27 (1), 314–335. https://onlinelibrary.wiley.com/doi/abs/10.1111/itor.12540
   Web of Science ®Google Scholar
• Guimarans, D., Dominguez, O., Juan, A. A., & Martinez, E. (2016). A multi-start simheuristic for the stochastic two-dimensional vehicle routing problem. In 2016 winter simulation conference, Washington, DC, USA (p. 2326–2334).
   Google Scholar
• Hadjadj, S., & Kheddouci, H. (2018). Estimation-based algorithm for a stochastic one-commodity pick-up & delivery travelling salesman problem. In 7th international conference on metaheuristics and nature inspired computing. Marrakech, Morocco. HAL. https://hal.archives-ouvertes.fr/hal-01960305
   Google Scholar
• Hernández-Pérez, H., Rodríguez-Martín, I., & Salazar-González, J. J. (2009). A hybrid grasp/vnd heuristic for the one-commodity pickup-and-delivery traveling salesman problem. Computers & Operations Research, 36(5), 1639–1645. https://doi.org/10.1016/j.cor.2008.03.008
   Web of Science ®Google Scholar
• Hernández-Pérez, H., & Salazar-González, -J.-J. (2004a). A branch-and- cut algorithm for a traveling salesman problem with pickup and delivery. Discrete Applied Mathematics, 145 (1), 126–139. https://doi.org/10.1016/j.dam.2003.09.013.
   Web of Science ®Google Scholar
• Hernández-Pérez, H., & Salazar-González, -J.-J. (2004b). Heuristics for the one-commodity pickup-and-delivery traveling salesman problem. Transportation Science, 38 (2), 245–255. https://doi.org/10.1287/trsc.1030.0086.
   Web of Science ®Google Scholar
• Hernández-Pérez, H., & Salazar-González, -J.-J. (2007, December). The one- commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms. Networks, 50(4), 258–272. https://doi.org/10.1002/net.20209
   Web of Science ®Google Scholar
• Ho, S. C., & Szeto, W. (2014). Solving a static repositioning problem in bike-sharing systems using iterated tabu search. Transportation Research Part E: Logistics and Transportation R Eview, 69, 180–198. https://doi.org/10.1016/j.tre.2014.05.017
   Web of Science ®Google Scholar
• Hosny, M., & Mumford, C. (2010, 9). Solving the one-commodity pickup and delivery problem using an adaptive hybrid vns/sa approach In Lecture notes in computer science (Vol. 6239, pp. 189–198). Berlin, Heidelberg:Springer.
   Google Scholar
• Juan, A., Barrios, B., Vallada, E., Riera, D., & Jorba Esteve, J. (2014, 3). A simheuristic algorithm for solving the permutation flow shop problem with stochastic processing times. Simulation Modelling Practice and Theory, 46(1569–190X) , 101–117. https://doi.org/10.1016/j.simpat.2014.02.005
   Google Scholar
• Juan, A., Faulin, J., Grasman, S., Rabe, M., & Figueira, G. (2015). A review of simheuristics: Extending metaheuristics to deal with stochastic combinatorial optimization problems. Operations Research Perspectives, 2 (2), 62–72. https://doi.org/10.1016/j.orp.2015.03.001
   Google Scholar
• Juan, A., Faulin, J., Grasman, S., Riera, D., Marull, J., & Méndez, C. (2011, 8). Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands. Transportation Research Part C-emerging Technologies. 19(5), 751–765. https://doi.org/10.1016/j.trc.2010.09.007
   Web of Science ®Google Scholar
• Juan, A., Faulin, J., Jorba Esteve, J., Riera, D., Masip, D., & Barrios, B. (2011 6). On the use of monte carlo simulation, cache and splitting techniques to improve the Clarke and wright savings heuristics. Journal of the Operational Research Society, 62(6), 1085–1097. https://doi.org/10.1057/jors.2010.29
   Web of Science ®Google Scholar
• Juan, A., Kelton, W. D., Currie, C. S., & Faulin, J. (2018). Simheuristics applications: Dealing with uncertainty in logistics, transportation, and other supply chain areas. In 2018 winter simulation conference, Piscataway, New Jersey (pp. 3048–3059).
   Google Scholar
• Juan, A., Panadero, J., Reyes-Rubiano, L., Faulin, J., Torre, R., & Latorre-Biel, J. (2019, 12). Simulation-based optimization in transportation and logistics: Comparing sample average approximation with simheuristics. In 2019 winter simulation conference, National Harbor, MD, USA (p. 1906–1917).
   Google Scholar
• Lin, S., & Kernighan, B. W. An effective heuristic algorithm for the traveling-salesman problem. (1973). Operations Research, 21(2), 498–516. https://doi.org/10.1287/opre.21.2.498
   Web of Science ®Google Scholar
• Louveaux, F., & Salazar-González, -J.-J. (2009, June 1). On the one- commodity pickup-and-delivery traveling salesman problem with stochastic demands. Mathematical Programming, 119(1), 169–194. https://doi.org/10.1007/s10107-008-0206-0
   Web of Science ®Google Scholar
• Maccarrone, L., Giovannelli, T., Ferone, D., Panadero, J., & Juan, A. (2018). A simheuristic algorithm for solving an integrated resource allocation and scheduling problem. In 2018 winter simulation conference, Piscataway, New Jersey (p. 3340–3351). Piscataway, New Jersey.
   Google Scholar
• Mladenovic, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24 (11), 1097–1100. https://doi.org/10.1016/S0305-05489700031-2.
   Web of Science ®Google Scholar
• Mladenović, N., Urošević, D., Hanafi, S., & Ilić, A. (2012). A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. European Journal of Ope Rational Research, 220 (1), 270–285. https://doi.org/10.1016/j.ejor.2012.01.036.
   Web of Science ®Google Scholar
• Nair, D., Grzybowska, H., Fu, Y., & Dixit, V. (2018). Scheduling and routing models for food rescue and delivery operations. Socio-Economic Planning Sciences, 63(0038–0121), 18–32. https://doi.org/10.1016/j.seps.2017.06.003
   Google Scholar
• Onggo, B., Juan, A., Panadero, J., Gunes Corlu, C., & Agustín, A. (2019, 12). An inventory-routing problem with stochastic demand and stock-out: A solution and risk analysis using simheuristics. In 2019 winter simulation conference, National Harbor, MD, USA. (p. 1977–1988).
   Google Scholar
• Rabe, M., & Goldsman, D. (2019). Chapter 12 - decision making using simulation methods in sustainable transportation. In J. Faulin, S. Grasman, A. Juan, & P. Hirsch (Eds.), Sustainable t r ans p ortation and smart logistics (pp. 305–333). Elsevier.
   Google Scholar
• Rey, D., Almi’ani, K., & Nair, D. J. (2018). Exact and heuristic algorithms for finding envy-free allocations in food rescue pickup and delivery logistics. Transportation Research Part E: Logistics and Transportation Review, 112(1366–5545), 19–46. https://doi.org/10.1016/j.tre.2018.02.001
   Google Scholar
• Reyes-Rubiano, L., Faulin, J., Calvet, L., & Juan, A. (2017, 12). A simheuristic approach for freight transportation in smart cities. In 2017 winter simulation conference, Las Vegas, NV, USA. (p. 3346–3357).
   Google Scholar
• Reyes-Rubiano, L., Ferone, D., Juan, A., & Faulin, J. (2019). A simheuristic for routing electric vehicles with limited driving ranges and stochastic travel times. Statistics and Operations Research Transactions, 43(2013–8830), 1–22. doi:10.2436/20.8080.02.77. http://hdl.handle.net/10609/94086
   Google Scholar
• Zhao, F., Li, S., Sun, J., & Mei, D. (2009). Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem. Computers & Industrial Engineering, 56 (4), 1642–1648. https://doi.org/10.1016/j.cie.2008.10.014.
   Web of Science ®Google Scholar