ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Main Menu

Searching By

PARTNERS

Contact us

Linear Assignment Problems Solved by Greedy 2-Opt Heuristics on GPU

Journal: International Journal of Mechanical and Production Engineering Research and Development (IJMPERD ) (Vol.10, No. 5)

Publication Date:

Authors : ; ;

Page : 275-280

Keywords : Linear Assignment Problems (LAP); Traveling Salesman Problem (TSP); Quadratic Assignment Problem (QAP); Greedy 2-opt Local Search Heuristics; Graphics Processing Unit (GPUs);

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

We solve Linear Assignment Problems (LAP) through a Parallel Local Search Heuristics. LAP is properly represented as a Traveling Salesman Problem (TSP) which, in turn, is a particular case of Quadratic Assignment Problem (QAP). Our proposed method uses the Greedy 2-opt Local Search Heuristics proper to QAP and is fully implemented on Graphical Processing Units (GPUs).

Other Latest Articles

  1. An Evaluation of BS-VI Fuel Emission Standards in India
  2. Impact Factors of the Implementing Effect of “Internet Plus Government Service” in China
  3. Drought Risk Analysis using Neural Networks for Agri-Businesses and Projects in Lejweleputswa District Municipality, South Africa
  4. Evaluation of Low-Cost GNSS Receiver for Cartographic and Photogrammetric Purposes
  5. An Analytical Study of National Policies for Empowering Women (With Reference to Education and Employment Opportunities)

Last modified: 2021-03-23 20:33:40