Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
Rapid PHP 2018 15.0
Bytescout BarCode Generator SDK 4.70.0.981
Data Puppy Lite (32-bit) 1.0
ProZ clone script 1.0.3
VideoCap Live Streaming SDK ActiveX 8.5
Magento Web to Print 1.0
dbForge Data Compare for MySQL 5.4
dbForge Query Builder for MySQL 4.3
ODBC Driver for NetSuite 1.2
Rapid CSS 2018 15.0
ByteScout PDF Extractor SDK 9.0.0.3079
TeeGrid for .NET 2018
HotelDruid 2.2.3
Metamill 8.2.2022
EXE Stealth Protector 4.23
Top Code
Output Messenger 1.8.0
Aliexpress Clone- Ec21 Script 1
Indiegogo Clone 3.0
Online Food Ordeing System 1.0
PHP Image Resize Script 1.0
Best Spotify Clone 1.0
Get Random Record Based on Weight 1.0.0
Travel Portal Script 9.29
Magento Product Designer 1.0
OFOS - Just Eat Clone Script 1.0
PrestaShop Upload Images Module 1.2.1
Trading Software 1.2.4
Deals and Discounts Website Script 1.0.2
Readymade MLM Products 2.01
ADO.NET Provider for ExactTarget 1.0
Top Search
Code To Add Url
Flat File Php Guestbook
Article Directory Script For Wordpress
Dirty Word
Photo Add Comment Php
Gallery Comment
Twitter Update Script Php
Guestbooks Aspnetindex
How To Add Comment Section To Website
Gallery Comments
Photo Gallery Comment Php
Free Html Projects
Leave A Reply Message Box F
Hotmail Cod For Login
Customer Portal
Related Search
Bin Packing Algorithm
Bin Packing Algorithm Java
Bset Fit Bin Packing Algorithm Sampel Code
Bin Packing Algorithm C Code
Bin Packing Algorithm For Java
Bset Fit Bin Packing Algorithm
Bin Packing One Phase Algorithm
Off Line Algorithm For Bin Packing
Bin Packer Algorithm
Bin Pack Algorithm
Bin Packing Code C
Bin Packing Code Java
Bin Packing Java
Bin Packing Java Code
Bin Packing Problem
 Bin Packing Algorithm 

Code 1-20 of 60   Pages: Go to  1  2  3  Next >>  page  






http://simulations.narod.ru/
The task is to pack big box with several small boxes. The objective is to maximize total area of all small boxes. I made fitness in follow way: it is area minus penalty in case of overlapping small boxes also overlapping area subtracted from fitness. There are several mutations: places exchange, small jump, big jump, random visible/invisible random rotation at 90 degrees, jumps to nearest box

run...



This is an evolutionary algorithm that returns a random list of prime numbers. This code is highly inefficient for a reason. This algorithm is more of a proof of concept that if a prime was a heritable trait, it would not be a desired one.



This is a pure Python implementation of the rsync algorithm. On my desktop (3.0GHz dual core, 7200RPM), best case throughput for target file hash generation and delta generation is around 2.9MB/s. Absolute worst case scenario (no blocks in common)...



A-star (A*) Shortest Path Algorithm



Dijkstra shortest path algorithm.



Floyd-Steinberg dithering is an image dithering algorithm (see http://en.wikipedia.org/wiki/Floyd-Steinberg for more details). While the algorithm is mainly for image manipulation, I use it to create random locations for sensor networt devices.



This is a simple implementation of the famous LZW algorithm.



this algorithm predicts the received signal strength for the mobile user to avoid fluctuation in received signal strength during localization of the mobile user(finding mobile user's location)



NSGA-II is a very famous multi-objective optimization algorithm. I submitted an example previously and wanted to make this submission useful to others by creating it as a function. Even though this function is very specific to benchmark problems,...



Gravitational search algorithm (GSA) is an optimization algorithm based on the law of gravity and mass interactions.This algorithm is based on the Newtonian gravity: "Every particle in the universe attracts every other particle with a force...



The Jonker-Volgenant algorithm is much faster than the famous Hungarian algorithm for the Linear Assignment Problem (LAP). This Matlab implementation is modified from the original C++ code made by Roy Jonker, one of the inventors of the algorithm....



A flexible implementation of PSO algorithm with time-varying parameters. Algorithm is suitable for solving continuous optimization problems. Special care has been taken to enable flexibility of the algorthm with respect to its parameters and to...



findMIS is an heuristic algorithm for solving Maximum Independent Set problem (MIS).
An independent set of a graph is a subset of vertices in which no two vertices are
adjacent. Given a set of vertices, the maximum independent set...



We use the genetic algorithm (gatool) to determine the four parameters of the implicit Forst-Kalkwarf-Thodos Model. Predictions are in perfect agreement with data of vapour pressure of iodobenzene versus temperature for a temperature range from...



This is an extremely fast implementation of the famous Hungarian algorithm (aslo known as Munkres' algorithm). The new version (V2.2)is about 1.5 times faster than the old version (V2.1). It can solve a 1000 x 1000 problem in about 20 seconds in a...



This algorithm will accept a Latitude, Longitude and Altitude location as well as a specific universal coordinated time. It will use this information and calculate the position of the moon in a local coordinate frame (az and alt aka az and el).



This algorithm deal with multimodal optimization problems under constraints.



These files are the MATLAB code for "Imperialist Competitive Algorithm (ICA)" which in some papers is referred by "Colonial Competitive Algorithm CCA".

Evolutionary optimization methods, inspired from natural...



In this M-file, the implementation of ACO Algorithm is given with the support of reference papers listed. You can easily use it as following command to see the pictures of result and the playing iterative course.
ACO('filename.tsp');



SpeedyGA is a vectorized implementation of a genetic algorithm in the Matlab programming language. Without bells and whistles, it faithfully implements the specification for a Simple GA given on pgs 10, 11 of M. Mitchell's GA book. See comments in...