Spatial Transformation of Equality – Generalized Travelling Salesman Problem to Travelling Salesman Problem

Zia, Mohammed; Çakır, Ziyadin; Şeker, Dursun Zafer

doi:10.3390/ijgi7030115

Cited by 13 publications

(8 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By one means or the other (or even together), the best route is eventually provided. Aziz Ouaarab [13] and Zia et al [14] showed the different approaches to solve the TSP in specific cases, such as railway track optimization, robot movement, vehicle routing, among others. Wasser et al [15], in turn, successfully applied heuristic of trajectory planning in additive manufacturing of polymers.…”

Section: Starting Position Definition and Node Connections To Define ...mentioning

confidence: 99%

The Concept of a Novel Path Planning Strategy for Wire + Arc Additive Manufacturing of Bulky Parts: Pixel

Ferreira

Scotti

2021

Metals

View full text Add to dashboard Cite

An innovative trajectory strategy was proposed and accessed for wire arc additive manufacturing (WAAM), applicable to different and more complex geometries, rather than being a single solution. This strategy, named Pixel, can be defined as a complex multitask procedure to carry out optimized path planning, whose operation is made through computational algorithms (heuristics), with accessible computational resources and tolerable computational time. The model layers are fractioned in squared grids, and a set of dots is systematically generated and distributed inside the sliced outlines, resembling pixels on a screen, over which the trajectory is planned. The Pixel strategy was based on creating trajectories from the technique travelling salesman problem (TSP). Unlike existing algorithms, the Pixel strategy uses an adapted greedy randomized adaptive search procedure (GRASP) metaheuristic, aided by four concurrent trajectory planning heuristics, developed by the authors. Interactions provide successive trajectories from randomized initial solutions (global search) and subsequent iterative improvements (local search). After all recurrent loops, a trajectory is defined and written in machine code. Computational evaluation was implemented to demonstrate the effect of each of the heuristics on the final trajectory. An experimental evaluation was eventually carried out using two different not easily printable shapes to demonstrate the practical feasibility of the proposed strategy.

show abstract

Section: Starting Position Definition and Node Connections To Define ...mentioning

confidence: 99%

The Concept of a Novel Path Planning Strategy for Wire + Arc Additive Manufacturing of Bulky Parts: Pixel

Ferreira

Scotti

2021

Metals

View full text Add to dashboard Cite

show abstract

“…Ben-Arieh et al . (2003) and Zia et al (2018) discuss "non-exact" transformations from the GTSP to TSP that provide heuristic solutions for the GTSP using existing algorithms for the TSP.…”

Section: Transformation To the Tspmentioning

confidence: 99%

Models and algorithms for last mile delivery problems with multiple shipping options

Yuan¹

2020

4OR-Q J Oper Res

View full text Add to dashboard Cite

“…These problems are solved transport and logistics management by the traveling salesman problem (TSP). Patrol route analysis in the area is arranged by the efficiency distance, time and cost of patrol operation planning (Zia et al 2018;Almahasneh & Koczy 2020). Therefore, these problems are interested in finding first solutions to solve these complications and to improve the efficiency of prevention and suppression patrol routes.…”

Section: Introductionmentioning

confidence: 99%

Transportation Management of Vehicle Routing Arrangements: A Case Study of Preventive and Repressive Patrolling in Thai Police

2022

JGEBF

View full text Add to dashboard Cite

Coronavirus disease has affected economics and society, resulting in increasing crime problems. Under circumstances with limited patrol officers, prevention and suppression operations must be analyzed for vehicle routing for prevention and suppression patrols to reduce the patrol distance, time and fuel. This research aims to analyze the vehicle routing arrangement of prevention and suppression patrol officers and to develop a routing process model of prevention and suppression patrol management. Quantitative research is applied with the traveling salesman problem (TSP), which is utilized to establish prevention and suppression patrol routes. Qualitative research is applied with content analysis, which is utilized to develop the routing process model. The vehicle routes of the prevention and suppression patrol are arranged in the route set. These results show the average route, distance and shortest patrol time of the patrol officers, which cover all risk point patrols. Additionally, a patrol routing model is presented to arrange the process of prevention and suppression patrol operation. This key process is applied to manage the prevention and suppression patrol well, and these benefits are to reduce the patrol distance, patrol time and fuel cost. Additionally, this practice has increased the patrol rounds at risk points, resulting in the reduction in crimes and upgrading good practices in patrol operations.

show abstract

Spatial Transformation of Equality – Generalized Travelling Salesman Problem to Travelling Salesman Problem

Cited by 13 publications

References 23 publications

The Concept of a Novel Path Planning Strategy for Wire + Arc Additive Manufacturing of Bulky Parts: Pixel

The Concept of a Novel Path Planning Strategy for Wire + Arc Additive Manufacturing of Bulky Parts: Pixel

Models and algorithms for last mile delivery problems with multiple shipping options

Transportation Management of Vehicle Routing Arrangements: A Case Study of Preventive and Repressive Patrolling in Thai Police

Contact Info

Product

Resources

About