S142011 A Solution for Asymmetric Travelling Salesman Problem with Time Windows Using Pre-Processed Compressed Annealing

Divisi pemasaran STMIK El Rahma memiliki permasalahan dengan penjadwalan rute kunjungan ketika harus melakukan perjalanan multi destinasi ke sekolah-sekolah untuk melakukan promosi. Perjalanan multi destinasi dengan mempertimbangkan waktu kunjungan merupakan permasalahan Travelling Salesman Problem with Time Windows (TSP-TW). Algoritma Genetika merupakan salah satu metode pencarian yang dapat digunakan untuk memberikan rute perjalanan yang optimal. Rekomendasi yang diberikan tidak hanya mempertimbangkan jarak tetapi juga waktu tempuh didapatkan menggunakan Google Maps API. Skenario pengujian yang dilakukan adalah pengujian banyak generasi optimal, pengujian banyak populasi optimal, pengujian kombinasi probabilitas crossover (Pc) dan proabilitas mutasi (Pm), serta pengujian konsistensi solusi yang dihasilkan Algoritma Genetika. Hasil pengujian menunjukan bahwa jumlah individu terbaik adalah 150 individu dalam satu populasi. Kriteria berhenti jika setelah 127 generasi berturut-turut didapatkan nilai fitness tertinggi yang tidak berubah dan kombinasi probabilitas crossover dan probabilitas mutasi yang paling optimal adalah {0.3 : 0.7}.

Download Full-text

A Comparative Performance Analysis of Computational Intelligence Techniques to Solve the Asymmetric Travelling Salesman Problem

Computational Intelligence and Neuroscience ◽

10.1155/2021/6625438 ◽

2021 ◽

Vol 2021 ◽

pp. 1-13

Author(s):

Julius Beneoluchi Odili ◽

A. Noraziah ◽

M. Zarina

Keyword(s):

Performance Analysis ◽

Optimization Algorithm ◽

Travelling Salesman Problem ◽

African Buffalo ◽

Ant System ◽

Travelling Salesman ◽

Comparative Performance ◽

Extremal Optimization ◽

Insertion Algorithm ◽

Asymmetric Travelling Salesman Problem

This paper presents a comparative performance analysis of some metaheuristics such as the African Buffalo Optimization algorithm (ABO), Improved Extremal Optimization (IEO), Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO), Max-Min Ant System (MMAS), Cooperative Genetic Ant System (CGAS), and the heuristic, Randomized Insertion Algorithm (RAI) to solve the asymmetric Travelling Salesman Problem (ATSP). Quite unlike the symmetric Travelling Salesman Problem, there is a paucity of research studies on the asymmetric counterpart. This is quite disturbing because most real-life applications are actually asymmetric in nature. These six algorithms were chosen for their performance comparison because they have posted some of the best results in literature and they employ different search schemes in attempting solutions to the ATSP. The comparative algorithms in this study employ different techniques in their search for solutions to ATSP: the African Buffalo Optimization employs the modified Karp–Steele mechanism, Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO) employs the path construction with patching technique, Cooperative Genetic Ant System uses natural selection and ordering; Randomized Insertion Algorithm uses the random insertion approach, and the Improved Extremal Optimization uses the grid search strategy. After a number of experiments on the popular but difficult 15 out of the 19 ATSP instances in TSPLIB, the results show that the African Buffalo Optimization algorithm slightly outperformed the other algorithms in obtaining the optimal results and at a much faster speed.

Download Full-text

Evaluation of the size of time windows for the travelling salesman problem in delivery operations

Complex & Intelligent Systems ◽

10.1007/s40747-020-00167-y ◽

2020 ◽

Vol 6 (3) ◽

pp. 681-695

Author(s):

Gerçek Budak ◽

Xin Chen

Keyword(s):

Travelling Salesman Problem ◽

Time Windows ◽

Travelling Salesman

Download Full-text

Optimizing leaf sweeping and collection in the Argentine city of Trenque Lauquen

Waste Management & Research ◽

10.1177/0734242x20922597 ◽

2020 ◽

pp. 0734242X2092259 ◽

Cited By ~ 1

Author(s):

Diego Delle Donne ◽

Valeria Di Tomaso ◽

Guillermo Duran

Keyword(s):

Linear Programming ◽

Load Distribution ◽

Travelling Salesman Problem ◽

Work Load ◽

Programming Models ◽

Solution Strategy ◽

Travelling Salesman ◽

Working Day ◽

The City ◽

Asymmetric Travelling Salesman Problem

A solution strategy based on integer linear programming models has been developed for leaf sweeping operations in the Argentine city of Trenque Lauquen. The aim is to achieve efficiency in the assignment of sweepers to city blocks, the identification of leaf bag deposit points and the routes to be followed by collection trucks for leaf bag pickup. Previous to this strategy, sweeper assignments were improvised and inefficient, with blocks often left unswept. Furthermore, no method was available for accurately determining the number of sweepers needed to ensure either full coverage of all city zones within the working day or a balanced work load distribution across all sweepers. Application of the solution strategy by the city has resulted in efficient definitions of sweeper requirements while optimizing sweeper assignments such that all blocks are covered. Once the strategy is fully implemented, the number of bag deposit points under the manual definitions should be reduced by roughly one-half and the total travel distance of the truck routes, modelled as an asymmetric travelling salesman problem, should be cut by 10–15% with the consequent savings in time, vehicle use and fuel consumption.

Download Full-text