6 Considerações finais
6.1 Trabalhos futuros
Para trabalhos futuros se propõe:
1. Definir novas formas de construção de solução para a primeira etapa dos algorit- mos GRASP, para tentar obter melhores soluções iniciais;
2. Acrescentar novos processos de vizinhança no algoritmo VNDP, ou, trocar pro- cessos de vizinhança do algoritmo VNDP por novos processos de vizinhança, para proporcionar uma busca local mais eficiente, que gere melhores soluções e utilize menor espaço de tempo;
3. Encontrar a solução exata das 196 instâncias do conjunto proposto, não localiza- das;
4. Criar novas hibridizações de meta-heurísticas, que possuam uma convergência mais rápida e eficaz da solução para soluções mais próximas do ótimo;
5. Utilizar o embarque exato nas meta-heurísticas que não utilizaram, para que as soluções cheguem mais próximas do ótimo, mesmo que não deixe o algoritmo mais ágil;
6. Utilizar o LKH na etapa de busca local das meta-heurísticas ACO, visto que a combinação do GRASP com o LKH proporcionou melhores soluções;
Referências
AGATZ, N. et al. Optimization for dynamic ride-sharing: A review.European Journal of Operational Research, Elsevier, v. 223, n. 2, p. 295–303, 2012.
AMEY, A.; ATTANUCCI, J.; MISHALANI, R. ?real-time? ridesharing–the opportunities and challenges of utilizing mobile phone technology to improve rideshare services. In:TRB Annual Meeting. [S.l.: s.n.], 2011. p. 1–17.
AUSIELLO, G. et al. Algorithms for the on-line quota traveling salesman problem. In: SPRINGER.International Computing and Combinatorics Conference. [S.l.], 2004. p.
290–299.
AWERBUCH, B. et al. New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen.SIAM Journal on computing, SIAM, v. 28, n. 1, p.
254–262, 1998.
BALAS, E. The prize collecting traveling salesman problem.Networks, Wiley Online
Library, v. 19, n. 6, p. 621–636, 1989.
BALDACCI, R.; MANIEZZO, V.; MINGOZZI, A. An exact method for the car pooling problem based on lagrangean column generation.Operations Research, INFORMS,
v. 52, n. 3, p. 422–439, 2004.
BASTOS, R. E. M.O problema do caixeiro viajante com passageiros e lotação. Dissertação
(Mestrado) — Brasil, 2017.
BEN-AKIVA, M.; ATHERTON, T. J. Methodology for short-range travel demand predictions: Analysis of carpooling incentives.Journal of Transport Economics and Policy, JSTOR, p. 224–261, 1977.
BENTO, A. M.; HUGHES, J. E.; KAFFINE, D. Carpooling and driver responses to fuel price changes: Evidence from traffic flows in los angeles. Journal of Urban Economics, Elsevier, v. 77, p. 41–56, 2013.
BERBEGLIA, G.; CORDEAU, J.-F.; LAPORTE, G. Dynamic pickup and delivery problems.European journal of operational research, Elsevier, v. 202, n. 1, p. 8–15, 2010.
BERBEGLIA, G.; CORDEAU, J.-F.; LAPORTE, G. A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem.INFORMS Journal on Computing, INFORMS, v. 24, n. 3, p. 343–355, 2012.
CALHEIROS, Z. S. A.O problema do caixeiro viajante com passageiros. Dissertação
CHAN, N. D.; SHAHEEN, S. A. Ridesharing in north america: Past, present, and future.Transport Reviews, Taylor & Francis, v. 32, n. 1, p. 93–112, 2012.
CIASULLO, M. V. et al. The growth of carpooling: Insights from a social media investigation. In:Toulon-Verona Conference"Excellence in Services". [S.l.: s.n.], 2017.
CIASULLO, M. V. et al. Carpooling: travelers? perceptions from a big data analysis.
The TQM Journal, Emerald Publishing Limited, 2018.
CROES, G. A. A method for solving traveling-salesman problems.Operations research,
INFORMS, v. 6, n. 6, p. 791–812, 1958.
DAILEY, D.; LOSEFF, D.; MEYERS, D. Seattle smart traveler: dynamic ridematching on the world wide web.Transportation Research Part C: Emerging Technologies, Elsevier,
v. 7, n. 1, p. 17–32, 1999.
DANTZIG, G.; FULKERSON, R.; JOHNSON, S. Solution of a large-scale traveling- salesman problem.Journal of the operations research society of America, INFORMS, v. 2,
n. 4, p. 393–410, 1954.
DEAKIN, E.; FRICK, K.; SHIVELY, K. Markets for dynamic ridesharing? case of berkeley, california. Transportation Research Record: Journal of the Transportation Research Board, Transportation Research Board of the National Academies, n. 2187, p.
131–137, 2010.
DOERNER, K. F.; SALAZAR-GONZÁLEZ, J.-J. Chapter 7: Pickup-and-delivery problems for people transportation. In: Vehicle Routing: Problems, Methods, and Applications, Second Edition. [S.l.]: SIAM, 2014. p. 193–212.
DORIGO, M.; CARO, G. D. Ant colony optimization: a new meta-heuristic. In: IEEE.Proceedings of the 1999 congress on evolutionary computation-CEC99 (Cat. No. 99TH8406). [S.l.], 1999. v. 2, p. 1470–1477.
FEILLET, D.; DEJAX, P.; GENDREAU, M. Traveling salesman problems with profits.
Transportation science, INFORMS, v. 39, n. 2, p. 188–205, 2005.
FEO, T. A.; RESENDE, M. G. A probabilistic heuristic for a computationally difficult set covering problem.Operations research letters, Elsevier, v. 8, n. 2, p. 67–71, 1989.
FICO, T. Xpress optimization suite. mip formulations and linearizations, quick reference. Fair Isaac Corporation, 2009.
FLOOD, M. M. The traveling-salesman problem.Operations Research, INFORMS, v. 4,
n. 1, p. 61–75, 1956.
FURUHATA, M. et al. Ridesharing: The state-of-the-art and future directions.
Transportation Research Part B: Methodological, Elsevier, v. 57, p. 28–46, 2013.
GHOSEIRI, K.; HAGHANI, A.; HAMEDI, M.Real-time rideshare matching problem. University of Maryland, Department of Civil and Environmental Engineering. [S.l.], 2011.
GLOVER, F. Tabu search and adaptive memory programming?advances, applications and challenges. In:Interfaces in computer science and operations research. [S.l.]: Springer,
GOLDBARG, E.; GOLDBARG, M.; LUNA, H.Otimização Combinatória e Metaheurísti- cas: Algoritmos e Apliacações. [S.l.]: Elsevier Brasil, 2017.
GOLDBARG, M.; GOLDBARG, E. Grafos: Conceitos, algoritmos e aplicações. [S.l.]:
Elsevier, 2012.
GRAZIOTIN, D. An analysis of issues against the adoption of dynamic carpooling.
arXiv preprint arXiv:1306.0361, 2013.
GRUEBELE, P. Interactive system for real time dynamic multi-hop carpooling.Global Transport Knowledge Partnership, p. 28, 2008.
HELSGAUN, K. An effective implementation of the lin–kernighan traveling salesman heuristic.European Journal of Operational Research, Elsevier, v. 126, n. 1, p. 106–130,
2000.
HERBAWI, W. M.; WEBER, M. A genetic and insertion heuristic algorithm for solving the dynamic ridematching problem with time windows. In: ACM.Proceedings of the 14th annual conference on Genetic and evolutionary computation. [S.l.], 2012. p. 385–392.
HOSNI, H.; NAOUM-SAWAYA, J.; ARTAIL, H. The shared-taxi problem: Formulation and solution methods.Transportation Research Part B: Methodological, Elsevier, v. 70, p.
303–318, 2014.
JOZEFOWIEZ, N.; GLOVER, F.; LAGUNA, M. Multi-objective meta-heuristics for the traveling salesman problem with profits.Journal of Mathematical Modelling and Algorithms, Springer, v. 7, n. 2, p. 177–195, 2008.
KARP, R. M. On the computational complexity of combinatorial problems.Networks,
Wiley Online Library, v. 5, n. 1, p. 45–68, 1975.
KELLY, K. L. Casual carpooling-enhanced.Journal of Public Transportation, v. 10, n. 4,
p. 6, 2007.
KENDALL, D. C. et al.Carpooling: Status and potential. [S.l.], 1975.
KLEINER, A.; NEBEL, B.; ZIPARO, V. A. A mechanism for dynamic ride sharing based on parallel auctions. In:IJCAI. [S.l.: s.n.], 2011. v. 11, p. 266–272.
LAPORTE, G.; ASEF-VAZIRI, A.; SRISKANDARAJAH, C. Some applications of the generalized travelling salesman problem.Journal of the Operational Research Society,
Springer, v. 47, n. 12, p. 1461–1467, 1996.
LEIBSON, R.; PENNER, W.Successful Risk Management for Rideshare and Car-pool Matching Programs. [S.l.]: Transportation Research Board, 1994.
LIN, S.; KERNIGHAN, B. W. An effective heuristic algorithm for the traveling- salesman problem.Operations research, INFORMS, v. 21, n. 2, p. 498–516, 1973.
LÓPEZ-IBÁNEZ, M. et al.The irace package, iterated race for automatic algorithm configuration. [S.l.], 2011.
MA, S.; WOLFSON, O. Analysis and evaluation of the slugging form of ridesharing. In: ACM.Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. [S.l.], 2013. p. 64–73.
MALLUS, M. et al. Dynamic carpooling in urban areas: Design and experimentation with a multi-objective route matching algorith. Sustainability, Multidisciplinary
Digital Publishing Institute, v. 9, n. 2, p. 254, 2017.
MANIEZZO, V.; CARBONARO, A.; HILDMANN, H. An ants heuristic for the long?term car pooling problem. In:New optimization techniques in engineering. [S.l.]:
Springer, 2004. p. 411–430.
MASOUD, N.; JAYAKRISHNAN, R. A real-time algorithm to solve the peer-to-peer ride-matching problem in a flexible ridesharing system.Transportation Research Part B: Methodological, Elsevier, v. 106, p. 218–236, 2017.
MATAI, R.; SINGH, S.; MITTAL, M. L. Traveling salesman problem: an overview of applications, formulations, and solution approaches. In:Traveling Salesman Problem, Theory and Applications. [S.l.]: InTech, 2010.
MILLER, C. E.; TUCKER, A. W.; ZEMLIN, R. A. Integer programming formulation of traveling salesman problems.Journal of the ACM (JACM), ACM, v. 7, n. 4, p. 326–329,
1960.
MINETT, P. The energy consumption impacts of flexible carpooling. Flexible Carpooling: Exploratory Study, Citeseer, p. 48–63, 2009.
MINETT, P.; VILLAGE, A.; PEARCE, J. Flexible carpooling: Challenging the ride matching paradigm. saving energy by making it easier to share rides.Energy Policy Journal, Citeseer, v. 21, n. 3, p. 134–159, 2008.
MLADENOVIĆ, N.; HANSEN, P. Variable neighborhood search. Computers &
operations research, Elsevier, v. 24, n. 11, p. 1097–1100, 1997.
MORENCY, C. The ambivalence of ridesharing.Transportation, Springer, v. 34, n. 2, p.
239–253, 2007.
NOURINEJAD, M.Dynamic optimization models for ridesharing and carsharing. Tese
(Doutorado) — University of Toronto, 2014.
PARK, J.; KIM, B.-I. The school bus routing problem: A review.European Journal of operational research, Elsevier, v. 202, n. 2, p. 311–319, 2010.
PARRAGH, S. N.; DOERNER, K. F.; HARTL, R. F. A survey on pickup and delivery problems.Journal für Betriebswirtschaft, Springer, v. 58, n. 1, p. 21–51, 2008.
PARRAGH, S. N.; DOERNER, K. F.; HARTL, R. F. A survey on pickup and delivery problems.Journal für Betriebswirtschaft, Springer, v. 58, n. 2, p. 81–117, 2008.
PARRAGH, S. N.; DOERNER, K. F.; HARTL, R. F. Demand responsive transportation.
Wiley Encyclopedia of Operations Research and Management Science, Wiley Online
PARRAGH, S. N.; SCHMID, V. Hybrid column generation and large neighborhood search for the dial-a-ride problem.Computers & Operations Research, Elsevier, v. 40,
n. 1, p. 490–497, 2013.
PETCH, V. A. Problema do Passeio Lucrativo com Passageiros e Restrições de Tempo-PPL-RT. Dissertação (Mestrado) — Brasil, 2018.
PHAM, D. T. et al. -the bees algorithm?a novel tool for complex optimisation problems. In:Intelligent production machines and systems. [S.l.]: Elsevier, 2006. p.
454–459.
PSARAFTIS, H. N. A dynamic programming solution to the single vehicle many-to- many immediate request dial-a-ride problem.Transportation Science, INFORMS, v. 14,
n. 2, p. 130–154, 1980.
ROSENBLOOM, S.; SHELTON, N. J.Carpool and Bus Matching Program for the University of Texas at Austin. [S.l.], 1974.
SHAHEEN, S.; COHEN, A.; ROBERTS, J. Carsharing in north america: Market growth, current developments, and future potential.Transportation Research Record: Journal of the Transportation Research Board, Transportation Research Board of the National
Academies, n. 1986, p. 116–124, 2006.
SHAHEEN, S.; GUZMAN, S.; ZHANG, H. Bikesharing in europe, the americas, and asia: past, present, and future. Transportation Research Record: Journal of the Transportation Research Board, Transportation Research Board of the National
Academies, n. 2143, p. 159–167, 2010.
SHAHEEN, S. A.; MALLERY, M. A.; KINGSLEY, K. J. Personal vehicle sharing services in north america.Research in Transportation Business & Management, Elsevier, v. 3, p.
71–81, 2012.
SILVA, J. G. d. S.Algoritmos de solução para o problema do caixeiro viajante com passageiros e quota. Dissertação (Mestrado) — Brasil, 2017.
TING, C.-K.; LIAO, X.-L. The selective pickup and delivery problem: formulation and a memetic algorithm.International Journal of Production Economics, Elsevier, v. 141,
n. 1, p. 199–211, 2013.
YU, W.; LIU, Z.; BAO, X. Optimal deterministic algorithms for some variants of online quota traveling salesman problem.European Journal of Operational Research, Elsevier,