An ACO/VNS Hybrid Approach for a Large-Scale Energy Management Problem
|
|
|
- Buck Gardner
- 10 years ago
- Views:
Transcription
1 An ACO/VNS Hybrid Approach for a Large-Scale Energy Management Problem Challenge ROADEF/EURO 2010 Roman Steiner, Sandro Pirkwieser, Matthias Prandtstetter Vienna University of Technology, Austria Institute of Compter Graphics and Algorithms June 13th 2010
2 overview 1 fitness function definition quality measure 2 metaheuristic the algorithm ant colony optimization variable neighborhood search 3 production levels the algorithm 4 results
3 fitness function 1 fitness function definition quality measure 2 metaheuristic the algorithm ant colony optimization variable neighborhood search 3 production levels the algorithm 4 results
4 fitness function without violations: with violations: objective function f = v f 0 + q q 0 f 0 v number of violations q quality measure f 0 cost of trivial (infeasible) solution q 0 quality measure of trivial solution
5 fitness function quality measure
6 fitness function quality measure
7 fitness function quality measure
8 fitness function quality measure
9 fitness function quality measure
10 metaheuristic 1 fitness function definition quality measure 2 metaheuristic the algorithm ant colony optimization variable neighborhood search 3 production levels the algorithm 4 results
11 the algorithm
12 ant colony optimization pheromone model: date selection probability for each outage apply VNS on best ant only best ant deposits pheromones no pheromones on outages with violations
13 ant colony optimization solution generation solution generation outages are set in consecutive order selection based on combination of pheromone level and greedy heuristic pheromone level: gives probability of dates for each outage greedy heuristic: next outage when power plant empty
14 ant colony optimization solution generation
15 ant colony optimization solution generation
16 ant colony optimization solution generation
17 ant colony optimization solution generation
18 variable neighborhood search reduced VNS only shaking operators no local search different shaking operations in ACO and stand alone VNS
19 variable neighborhood search shaking operations used in the ACO do outage adds a new outage at the end move outage moves one outage to a different date swap outages swaps two outages of different power plants no outage removes the last outage mix select randomly one shaking operation
20 variable neighborhood search shaking operations used in the stand alone VNS move outage moves one outage to a different date spread outages distance between two consecutive outages is increased smooth outages smoothes the average distance of consecutive outages
21 production levels 1 fitness function definition quality measure 2 metaheuristic the algorithm ant colony optimization variable neighborhood search 3 production levels the algorithm 4 results
22 production levels deterministic algorithm basic idea: use as much PP2 production as possible reduce where demand is exceeded fill up with cheapest PP1 not optimal
23 production levels algorithm 1 phase 1 primitive PP2 production levels (all PP2 run on full production as long as possible) 2 phase 2 (iterated) reduce over production uniformly on all PP2 check constraint violations 3 phase 3 fill up with PP1 production (cheapest first)
24 production levels algorithm 1 phase 1 primitive PP2 production levels (all PP2 run on full production as long as possible) 2 phase 2 (iterated) reduce over production uniformly on all PP2 check constraint violations 3 phase 3 fill up with PP1 production (cheapest first) still over production? mark as infeasible
25 production levels 1 fitness function definition quality measure 2 metaheuristic the algorithm ant colony optimization variable neighborhood search 3 production levels the algorithm 4 results
26 results ACO VNS ACO VNS data (60%) data (60%) data (12%) data (50%) data (82%) Table: Average results with factor 1e6.
27 thank you thank you for your attention
Meta-Heuristics for Reconstructing Cross Cut Shredded Text Documents
Meta-Heuristics for Reconstructing Cross Cut Shredded Text Documents Matthias Prandtstetter Günther R. Raidl Institute of Computer Graphics and Algorithms Vienna University of Technology, Austria www.ads.tuwien.ac.at
Finding Liveness Errors with ACO
Hong Kong, June 1-6, 2008 1 / 24 Finding Liveness Errors with ACO Francisco Chicano and Enrique Alba Motivation Motivation Nowadays software is very complex An error in a software system can imply the
An Improved ACO Algorithm for Multicast Routing
An Improved ACO Algorithm for Multicast Routing Ziqiang Wang and Dexian Zhang School of Information Science and Engineering, Henan University of Technology, Zheng Zhou 450052,China [email protected]
Ant Colony Optimization and Constraint Programming
Ant Colony Optimization and Constraint Programming Christine Solnon Series Editor Narendra Jussien WILEY Table of Contents Foreword Acknowledgements xi xiii Chapter 1. Introduction 1 1.1. Overview of the
Using Ant Colony Optimization for Infrastructure Maintenance Scheduling
Using Ant Colony Optimization for Infrastructure Maintenance Scheduling K. Lukas, A. Borrmann & E. Rank Chair for Computation in Engineering, Technische Universität München ABSTRACT: For the optimal planning
Integration of ACO in a Constraint Programming Language
Integration of ACO in a Constraint Programming Language Madjid Khichane 12, Patrick Albert 1, and Christine Solnon 2 1 ILOG 2 LIRIS, UMR 5205 CNRS / University of Lyon ANTS 08 Motivations Ant Colony Optimization
. 1/ CHAPTER- 4 SIMULATION RESULTS & DISCUSSION CHAPTER 4 SIMULATION RESULTS & DISCUSSION 4.1: ANT COLONY OPTIMIZATION BASED ON ESTIMATION OF DISTRIBUTION ACS possesses
vii TABLE OF CONTENTS CHAPTER TITLE PAGE DECLARATION DEDICATION ACKNOWLEDGEMENT ABSTRACT ABSTRAK
vii TABLE OF CONTENTS CHAPTER TITLE PAGE DECLARATION DEDICATION ACKNOWLEDGEMENT ABSTRACT ABSTRAK TABLE OF CONTENTS LIST OF TABLES LIST OF FIGURES LIST OF ABBREVIATIONS LIST OF SYMBOLS LIST OF APPENDICES
Ant Colony Optimization (ACO)
Ant Colony Optimization (ACO) Exploits foraging behavior of ants Path optimization Problems mapping onto foraging are ACO-like TSP, ATSP QAP Travelling Salesman Problem (TSP) Why? Hard, shortest path problem
Solving the Vehicle Routing Problem with Multiple Trips by Adaptive Memory Programming
Solving the Vehicle Routing Problem with Multiple Trips by Adaptive Memory Programming Alfredo Olivera and Omar Viera Universidad de la República Montevideo, Uruguay ICIL 05, Montevideo, Uruguay, February
An ACO Approach to Solve a Variant of TSP
An ACO Approach to Solve a Variant of TSP Bharat V. Chawda, Nitesh M. Sureja Abstract This study is an investigation on the application of Ant Colony Optimization to a variant of TSP. This paper presents
An ant colony optimization for single-machine weighted tardiness scheduling with sequence-dependent setups
Proceedings of the 6th WSEAS International Conference on Simulation, Modelling and Optimization, Lisbon, Portugal, September 22-24, 2006 19 An ant colony optimization for single-machine weighted tardiness
MuACOsm A New Mutation-Based Ant Colony Optimization Algorithm for Learning Finite-State Machines
MuACOsm A New Mutation-Based Ant Colony Optimization Algorithm for Learning Finite-State Machines Daniil Chivilikhin and Vladimir Ulyantsev National Research University of IT, Mechanics and Optics St.
Design and Analysis of ACO algorithms for edge matching problems
Design and Analysis of ACO algorithms for edge matching problems Carl Martin Dissing Söderlind Kgs. Lyngby 2010 DTU Informatics Department of Informatics and Mathematical Modelling Technical University
INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING & TECHNOLOGY (IJCET)
INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING & TECHNOLOGY (IJCET) International Journal of Computer Engineering and Technology (IJCET), ISSN 0976 6367(Print), ISSN 0976 6367(Print) ISSN 0976 6375(Online)
International Journal of Emerging Technology & Research
International Journal of Emerging Technology & Research An Implementation Scheme For Software Project Management With Event-Based Scheduler Using Ant Colony Optimization Roshni Jain 1, Monali Kankariya
Projects - Neural and Evolutionary Computing
Projects - Neural and Evolutionary Computing 2014-2015 I. Application oriented topics 1. Task scheduling in distributed systems. The aim is to assign a set of (independent or correlated) tasks to some
HYBRID ACO-IWD OPTIMIZATION ALGORITHM FOR MINIMIZING WEIGHTED FLOWTIME IN CLOUD-BASED PARAMETER SWEEP EXPERIMENTS
HYBRID ACO-IWD OPTIMIZATION ALGORITHM FOR MINIMIZING WEIGHTED FLOWTIME IN CLOUD-BASED PARAMETER SWEEP EXPERIMENTS R. Angel Preethima 1, Margret Johnson 2 1 Student, Computer Science and Engineering, Karunya
Optimization and Ranking in Web Service Composition using Performance Index
Optimization and Ranking in Web Service Composition using Performance Index Pramodh N #1, Srinath V #2, Sri Krishna A #3 # Department of Computer Science and Engineering, SSN College of Engineering, Kalavakkam-
An ACO algorithm for image compression
An ACO algorithm for image compression Cristian Martinez University of Buenos Aires, Department of Computer Science Buenos Aires, Argentina, C1428EGA E-mail: [email protected] October 29, 2006 Abstract
ACO Hypercube Framework for Solving a University Course Timetabling Problem
ACO Hypercube Framework for Solving a University Course Timetabling Problem José Miguel Rubio, Franklin Johnson and Broderick Crawford Abstract We present a resolution technique of the University course
Nurse Rostering. Jonathan Johannsen CS 537. Scheduling Algorithms
Nurse Rostering Jonathan Johannsen CS 537 Scheduling Algorithms Most hospitals worldwide create schedules for their staff by hand, spending hours trying to optimally assign workers to various wards at
Scheduling Breaks in Shift Plans for Call Centers
Scheduling Breaks in Shift Plans for Call Centers Andreas Beer Johannes Gärtner Nysret Musliu Werner Schafhauser Wolfgang Slany Abstract In this paper we consider a real-life break scheduling problem for
Software Framework for Vehicle Routing Problem with Hybrid Metaheuristic Algorithms
Software Framework for Vehicle Routing Problem with Hybrid Metaheuristic Algorithms S.MASROM 1, A.M. NASIR 2 Malaysia Institute of Transport (MITRANS) Faculty of Computer and Mathematical Science Universiti
EA and ACO Algorithms Applied to Optimizing Location of Controllers in Wireless Networks
2 EA and ACO Algorithms Applied to Optimizing Location of Controllers in Wireless Networks Dac-Nhuong Le, Hanoi University of Science, Vietnam National University, Vietnam Optimizing location of controllers
Metaheuristics for Solving a Multimodal Home-Healthcare Scheduling Problem
Noname manuscript No. (will be inserted by the editor) Metaheuristics for Solving a Multimodal Home-Healthcare Scheduling Problem Gerhard Hiermann Matthias Prandtstetter Andrea Rendl Jakob Puchinger Günther
Swarm Intelligence Algorithms Parameter Tuning
Swarm Intelligence Algorithms Parameter Tuning Milan TUBA Faculty of Computer Science Megatrend University of Belgrade Bulevar umetnosti 29, N. Belgrade SERBIA [email protected] Abstract: - Nature inspired
A Heuristic Approach for the Swap-Body Vehicle Routing Problem
http://dx.doi.org/10.1287/ics.2015.0013 Creative Commons License Computing Society 14th INFORMS Computing Society Conference Richmond, Virginia, January 11 13, 2015 pp. 172 187 This work is licensed under
A hybrid ACO algorithm for the Capacitated Minimum Spanning Tree Problem
A hybrid ACO algorithm for the Capacitated Minimum Spanning Tree Problem Marc Reimann Marco Laumanns Institute for Operations Research, Swiss Federal Institute of Technology Zurich, Clausiusstrasse 47,
On-line scheduling algorithm for real-time multiprocessor systems with ACO
International Journal of Intelligent Information Systems 2015; 4(2-1): 13-17 Published online January 28, 2015 (http://www.sciencepublishinggroup.com/j/ijiis) doi: 10.11648/j.ijiis.s.2015040201.13 ISSN:
Modified Ant Colony Optimization for Solving Traveling Salesman Problem
International Journal of Engineering & Computer Science IJECS-IJENS Vol:3 No:0 Modified Ant Colony Optimization for Solving Traveling Salesman Problem Abstract-- This paper presents a new algorithm for
Beam-ACO hybridizing ant colony optimization with beam search: an application to open shop scheduling
Available online at www.sciencedirect.com Computers & Operations Research ( ) www.elsevier.com/locate/dsw Beam-ACO hybridizing ant colony optimization with beam search: an application to open shop scheduling
Biogeography Based Optimization (BBO) Approach for Sensor Selection in Aircraft Engine
Biogeography Based Optimization (BBO) Approach for Sensor Selection in Aircraft Engine V.Hymavathi, B.Abdul Rahim, Fahimuddin.Shaik P.G Scholar, (M.Tech), Department of Electronics and Communication Engineering,
The Second International Timetabling Competition (ITC-2007): Curriculum-based Course Timetabling (Track 3)
The Second International Timetabling Competition (ITC-2007): Curriculum-based Course Timetabling (Track 3) preliminary presentation Luca Di Gaspero and Andrea Schaerf DIEGM, University of Udine via delle
An Improved Ant Colony Optimization Algorithm for Software Project Planning and Scheduling
An Improved Ant Colony Optimization Algorithm for Software Project Planning and Scheduling Avinash Mahadik Department Of Computer Engineering Alard College Of Engineering And Management,Marunje, Pune [email protected]
A SURVEY ON WORKFLOW SCHEDULING IN CLOUD USING ANT COLONY OPTIMIZATION
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 2, February 2014,
Ant colony optimization and local search for bin packing and cutting stock problems
Journal of the Operational Research Society (2004) 55, 705 716 r 2004 Operational Research Society Ltd. All rights reserved. 0160-5682/04 $30.00 www.palgrave-journals.com/jors Ant colony optimization and
Obtaining Optimal Software Effort Estimation Data Using Feature Subset Selection
Obtaining Optimal Software Effort Estimation Data Using Feature Subset Selection Abirami.R 1, Sujithra.S 2, Sathishkumar.P 3, Geethanjali.N 4 1, 2, 3 Student, Department of Computer Science and Engineering,
A novel ACO technique for Fast and Near Optimal Solutions for the Multi-dimensional Multi-choice Knapsack Problem
A novel ACO technique for Fast and Near Optimal Solutions for the Multi-dimensional Multi-choice Knapsack Problem Shahrear Iqbal, Md. Faizul Bari, Dr. M. Sohel Rahman AlEDA Group Department of Computer
Biological inspired algorithm for Storage Area Networks (ACOSAN)
Biological inspired algorithm for Storage Area Networks (ACOSAN) Anabel Fraga Vázquez 1 1 Universidad Carlos III de Madrid Av. Universidad, 30, Leganés, Madrid, SPAIN [email protected] Abstract. The routing
An Ant Colony Optimization Approach to the Software Release Planning Problem
SBSE for Early Lifecyle Software Engineering 23 rd February 2011 London, UK An Ant Colony Optimization Approach to the Software Release Planning Problem with Dependent Requirements Jerffeson Teixeira de
An Application of Ant Colony Optimization for Software Project Scheduling with Algorithm In Artificial Intelligence
An Application of Ant Colony Optimization for Software Project Scheduling with Algorithm In Artificial Intelligence 1 Ms.Minal C.Toley, 2 Prof.V.B.Bhagat 1 M.E.First Year CSE P.R.Pote COET, Amravati, Maharashtra,
Performance Evaluation of Task Scheduling in Cloud Environment Using Soft Computing Algorithms
387 Performance Evaluation of Task Scheduling in Cloud Environment Using Soft Computing Algorithms 1 R. Jemina Priyadarsini, 2 Dr. L. Arockiam 1 Department of Computer science, St. Joseph s College, Trichirapalli,
Effective Load Balancing for Cloud Computing using Hybrid AB Algorithm
Effective Load Balancing for Cloud Computing using Hybrid AB Algorithm 1 N. Sasikala and 2 Dr. D. Ramesh PG Scholar, Department of CSE, University College of Engineering (BIT Campus), Tiruchirappalli,
Implementing Ant Colony Optimization for Test Case Selection and Prioritization
Implementing Ant Colony Optimization for Test Case Selection and Prioritization Bharti Suri Assistant Professor, Computer Science Department USIT, GGSIPU Delhi, India Shweta Singhal Student M.Tech (IT)
STUDY OF PROJECT SCHEDULING AND RESOURCE ALLOCATION USING ANT COLONY OPTIMIZATION 1
STUDY OF PROJECT SCHEDULING AND RESOURCE ALLOCATION USING ANT COLONY OPTIMIZATION 1 Prajakta Joglekar, 2 Pallavi Jaiswal, 3 Vandana Jagtap Maharashtra Institute of Technology, Pune Email: 1 [email protected],
Evolving an Edge Selection Formula for Ant Colony Optimization
Evolving an Edge Selection Formula for Ant Colony Optimization Andrew Runka Dept. of Computer Science Brock University St. Catharines, Ontario, Canada [email protected] ABSTRACT This project utilizes the
Software Project Planning and Resource Allocation Using Ant Colony Optimization with Uncertainty Handling
Software Project Planning and Resource Allocation Using Ant Colony Optimization with Uncertainty Handling Vivek Kurien1, Rashmi S Nair2 PG Student, Dept of Computer Science, MCET, Anad, Tvm, Kerala, India
Solving Hop-constrained MST problems with ACO
n. 493 May 2013 ISSN: 0870-8541 Solving Hop-constrained MST problems with ACO Marta S.R. Monteiro 1,2 Dalila B.M.M. Fontes 1,2 Fernando A.C.C. Fontes 3,4 1 FEP-UP, School of Economics and Management, University
A Survey on Load Balancing Techniques Using ACO Algorithm
A Survey on Load Balancing Techniques Using ACO Algorithm Preeti Kushwah Department of Computer Science & Engineering, Acropolis Institute of Technology and Research Indore bypass road Mangliya square
TEST CASE SELECTION & PRIORITIZATION USING ANT COLONY OPTIMIZATION
TEST CASE SELECTION & PRIORITIZATION USING ANT COLONY OPTIMIZATION Bharti Suri Computer Science Department Assistant Professor, USIT, GGSIPU New Delhi, India [email protected] Shweta Singhal Information
CLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM
CLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM *Shabnam Ghasemi 1 and Mohammad Kalantari 2 1 Deparment of Computer Engineering, Islamic Azad University,
Beam-ACO for the Longest Common Subsequence Problem
Beam-ACO for the Longest Common Subsequence Problem Christian Blum Abstract The longest common subsequence problem is classical string problem. It has applications, for example, in pattern recognition
From Self-Organising Mechanisms to Design Patterns
Self-aware Pervasive Service Ecosystems From Self-Organising Mechanisms to Design Patterns University of Geneva [email protected] 1 Outline Motivation: Spatial Structures and Services Self-Organising
Multiple Ant Colony Optimization for a Rich Vehicle Routing Problem: a Case Study
Multiple Ant Colony Optimization for a Rich Vehicle Routing Problem: a Case Study Paola Pellegrini, Daniela Favaretto, Elena Moretti Department of Applied Mathematics University Ca Foscari of Venice Dorsoduro
A Proposed Scheme for Software Project Scheduling and Allocation with Event Based Scheduler using Ant Colony Optimization
A Proposed Scheme for Software Project Scheduling and Allocation with Event Based Scheduler using Ant Colony Optimization Arjita sharma 1, Niyati R Bhele 2, Snehal S Dhamale 3, Bharati Parkhe 4 NMIET,
How Can Metaheuristics Help Software Engineers
and Software How Can Help Software Engineers Enrique Alba [email protected] http://www.lcc.uma.es/~eat Universidad de Málaga, ESPAÑA Enrique Alba How Can Help Software Engineers of 8 and Software What s a
Heuristic Algorithm for the Parallel Machine Total Weighted Tardiness Scheduling Problem
Heuristic Algorithm for the Parallel Machine Total Weighted Tardiness Scheduling Problem Rosiane Rodrigues [email protected] COPPE - Engenharia de Sistemas e Computação Universidade Federal do Rio de
Power Plant Maintenance Scheduling Using Ant Colony Optimization
16 Power Plant Maintenance Scheduling Using Ant Colony Optimization Wai Kuan Foong, Holger Robert Maier and Angus Ross Simpson School of Civil & Environmental Engineering, University of Adelaide Australia
ACO FOR OPTIMAL SENSOR LAYOUT
Stefka Fidanova 1, Pencho Marinov 1 and Enrique Alba 2 1 Institute for Parallel Processing, Bulgarian Academy of Science, Acad. G. Bonchev str. bl.25a, 1113 Sofia, Bulgaria 2 E.T.S.I. Informatica, Grupo
Journal of Theoretical and Applied Information Technology 20 th July 2015. Vol.77. No.2 2005-2015 JATIT & LLS. All rights reserved.
EFFICIENT LOAD BALANCING USING ANT COLONY OPTIMIZATION MOHAMMAD H. NADIMI-SHAHRAKI, ELNAZ SHAFIGH FARD, FARAMARZ SAFI Department of Computer Engineering, Najafabad branch, Islamic Azad University, Najafabad,
Méta-heuristiques pour l optimisation
Méta-heuristiques pour l optimisation Differential Evolution (DE) Particle Swarm Optimization (PSO) Alain Dutech Equipe MAIA - LORIA - INRIA Nancy, France Web : http://maia.loria.fr Mail : [email protected]
IAJIT First Online Publication
Using the Ant Colony Algorithm for Real-Time Automatic Route of School Buses Tuncay Yigit and Ozkan Unsal Department of Computer Engineering, Süleyman Demirel University, Turkey Abstract: Transportation
Comparative Study: ACO and EC for TSP
Comparative Study: ACO and EC for TSP Urszula Boryczka 1 and Rafa l Skinderowicz 1 and Damian Świstowski1 1 University of Silesia, Institute of Computer Science, Sosnowiec, Poland, e-mail: [email protected]
Development of Model-Ant Colony Optimization (ACO) in Route Selection Based on Behavioral User was Transport in Semarang, Indonesia
International Refereed Journal of Engineering and Science (IRJES) ISSN (Online) 2319-183X, (Print) 2319-1821 Volume 3, Issue 6 (June 2014), PP.09-18 Development of Model-Ant Colony Optimization (ACO) in
An ACO-LB Algorithm for Task Scheduling in the Cloud Environment
466 JOURNAL OF SOFTWARE, VOL. 9, NO. 2, FEBRUARY 2014 An ACO-LB Algorithm for Task Scheduling in the Cloud Environment Shengjun Xue, Mengying Li, Xiaolong Xu, and Jingyi Chen Nanjing University of Information
Hybrid Heterogeneous Electric Fleet Routing Problem with City Center Restrictions
Hybrid Heterogeneous Electric Fleet Routing Problem with City Center Restrictions Gerhard Hiermann 1, Richard Hartl 2, Jakob Puchinger 1, Thibaut Vidal 3 1 AIT Austrian Institute of Technology 2 University
On the Impact of Real-Time Information on. Field Service Scheduling. Ioannis Petrakis, Christian Hass, Martin Bichler 1
On the Impact of Real-Time Information on Field Service Scheduling Ioannis Petrakis, Christian Hass, Martin Bichler 1 Department of Informatics, TU München, Germany Mobile phone operators need to plan
Interactive Timetabling
Interactive Timetabling Tomáš Müller, Roman Barták * Charles University Department of Theoretical Computer Science Malostranské náměstí 2/25, Praha 1, Czech Republic [email protected] [email protected]
SCORE BASED DEADLINE CONSTRAINED WORKFLOW SCHEDULING ALGORITHM FOR CLOUD SYSTEMS
SCORE BASED DEADLINE CONSTRAINED WORKFLOW SCHEDULING ALGORITHM FOR CLOUD SYSTEMS Ranjit Singh and Sarbjeet Singh Computer Science and Engineering, Panjab University, Chandigarh, India ABSTRACT Cloud Computing
Hybrid Algorithm using the advantage of ACO and Cuckoo Search for Job Scheduling
Hybrid Algorithm using the advantage of ACO and Cuckoo Search for Job Scheduling R.G. Babukartik 1, P. Dhavachelvan 1 1 Department of Computer Science, Pondicherry University, Pondicherry, India {r.g.babukarthik,
Review of Ant Colony Optimization for Software Project Scheduling and Staffing with an Event Based Scheduler
International Journal of Computer Sciences and Engineering s and Engineering Open Access Research Paper Volume-2, Issue-5 E-ISSN: 2347-2693 Review of Ant Colony for Software Project Scheduling and Staffing
Wireless Sensor Networks Coverage Optimization based on Improved AFSA Algorithm
, pp. 99-108 http://dx.doi.org/10.1457/ijfgcn.015.8.1.11 Wireless Sensor Networks Coverage Optimization based on Improved AFSA Algorithm Wang DaWei and Wang Changliang Zhejiang Industry Polytechnic College
Production Scheduling for Dispatching Ready Mixed Concrete Trucks Using Bee Colony Optimization
American J. of Engineering and Applied Sciences 3 (1): 7-14, 2010 ISSN 1941-7020 2010 Science Publications Production Scheduling for Dispatching Ready Mixed Concrete Trucks Using Bee Colony Optimization
ASSIGNMENT OF CONTAINER TRUCKS OF A ROAD TRANSPORT COMPANY WITH CONSIDERATION OF THE LOAD BALANCING PROBLEM
International Journal of Computer Science and Applications Technomathematics Research Foundation Vol. 10, No. 2, pp. 1 14, 2013 ASSIGNMENT OF CONTAINER TRUCKS OF A ROAD TRANSPORT COMPANY WITH CONSIDERATION
A Performance Comparison of GA and ACO Applied to TSP
A Performance Comparison of GA and ACO Applied to TSP Sabry Ahmed Haroun Laboratoire LISER, ENSEM, UH2C Casablanca, Morocco. Benhra Jamal Laboratoire LISER, ENSEM, UH2C Casablanca, Morocco. El Hassani
Multi-Objective Ant Colony Optimization for Solving the Twin- Screw Extrusion Configuration Problem
Multi-Objective Ant Colony Optimization for Solving the Twin- Screw Extrusion Configuration Problem Cristina Teixeira*, J. A. Covas*, Thomas Stützle** and A. Gaspar-Cunha* *IPC/I3N-Institute for Polymer
Ant colony optimization techniques for the vehicle routing problem
Advanced Engineering Informatics 18 (2004) 41 48 www.elsevier.com/locate/aei Ant colony optimization techniques for the vehicle routing problem John E. Bell a, *, Patrick R. McMullen b a Department of
Charles Fleurent Director - Optimization algorithms
Software Tools for Transit Scheduling and Routing at GIRO Charles Fleurent Director - Optimization algorithms Objectives Provide an overview of software tools and optimization algorithms offered by GIRO
Ant Colony Optimization Resource Allocation for Software Release Planning
Ant Colony Optimization Resource Allocation for Software Release Planning Jasmine Sabeena, K.Sree Divya, K.Santhi Department of CSE, S V College of Engineering, Tirupathi,India Abstract- Release planning
