GELS-GA: Hybrid metaheuristic algorithm for solving Multiple Travelling Salesman Problem

Hosseinabadi, Ali Asghar Rahmani; Kardgar, Maryam; Shojafar, Mohammad; Shamshirband, Shahaboddin; Abraham, Ajith

doi:10.1109/isda.2014.7066271

Cited by 33 publications

(18 citation statements)

References 18 publications

(20 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As it was mentioned, there are many applied metaheuristics presented in order to solve the optimization problems similar to the research problem [44][45][46][47][48][49]. Since the applicability and the robustness of the GA algorithms have been proved and it has generated appropriate solutions for CARPs in the literature [50][51][52][53][54], GA is proposed as the main algorithm for the current research.…”

Section: Hybrid Genetic Algorithm (Hga)mentioning

confidence: 99%

A Hybrid Genetic Algorithm for Multi-Trip Green Capacitated Arc Routing Problem in the Scope of Urban Services

et al. 2018

View full text Add to dashboard Cite

Greenhouse gases (GHG) are the main reason for the global warming during the past decades. On the other hand, establishing a well-structured transportation system will yield to create least cost-pollution. This paper addresses a novel model for the multi-trip Green Capacitated Arc Routing Problem (G-CARP) with the aim of minimizing total cost including the cost of generation and emission of greenhouse gases, the cost of vehicle usage and routing cost. The cost of generation and emission of greenhouse gases is based on the calculation of the amount of carbon dioxide emitted from vehicles, which depends on such factors as the vehicle speed, weather conditions, load on the vehicle and traveled distance. The main applications of this problem are in municipalities for urban waste collection, road surface marking and so forth. Due to NP-hardness of the problem, a Hybrid Genetic Algorithm (HGA) is developed, wherein a heuristic and simulated annealing algorithm are applied to generate initial solutions and a Genetic Algorithm (GA) is then used to generate the best possible solution. The obtained numerical results indicate that the proposed algorithm could present desirable performance within a suitable computational run time. Finally, a sensitivity analysis is implemented on the maximum available time of the vehicles in order to determine the optimal policy.

show abstract

Section: Hybrid Genetic Algorithm (Hga)mentioning

confidence: 99%

A Hybrid Genetic Algorithm for Multi-Trip Green Capacitated Arc Routing Problem in the Scope of Urban Services

et al. 2018

View full text Add to dashboard Cite

show abstract

“…However, this method allocates a different number of the cities for each salesman, and therefore, it cannot successfully address MTSP with workload balance. Osaba et al Hosseinabadi et al (2014) propose the Real-World Dial-a-Ride problem, which is modelled as a MTSP. In particular, they propose GELS-GA, a new hybrid algorithm, which achieves optimal values even in highly complex scenarios.…”

Section: Related Workmentioning

confidence: 99%

Two phase heuristic algorithm for the multiple-travelling salesman problem

Yuan

Liptrott

et al. 2017

Soft Comput

View full text Add to dashboard Cite

The multiple-travelling salesman problem (MTSP) is a computationally complex combinatorial optimisation problem, with several theoretical and real-world applications. However, many state-of-the-art heuristic approaches intended to specifically solve MTSP, do not obtain satisfactory solutions when considering an optimised workload balance. In this article, we propose a method specifically addressing workload balance, whilst minimising the overall travelling salesman's distance. More specifically, we introduce the two phase heuristic algorithm (TPHA) for MTSP, which includes an improved version of the K -means algorithm by grouping the visited cities based on their locations based on specific capacity constraints. Secondly, a route planning algorithm is designed to assess the ideal route for each above sets. This is achieved via the genetic algorithm (GA), combined with the roulette wheel method with the elitist strategy in the design of the selection process. As part of the validation process, a mobile guide system for tourists based on the Baidu electronic map is discussed. In particular, the evaluation results demonstrate that TPHA achieves a better workload balance whilst minimising of the overall travelling distance, as well as a better performance in solving MTSP compared to the route planning algorithm solely based on GA.

show abstract

“…Hence, these sets show the possible relations between instances of two parameters in the requirement prioritization activity and make all possible sets of ordered pairs. When the number of combinations increases exponentially, the size of problem increases [28].…”

Section: The Relationships Between Effective Parameters In Requiremenmentioning

confidence: 99%

Towards a highly customizable framework for release planning process

et al. 2016

View full text Add to dashboard Cite

Original scientific paper In software development, release planning is performed to select important features and requirements based on resource and technical constraints and the relationships between requirements. Release planning focuses on finding an optimal solution by seeking various states. This kind of solution finding reveals two remarks. First, it shows that there are various, ambiguous and uncertain parameters that influence the solution. Second, there is not only one solution to any problem. Various solutions can be found that differ in their performance (e.g. time performance, complexity performance, etc.). Consequently, many methods for release planning are often specific to only certain problem domains. This paper examines various current release planning methods to extract the common activities and thoughts in order to establish a customizable framework for release planning. Customization is done by identifying effective parameters, parameter instances and their relationships so that they can affect the selection of the right algorithm or method for each activity. Project characteristics can be specified based on the parameter instances and they are then used to determine the suitable method for achieving each activity within the whole release planning process and the results of which are recorded. This proposed highly customizable process framework with its possible customization features is then validated in several software companies. In 85 % of the cases, the suggested framework for every activity of the process fits the companies' circumstances and helps to hasten the process of release planning.Keywords: customizable process; effective parameters; release planning U cilju velike prilagodljivosti okvira za planiranje puštanja u promet Izvorni znanstveni članak U razvoju softvera, planiranjem puštanja u promet izabiru se važna svojstva i zahtjevi temeljeni na tehničkim ograničenjima i ograničenjima sredstava te odnosima između zahtjeva. Planiranje puštanja u promet usmjereno je na pronalaženje optimalnog rješenja traženjem raznih stanja. Takav način traženja rješenja otkriva dvije stvari. Prvo, pokazuje da postoje različiti nejasni i nesigurni parametri koji utječu na rješenje. Drugo, da ne postoji samo jedno rješenja za neki problem. Mogu postojati različita rješenja koja se razlikuju po svojim karakteristikama (na pr. u odnosu na trajanje, složenost itd.). Stoga su mnoge metode planiranja puštanja u promet često specifične za samo neke aspekte problema. U ovom se radu istražuju razne postojeće metode za planiranje pokretanja u svrhu pronalaženja nekih općih razmišljanja i aktivnosti za uspostavljanje prilagodljivog okvira za planiranje puštanja u promet. Prilagodba se postiže identificiranjem učinkovitih parametara ili primjera parametara i njihovih odnosa tako da se može izabrati pravi algoritam ili metoda za svaku aktivnost. Karakteristike projekta mogu se odrediti na osnovu primjera parametara te se oni tada primjenjuju za određivanje odgovarajuće metode za izvršavanje pojedine aktivnosti...

show abstract

GELS-GA: Hybrid metaheuristic algorithm for solving Multiple Travelling Salesman Problem

Cited by 33 publications

References 18 publications

A Hybrid Genetic Algorithm for Multi-Trip Green Capacitated Arc Routing Problem in the Scope of Urban Services

A Hybrid Genetic Algorithm for Multi-Trip Green Capacitated Arc Routing Problem in the Scope of Urban Services

Two phase heuristic algorithm for the multiple-travelling salesman problem

Towards a highly customizable framework for release planning process

Contact Info

Product

Resources

About