scholarly journals Multi-Robot Routing Problem with Min–Max Objective

Robotics ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 122
Author(s):  
Jennifer David ◽  
Thorsteinn Rögnvaldsson
Keyword(s):  
Simulated Annealing ◽  
Comparative Study ◽  
Bipartite Graph ◽  
Real World ◽  
Heuristic Method ◽  
Problem Formulation ◽  
Permutation Matrix ◽  
Routing Problem ◽  
Research Communities ◽  
Multi Robot

In this paper, we study the “Multi-Robot Routing problem” with min–max objective (MRR-MM) in detail. It involves the assignment of sequentially ordered tasks to robots such that the maximum cost of the slowest robot is minimized. The problem description, the different types of formulations, and the methods used across various research communities are discussed in this paper. We propose a new problem formulation by treating this problem as a bipartite graph with a permutation matrix to solve it. A comparative study is done between three methods: Stochastic simulated annealing, deterministic mean-field annealing, and a heuristic-based graph search method. Each method is investigated in detail with several data sets (simulation and real-world), and the results are analysed and compared with respect to scalability, computational complexity, optimality, and its application to real-world scenarios. The paper shows that the heuristic method produces results very quickly with good scalability. However, the solution quality is sub-optimal. On the other hand, when optimal or near-optimal results are required with considerable computational resources, the simulated annealing method proves to be more efficient. However, the results show that the optimal choice of algorithm depends on the dataset size and the available computational budget. The contribution of the paper is three-fold: We study the MRR-MM problem in detail across various research communities. This study also shows the lack of inter-research terminology that has led to different names for the same problem. Secondly, formulating the task allocation problem as a permutation matrix formulation (bipartite graph) has opened up new approaches to solve this problem. Thirdly, we applied our problem formulation to three different methods and conducted a detailed comparative study using real-world and simulation data.

scholarly journals Pengembangan Algoritma Hybrid Restart Simulated Annealing with Variable Neighborhood Search (HRSA-VNS) untuk penyelesaian kasus Vehicle Routing Problem with Time Windows (VRPTW)

2017 ◽  
Vol 6 (1) ◽  
pp. 49
Author(s):  
Titi Iswari
Keyword(s):  
Simulated Annealing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Variable Neighborhood Search ◽  
Simulated Annealing Algorithm ◽  
Time Windows ◽  
Heuristic Method ◽  
Neighborhood Search ◽  
Routing Problem ◽  
Time Required

<p><em>Determining the vehicle routing is one of the important components in existing logistics systems. It is because the vehicle route problem has some effect on transportation costs and time required in the logistics system. In determining the vehicle routes, there are some restrictions faced, such as the maximum capacity of the vehicle and a time limit in which depot or customer has a limited or spesific opening hours (time windows). This problem referred to Vehicle Routing Problem with Time Windows (VRPTW). To solve the VRPTW, this study developed a meta-heuristic method called Hybrid Restart Simulated Annealing with Variable Neighborhood Search (HRSA-VNS). HRSA-VNS algorithm is a modification of Simulated Annealing algorithm by adding a restart strategy and using the VNS algorithm scheme in the stage of finding neighborhood solutions (neighborhood search phase). Testing the performance of HRSA-VNS algorithm is done by comparing the results of the algorithm to the Best Known Solution (BKS) and the usual SA algorithm without modification. From the results obtained, it is known that the algorithm perform well enough in resolving the VRPTW case with the average differences are -2.0% with BKS from Solomon website, 1.83% with BKS from Alvarenga, and -2.2% with usual SA algorithm without any modifications.</em></p><p><em>Keywords : vehicle routing problem, time windows, simulated annealing, VNS, restart</em></p>

scholarly journals Simulated Annealing Technique for Routing in a Rectangular Mesh Network

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Noraziah Adzhar ◽  
Shaharuddin Salleh
Keyword(s):  
Simulated Annealing ◽  
Shortest Path ◽  
Printed Circuit Boards ◽  
Optimal Path ◽  
Heuristic Method ◽  
Mesh Network ◽  
Routing Problem ◽  
Rectangular Mesh ◽  
Metaheuristic Methods ◽  
Cell Placement

In the process of automatic design for printed circuit boards (PCBs), the phase following cell placement is routing. On the other hand, routing process is a notoriously difficult problem, and even the simplest routing problem which consists of a set of two-pin nets is known to be NP-complete. In this research, our routing region is first tessellated into a uniformNx×Nyarray of square cells. The ultimate goal for a routing problem is to achieve complete automatic routing with minimal need for any manual intervention. Therefore, shortest path for all connections needs to be established. While classical Dijkstra’s algorithm guarantees to find shortest path for a single net, each routed net will form obstacles for later paths. This will add complexities to route later nets and make its routing longer than the optimal path or sometimes impossible to complete. Today’s sequential routing often applies heuristic method to further refine the solution. Through this process, all nets will be rerouted in different order to improve the quality of routing. Because of this, we are motivated to apply simulated annealing, one of the metaheuristic methods to our routing model to produce better candidates of sequence.

scholarly journals A CDT-Based Heuristic Zone Design Approach for Economic Census Investigators

2015 ◽  
Vol 2015 ◽  
pp. 1-14 ◽  
Author(s):  
Changixu Cheng ◽  
Xiaomei Song ◽  
Jing Yang ◽  
Xiatian Hu ◽  
Shi Shen ◽  
...  
Keyword(s):  
Delaunay Triangulation ◽  
Real World ◽  
Heuristic Method ◽  
Real World Application ◽  
Economic Census ◽  
Speed Up ◽  
Growth Approach ◽  
Special Zone ◽  
Required Quality

This paper addresses a special zone design problem for economic census investigators that is motivated by a real-world application. This paper presented a heuristic multikernel growth approach via Constrained Delaunay Triangulation (CDT). This approach not only solved the barriers problem but also dealt with the polygon data in zoning procedure. In addition, it uses a new heuristic method to speed up the zoning process greatly on the premise of the required quality of zoning. At last, two special instances for economic census were performed, highlighting the performance of this approach.

ASIF Approach to Solve the Green Traveling Salesman Problem

2018 ◽  
Vol 9 (1) ◽  
pp. 81-95 ◽  
Author(s):  
Ahmed Haroun Sabry ◽  
Jamal Benhra ◽  
Abdelkabir Bacha
Keyword(s):  
Objective Function ◽  
Ant Colony Optimization ◽  
Present Article ◽  
Traveling Salesman Problem ◽  
Real World ◽  
Transportation Problem ◽  
Problem Formulation ◽  
Traveling Salesman ◽  
Web Based ◽  
The City

The present article describes a contribution to solve transportation problems with green constraints. The aim is to solve an urban traveling salesman problem where the objective function is the total emitted CO2. We start by adapting ASIF approach for calculating CO2 emissions to the urban logistics problem. Then, we solve it using ant colony optimization metaheuristic. The problem formulation and solving will both work under a web-based mapping platform. The selected problem is a real-world NP-hard transportation problem in the city of Casablanca.

Sign in / Sign up

Export Citation Format

Share Document