✦ LIBER ✦

Discrete particle swarm optimization for the team orienteering problem

✍ Scribed by Shanthi Muthuswamy; Sarah S. Lam

Publisher: Springer-Verlag
Year: 2011
Tongue: English
Weight: 392 KB
Volume: 3
Category: Article
ISSN: 1865-9284
DOI: 10.1007/s12293-011-0071-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Discrete Particle Swarm Optimization for

Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem

✍ Sergio Consoli; José Andrés Moreno-Pérez; Kenneth Darby-Dowman; Nenad Mladenović 📂 Article 📅 2009 🏛 Springer Netherlands 🌐 English ⚖ 279 KB

A memetic algorithm for the team oriente

A memetic algorithm for the team orienteering problem

✍ Hermann Bouly; Duc-Cuong Dang; Aziz Moukrim 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 324 KB

Penalty function approach for the mixed

Penalty function approach for the mixed discrete nonlinear problems by particle swarm optimization

✍ S. Kitayama; M. Arakawa; K. Yamazaki 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 697 KB

Particle swarm optimization algorithm fo

Particle swarm optimization algorithm for constrained problems

✍ Jian-Ming Zhang; Lei Xie 📂 Article 📅 2009 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 104 KB 👁 1 views

Dynamic-objective particle swarm optimiz

Dynamic-objective particle swarm optimization for constrained optimization problems

✍ Haiyan Lu; Weiqi Chen 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 359 KB

Discrete particle swarm optimization bas

Discrete particle swarm optimization based on estimation of distribution for terminal assignment problems

✍ Jiahai Wang; Yiqiao Cai; Yalan Zhou; Ronglong Wang; Caiwei Li 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 294 KB

## a b s t r a c t Terminal assignment problem (TEAP) is to determine minimum cost links to form a network by connecting a given set of terminals to a given collection of concentrators. This paper presents a novel discrete particle swarm optimization (PSO) based on estimation of distribution (EDA)