Hybrid search with neighborhood reduction for the multiple traveling salesman problem
We present an effective hybrid algorithm with neighborhood reduction for solving the
multiple traveling salesman problem (mTSP). This problem aims to optimize one of the two …
multiple traveling salesman problem (mTSP). This problem aims to optimize one of the two …
Hybrid fleet capacitated vehicle routing problem with flexible Monte–Carlo Tree search
The rise in EVs popularity, combined with reducing emissions and cutting costs, encouraged
delivery companies to integrate them in their fleets. The fleet heterogeneity brings new …
delivery companies to integrate them in their fleets. The fleet heterogeneity brings new …
Balanced dynamic multiple travelling salesmen: Algorithms and continuous approximations
W Garn - Computers & Operations Research, 2021 - Elsevier
Dynamic routing occurs when customers are not known in advance, eg for real-time routing.
Two heuristics are proposed that solve the balanced dynamic multiple travelling salesmen …
Two heuristics are proposed that solve the balanced dynamic multiple travelling salesmen …
Uma abordagem cutting plane e um algoritmo genético para o problema de múltiplos caixeiros viajantes de armazém único com adição de restrição para o limite …
JIA Oliveira Filho - 2022 - repositorio.ufersa.edu.br
O problema de múltiplos caixeiros viajantes (mPCV) é uma extensão de um conhecido
problema da área de otimização combinatória, o problema do caixeiro viajante (PCV). No …
problema da área de otimização combinatória, o problema do caixeiro viajante (PCV). No …