Simulated annealing heuristic for the general share-a-ride problem

References

• Agatz, N., A. Erera, M. Savelsbergh, and X. Wang. 2012. “Optimization for Dynamic Ride-Sharing: A Review.” European Journal of Operational Research 223: 295–303. doi: 10.1016/j.ejor.2012.05.028
   Web of Science ®Google Scholar
• Barnes, J. W., and W. P. Nanry. 2000. “Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search.” Transportation Research Part B: Methodological 34 (2): 107–121. doi: 10.1016/S0191-2615(99)00016-8
   Web of Science ®Google Scholar
• Barreto, S. S. 2004. “Análise e Modelização de Problemas de Localização-distribuição.” [Analysis and Modelling of Location-Routing Problems]. PhD thesis, University of Aveiro. http://hdl.handle.net/10773/1850
   Google Scholar
• Baugh Jr, J. W., G. K. R. Kakivaya, and J. R. Stone. 1998. “Intractability of the Dial-a-Ride Problem and a Multiobjective Solution using Simulated Annealing.” Engineering Optimization 30 (2): 91–123. doi:doi: 10.1080/03052159808941240
   Web of Science ®Google Scholar
• Cordeau, J. F., and G. Laporte. 2003. “A Tabu Search Heuristic for the Static Multi-vehicle Dial-a-Ride Problem.” Transportation Research Part B: Methodological 37: 579–594. doi: 10.1016/S0191-2615(02)00045-0
   Web of Science ®Google Scholar
• Cordeau, J. F., and G. Laporte. 2007. “The Dial-a-Ride Problem: Models and Algorithms.” Annals of Operations Research 153 (1): 29–46. doi: 10.1007/s10479-007-0170-8
   Web of Science ®Google Scholar
• Cordeau, J.-F., M. Gendreau, G. Laporte, J.-Y. Potvin, and F. Semet. 2002. “A Guide to Vehicle Routing Heuristics.” Journal of the Operational Research Society 53: 512–522. doi: 10.1057/palgrave.jors.2601319
   Web of Science ®Google Scholar
• Furuhata, M., M. Dessouky, F. Ordonez, and M.-E. Brunet. 2013. “Ridesharing: The State-of-the-Art and Future Directions.” Transportation Research Part B: Methodological 57: 28–46. doi: 10.1016/j.trb.2013.08.012
   Web of Science ®Google Scholar
• Gehring, H., and J. Homberger. 1999. “A Parallel Hybrid Evolutionary Metaheuristic for the Vehicle Routing Problem with Time Windows.” In Proceeding of EUROGEN99 – Short Course on Evolutionary Algorithms in Engineering and Computer Science – Volume 2. Berlin: Springer. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.617.1364&rep=rep1&type=pdf
   Google Scholar
• Gendreau, M., A. Hertz, and G. Laporte. 1994. “A Tabu Search Heuristic for the Vehicle Routing Problem.” Management Science 40 (10): 1276–1290. doi: 10.1287/mnsc.40.10.1276
   Web of Science ®Google Scholar
• Glover, F. 1986. “Future Paths for Integer Programming and Links to Artificial Intelligence.” Computers & Operations Research 13 (5): 533–549. doi: 10.1016/0305-0548(86)90048-1
   Web of Science ®Google Scholar
• Hosni, H., J. Sawaya, and H. Artail. 2014. “The Shared-Taxi Problem: Formulation and Solution Methods.” Transportation Research Part B: Methodological 70: 303–318. doi: 10.1016/j.trb.2014.09.011
   Web of Science ®Google Scholar
• Kirkpatrick, S., C. D. Gelatt, and M. P. Vecchi. 1983. “Optimization by Simulated Annealing.” Science 220 (4598): 671–680. doi:doi: 10.1126/science.220.4598.671
   PubMed Web of Science ®Google Scholar
• Li, B., D. Krunshinsky, T. V. Woensel, and H. A. Reijers. 2014. “The Share-a-Ride Problem: People and Parcels Sharing Taxis.” European Journal of Operational Research 238: 31–40. doi: 10.1016/j.ejor.2014.03.003
   Web of Science ®Google Scholar
• Li, B., D. Krunshinsky, T. V. Woensel, and H. A. Reijers. 2016. “An Adaptive Large Neighborhood Search Heuristic for the Share-a-Ride Problem.” Computers & Operations Research 66: 170–180. doi: 10.1016/j.cor.2015.08.008
   Web of Science ®Google Scholar
• Lin, S.-W., V. F. Yu, and C.-C. Lu. 2011. “A Simulated Annealing Heuristic for the Truck and Trailer Routing Problem with Time Windows.” Expert Systems with Applications 38 (12): 15244–15252. doi:doi: 10.1016/j.eswa.2011.05.075
   Web of Science ®Google Scholar
• Metropolis, N., A. W. Rosenbluth, M. N. Rosenbluth, and A. H. Teller. 1953. “Equation of State Calculations by Fast Computing Machines.” The Journal of Chemical Physics 21 (6): 1087–1092. doi:doi: 10.1063/1.1699114
   Web of Science ®Google Scholar
• Prins, C., C. Prodhon, and R. Wolfler Calvo. 2004. “Nouveaux algorithmes pour le problème de localisation et routage sous contraintes de capacité.” MOSIM 4 (2): 1115–1122.
   Google Scholar
• Solomon, M. M. 1987. “Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints.” Operations Research 35 (2): 254–265. doi:doi: 10.1287/opre.35.2.254
   Web of Science ®Google Scholar
• Stiglic, M., N. Agatz, M. Savelsbergh, and M. Gradisar. 2016. “Making Dynamic Ride-Sharing Work: The Impact of Driver and Rider Flexibility.” Transportation Research Part E: Logistics and Transportation Review 91: 190–207. doi: 10.1016/j.tre.2016.04.010
   Web of Science ®Google Scholar
• Taillard, É. 1993. “Parallel Iterative Search Methods for Vehicle Routing Problems.” Networks 23 (8): 661–673. doi: 10.1002/net.3230230804
   Web of Science ®Google Scholar
• Tuzun, D., and L. I. Burke. “A Two-phase Tabu Search Approach to the Location Routing Problem.” European Journal of Operational Research 116 (1): 87–99. doi:doi: 10.1016/s0377-2217(98)00107-6
   Web of Science ®Google Scholar
• Velasco, N., P. Dejax, C. Gueret, and C. Prins. 2012. “A Non-dominated Sorting Genetic Algorithm for a Bi-objective Pick-Up and Delivery Problem.” Engineering Optimization 44: 305–325. doi: 10.1080/0305215X.2011.639368
   Web of Science ®Google Scholar
• Xiao, Y., and A. Konak. 2015. “A Simulating Annealing Algorithm to Solve the Green Vehicle Routing & Scheduling Problem with Hierarchical Objectives and Weighted Tardiness.” Applied Soft Computing 34: 372–388. doi:doi: 10.1016/j.asoc.2015.04.054
   Web of Science ®Google Scholar
• Yu, V. F., and S.-Y. Lin. 2015. “A Simulated Annealing Heuristic for the Open Location-routing Problem.” Computers & Operations Research 62: 184–196. doi:doi: 10.1016/j.cor.2014.10.009
   Web of Science ®Google Scholar
• Yu, V. F., A. A. N. P. Redi, Y. Agustina Hidayat, and O. J. Wibowo. 2017. “A Simulated Annealing Heuristic for the Hybrid Vehicle Routing Problem.” Applied Soft Computing 53: 119–132. doi:doi: 10.1016/j.asoc.2016.12.027
   Web of Science ®Google Scholar
• Zidi, I., K. Mesghouni, K. Zidi, and K. Ghedira. 2012. “A Multi-objective Simulated Annealing for the Multi-criteria Dial a Ride Problem.” Engineering Applications of Artificial Intelligence 25 (6): 1121–1131. doi:doi: 10.1016/j.engappai.2012.03.012
   Web of Science ®Google Scholar