Related references
Note: Only part of the references are listed.Modeling and optimization of multiple traveling salesmen problems: An evolution strategy approach
Korhan Karabulut et al.
COMPUTERS & OPERATIONS RESEARCH (2021)
A comprehensive survey on the Multiple Traveling Salesman Problem: Applications, approaches and taxonomy
Omar Cheikhrouhou et al.
COMPUTER SCIENCE REVIEW (2021)
Mission-oriented ant-team ACO for min-max MTSP
Li-Chih Lu et al.
APPLIED SOFT COMPUTING (2019)
Knowledge-guided local search for the vehicle routing problem
Florian Arnold et al.
COMPUTERS & OPERATIONS RESEARCH (2019)
Two phase heuristic algorithm for the multiple-travelling salesman problem
Xiaolong Xu et al.
SOFT COMPUTING (2018)
Improving variable neighborhood search to solve the traveling salesman problem
Samrat Hore et al.
APPLIED SOFT COMPUTING (2018)
A multi-loading school bus routing problem
Douglas Moura Miranda et al.
EXPERT SYSTEMS WITH APPLICATIONS (2018)
A Genetic Algorithm with New Local Operators for Multiple Traveling Salesman Problems
Kin-Ming Lo et al.
International Journal of Computational Intelligence Systems (2018)
A fast two-level variable neighborhood search for the clustered vehicle routing problem
Christof Defryn et al.
COMPUTERS & OPERATIONS RESEARCH (2017)
Memetic algorithm based on sequential variable neighborhood descent for the minmax multiple traveling salesman problem
Yongzhen Wang et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2017)
CCEHC: An efficient local search algorithm for weighted partial maximum satisfiability
Chuan Luo et al.
ARTIFICIAL INTELLIGENCE (2017)
Two metaheuristic approaches for the multiple traveling salesperson problem
Pandiri Venkatesh et al.
APPLIED SOFT COMPUTING (2015)
A general variable neighborhood search heuristic for multiple traveling salesmen problem
Banu Soylu
COMPUTERS & INDUSTRIAL ENGINEERING (2015)
A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
Shuai Yuan et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2013)
A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem
Yuichi Nagata et al.
INFORMS JOURNAL ON COMPUTING (2013)
A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
Yuichi Nagata et al.
COMPUTERS & OPERATIONS RESEARCH (2010)
A new grouping genetic algorithm approach to the multiple traveling salesperson problem
Alok Singh et al.
SOFT COMPUTING (2009)
An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
Jari Kytojoki et al.
COMPUTERS & OPERATIONS RESEARCH (2007)
A new approach to solving the multiple traveling salesperson problem using genetic algorithms
Arthur E. Carter et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2006)
Integer linear programming formulations of multiple salesman problems and its variations
Imdat Kara et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2006)
The multiple traveling salesman problem: an overview of formulations and solution procedures
T Bektas
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2006)
Scheduling pre-printed newspaper advertising inserts using genetic algorithms
AE Carter et al.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2002)
An effective implementation of the Lin-Kernighan traveling salesman heuristic
K Helsgaun
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2000)
A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex
LX Tang et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2000)
Share Paper
