Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem

DOI10.1155/2015/640231zbMath1394.90476OpenAlexW1747072561WikidataQ59119208 ScholiaQ59119208MaRDI QIDQ1666220

Y. Aharonov

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/640231

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• A decomposition based estimation of distribution algorithm for multiobjective traveling salesman problems
• A particle swarm optimizer for grouping problems
• The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
• Towards a new evolutionary computation. Advances on estimation of distribution algorithms.
• An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
• A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
• A genetic algorithm for service level based vehicle scheduling
• A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex
• Efficient coordinated motion.
• A self-guided genetic algorithm for permutation flowshop scheduling problems
• A heuristic approach to the overnight security service problem
• A crane scheduling method for port container terminals
• Vehicle routing problem with time windows and simultaneous delivery and pick-up service based on MCPSO
• A new approach to solving the multiple traveling salesperson problem using genetic algorithms
• A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
• A Novel Approach to Solve Multiple Traveling Salesmen Problem by Genetic Algorithm
• A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM
• An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
• A Cutting Planes Algorithm for the m-Salesmen Problem
• Some Simple Applications of the Travelling Salesman Problem
• Computational Experience with an M-Salesman Traveling Salesman Algorithm
• Variable neighborhood search: Principles and applications
• A survey of optimization by building and using probabilistic models
• Data mining. Concepts and techniques