Proceedings ArticleDOI
An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem
Pan Junjie,Wang Dingwei +1 more
- Vol. 1, pp 210-213
TLDR
The paper makes the attempt to show how the ant colony optimization (ACO) can be applied to the MTSP with ability constraint, and shows that the proposed algorithm can find competitive solutions even not all of the best solutions within rational time, especially for large scale problems.Abstract:
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem, which is an extension of the famous travelling salesman problem (TSP). The MTSP can be generalized to a wide variety of routing and scheduling problems. It is known that classical optimization procedures are not adequate for this problem. The paper makes the attempt to show how the ant colony optimization (ACO) can be applied to the MTSP with ability constraint. In this paper, we compare it with MGA by testing several standard problems from TSPLIB. The computational results show that the proposed algorithm can find competitive solutions even not all of the best solutions within rational time, especially for large scale problemsread more
Citations
More filters
BookDOI
Hybrid Artificial Intelligent Systems
TL;DR: The methodology for calculating distortion parameters of newly created attributes after both discretisation and binarisation of attributes for quantitative association rules mining has been proposed and the new application of MMASK for finding frequent sets in discovering quantitative association Rules with preserved privacy has been presented.
An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems: Technical report
TL;DR: The implementation of an extension of the Lin-Kernighan-Helsgaun TSP solver, which is able to solve a variety of well-known problems, including the sequential ordering problem, the traveling repairman problem, variants of the multiple travel-ing salesman problem, as well as vehicle routing problems with capacity, time windows, pickup-and-delivery and distance constraints.
Journal ArticleDOI
Probability Collectives: A multi-agent approach for solving combinatorial optimization problems
Anand J. Kulkarni,Kang Tai +1 more
TL;DR: The theory of Collective Intelligence (COIN) is discussed using the modified version of Probability Collectives (PC) to achieve the global goal and the optimum results to the Rosenbrock function and both the MDMTSP test cases are obtained at reasonable computational costs.
Proceedings ArticleDOI
An ant colony optimization algorithm for the Multiple Traveling Salesmen Problem
TL;DR: An ant colony optimization (ACO) algorithm for the multiple traveling salesmen problem (MTSP) with two objectives: the objective of minimizing the maximum tour length of all the salesmen and the objectives of minimize the maximumTour length of each salesman.
Journal Article
A multiobjective non-dominated sorting genetic algorithm (NSGA-II) for the Multiple Traveling Salesman Problem
TL;DR: In this article, a non-dominated sorting genetic algorithm (NSGA-II) is proposed to solve the multi-objective version of the Multiple Traveling Salesman Problem (MOmTSP), in particular, the minimization of the total traveled distance and the balance of the working times of the traveling salesmen.
References
More filters
Book
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
TL;DR: In this paper, Johnson and Papadimitriou proposed a performance guarantee for heuristics, based on the notion of well-solved special cases (P. Gilmore, et al.).
Journal ArticleDOI
The General Pickup and Delivery Problem
TL;DR: Several characteristics that distinguish pickup and delivery problems from standard vehicle routing problems are discussed and a survey of the problem types and solution methods found in the literature is presented.
Journal ArticleDOI
THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization
TL;DR: Combinatorial OptimizationAdvanced Intelligent Computing Theories and ApplicationsOpt ArtHybrid Feedback ControlAdvances in Multi-Objective Nature Inspired ComputingThe Traveling Salesman ProblemIntelligent Computational Optimization in EngineeringThe Traveled SalesmanFundamental Problems in ComputingSpecial Cases of the Traveling salesman Problem
Journal ArticleDOI
An Algorithm for the Vehicle-dispatching Problem
Nicos Christofides,Samuel Eilon +1 more
TL;DR: The vehicle-scheduling problem involves the design of several vehicle tours to meet a given set of requirements for customers with known locations, subject to a capacity constraint for the vehicles and a distance constraint for vehicles.
Journal ArticleDOI
A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex
TL;DR: The model, solution method, and system developed and implemented for hot rolling production scheduling in Shanghai Baoshan Iron & Steel Complex shows 20% improvement over the previous manual based system.