NDLI: A fast hybrid optimization algorithm based on TS and PSO for circles packing problem with the equilibrium constraints

Content Provider	IEEE Xplore Digital Library
Author	Kaiyou Lei
Copyright Year	2014
Description	Author affiliation: Intell. Software & Software Eng. Lab., Southwest Univ., Chongqing, China (Kaiyou Lei)
Abstract	The packing problem with the behavioral constraints is difficult to solve due to its NP-hard nature. Tabu search (TS) has strong global search ability but the convergence accuracy is low. particle swarm optimization (PSO) is quick in convergence, but likely to be premature at the initial stage. Considering both the advantages and disadvantages, a fast hybrid optimization algorithm based on improved TS and PSO for this problem is proposed, which employ the novel intensification search and diversification search balance strategy of TS and the refined search of PSO as a whole to plan large-scale space global search according to the fitness change, and to quicken convergence speed, avoid repeated search work, economize computational expenses, and obtain global optimum. The proposed algorithm is tested and compared it with other published methods on constrained layout examples, demonstrated that the revised algorithm is feasible and efficient.
Starting Page	314
Ending Page	317
File Size	131875
Page Count	4
File Format	PDF
ISBN	9781479932788
ISSN	23270594
e-ISBN	9781479932795
DOI	10.1109/ICSESS.2014.6933571
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-06-27
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Computers Premature Tabu search Layout Search problems Constrained layout Particle swarm optimization Optimization Convergence
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A heuristic particle swarm optimization with quasi-human strategy for weighted circles packing problem

Swarm Intelligence Algorithms for Circles Packing Problem with Equilibrium Constraints

A Layout Pattern Based Particle Swarm Optimization for Constrained Packing Problems

Two-stage Tabu — Particle swarm algorithms for the facility layout problem with size constraints

Based on Tabu Search and Particle Swarm Optimization Algorithms Solving Job Shop Scheduling Optimization Problems

SOLVE THE CAPACITANCE VEHICLE ROUTING PROBLEM ( CVRP) USING THE TABU SEARCH ALGORITHM (TS) AND THE PARTICLE SWARM OPTIMIZATION WITH PRACTICAL APPLICATION.

Hybrid particle swarm optimization-simplex algorithm for inverse problem

A Hybrid Particle-Swarm Tabu Search Algorithm for Solving Job Shop Scheduling Problems

UCTP based on Hybrid PSO with Tabu Search Algorithm

A fast hybrid optimization algorithm based on TS and PSO for circles packing problem with the equilibrium constraints

Similar Documents

A heuristic particle swarm optimization with quasi-human strategy for weighted circles packing problem

Swarm Intelligence Algorithms for Circles Packing Problem with Equilibrium Constraints

A Layout Pattern Based Particle Swarm Optimization for Constrained Packing Problems

Two-stage Tabu — Particle swarm algorithms for the facility layout problem with size constraints

Based on Tabu Search and Particle Swarm Optimization Algorithms Solving Job Shop Scheduling Optimization Problems

SOLVE THE CAPACITANCE VEHICLE ROUTING PROBLEM ( CVRP) USING THE TABU SEARCH ALGORITHM (TS) AND THE PARTICLE SWARM OPTIMIZATION WITH PRACTICAL APPLICATION.

Hybrid particle swarm optimization-simplex algorithm for inverse problem

A Hybrid Particle-Swarm Tabu Search Algorithm for Solving Job Shop Scheduling Problems

UCTP based on Hybrid PSO with Tabu Search Algorithm

A fast hybrid optimization algorithm based on TS and PSO for circles packing problem with the equilibrium constraints