Memetic search for the minmax multiple traveling salesman problem with single and multiple depots
From MaRDI portal
Publication:6167324
DOI10.1016/j.ejor.2022.11.010OpenAlexW4309102282MaRDI QIDQ6167324
Publication date: 10 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.11.010
Related Items
Hybrid genetic algorithm for undirected traveling salesman problems with profits, A hybrid genetic algorithm for the Hamiltonian p‐median problem
Cites Work
- Unnamed Item
- A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- A comprehensive survey on the multiple traveling salesman problem: applications, approaches and taxonomy
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- Variable neighborhood search
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- A general variable neighborhood search for the swap-body vehicle routing problem
- An efficient implementation of a static move descriptor-based local search heuristic
- Knowledge-guided local search for the vehicle routing problem
- Efficiently solving very large-scale routing problems
- Hybrid search with neighborhood reduction for the multiple traveling salesman problem
- An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem
- An effective hybrid search algorithm for the multiple traveling repairman problem with profits
- A customized genetic algorithm for bi-objective routing in a dynamic network
- A lexicographic minimax approach to the vehicle routing problem with route balancing
- A new approach to solving the multiple traveling salesperson problem using genetic algorithms
- A unified solution framework for multi-attribute vehicle routing problems
- Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach
- Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood
- Solution of a Min-Max Vehicle Routing Problem
- Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
- A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM
- Technical Note—A Note on the Multiple Traveling Salesmen Problem
- Technical Note—A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- An Exchange Heuristic for Routeing Problems with Time Windows
- The m-Traveling Salesman Problem with Minmax Objective
- Computational Experience with an M-Salesman Traveling Salesman Algorithm
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Benchmarking optimization software with performance profiles.
