Solving the Vehicle Routing Problem with Genetic Algorithms
資源簡(jiǎn)介：Solving the Vehicle Routing Problem with Genetic Algorithms
上傳時(shí)間： 2017-07-08
上傳用戶：coeus
資源簡(jiǎn)介：Designing delivery districts for the vehicle Routing Problem with stochastic demands
上傳時(shí)間： 2013-12-13
上傳用戶：大三三
資源簡(jiǎn)介：Solve the traveling salesman Problem with a genetic algorithm.
上傳時(shí)間： 2013-12-19
上傳用戶：qunquan
資源簡(jiǎn)介：車輛行駛路線優(yōu)化（Vehicle Routing Problem）
上傳時(shí)間： 2014-10-13
上傳用戶：561596
資源簡(jiǎn)介：A Genetic Algorithms and the Traveling Salesman Problem
上傳時(shí)間： 2015-11-27
上傳用戶：cccole0605
資源簡(jiǎn)介：For Solving the following Problem: "There is No Free Lunch" Time Limit: 1 Second Memory Limit: 32768 KB One day, CYJJ found an interesting piece of commercial from newspaper: the Cyber-restaurant was offering a kind of "Lunch Special...
上傳時(shí)間： 2014-01-12
上傳用戶：362279997
資源簡(jiǎn)介：have recently become very interested in the area of genetic Algorithms and Ant Colony Optimization techniques. I was determined to write a complete program demonstrating these two techniques. In particular I wanted to compare the efficiency...
上傳時(shí)間： 2013-12-21
上傳用戶：牛布牛
資源簡(jiǎn)介：Using Genetic Algorithm to solve the 8 Queens Problem.
上傳時(shí)間： 2014-11-28
上傳用戶：yd19890720
資源簡(jiǎn)介：This program is using Genetic Algorithm to solve the Travlling Salesman Problem. It gives the best path route within a specified time. usage: java Evolver <seconds> <city file> <config file> Author: Liu Yang
上傳時(shí)間： 2013-12-06
上傳用戶：nanfeicui
資源簡(jiǎn)介：The Problem with the IID_s is solved ! File-Structure: ~~~~~~~~~~~~~~~ DirectDraw.pas = DDraw.h + DVP.h (+ MultiMon.h) Direct3D.pas = D3D.h + D3DTypes.h + D3DCaps.h + D3DVec.inl + DXFile.h Direct3DRM.pas = D3DRM.h + D3DRMDef.h + D3DR...
上傳時(shí)間： 2015-09-04
上傳用戶：kikye
資源簡(jiǎn)介：The present paper deals with the Problem of calculating mean delays in polling systems with either exhaustive or gated service. We develop a mean value analysis (MVA) to compute these delay figures. The merits of MVA are in its intrinsic ...
上傳時(shí)間： 2014-11-17
上傳用戶：kelimu
資源簡(jiǎn)介：Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
上傳時(shí)間： 2013-12-04
上傳用戶：從此走出陰霾
資源簡(jiǎn)介：Somebody over on the Generation5 forum asked for a "Hello World!" program for genetic Algorithms. I took it literally and created a very simple program (138 lines of code) that evolves the phrase "Hello world!"
上傳時(shí)間： 2016-03-07
上傳用戶：siguazgb
資源簡(jiǎn)介：This program proposed improved adaptive genetic Algorithms saccording to the idea that the best individualon current generation should bekept tonext generation,but the best individual should becrossed and mutated by some probability.
上傳時(shí)間： 2014-01-01
上傳用戶：冇尾飛鉈
資源簡(jiǎn)介：Genetic Algorithm (GA) based solver for the Traveling Salesman Problem
上傳時(shí)間： 2014-01-27
上傳用戶：siguazgb
資源簡(jiǎn)介：This is a java implementation for Solving NQueen Problem using genetic algorithm.Enjoy it!
上傳時(shí)間： 2017-06-18
上傳用戶：許小華
資源簡(jiǎn)介：a program for to maximise the fonction f(x,y)=x+y with genetic algorithm
上傳時(shí)間： 2017-07-07
上傳用戶：changeboy
資源簡(jiǎn)介：Solving the TSP Problem using the Branch and Bound Algorithm
上傳時(shí)間： 2013-12-15
上傳用戶：asddsd
資源簡(jiǎn)介：《Fuzzy Relational Calculus Toolbox, Rel.1.01》The toolbox provides functions and original Algorithms for Solving direct and inverse Problems. Author: Yordan Kyosev & Ketty Peeva
上傳時(shí)間： 2015-04-18
上傳用戶：royzhangsz
資源簡(jiǎn)介：this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input erro...
上傳時(shí)間： 2013-12-22
上傳用戶：ruixue198909
資源簡(jiǎn)介：遺傳算法和“貨郎擔(dān)” 問(wèn)題: "The traveling salesman Problem, or TSP for short, is this: given a finite number of cities along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning ...
上傳時(shí)間： 2013-12-24
上傳用戶：watch100
資源簡(jiǎn)介：aiNet application is a very powerful and a very simple tool for Solving the Problems which are usually solved with artificial neural networks (ANN). All possible tests we had run proved that the results obtained with aiNet are at least as g...
上傳時(shí)間： 2014-01-16
上傳用戶：wang5829
資源簡(jiǎn)介：The main features of the considered identification Problem are that there is no an a priori separation of the variables into inputs and outputs and the approximation criterion, called misfit, does not depend on the model representation. The...
上傳時(shí)間： 2016-09-20
上傳用戶：FreeSky
資源簡(jiǎn)介：This is a good book explaining the adaptive theory fundamentals with matlab routines covers all the adaptive filter design Algorithms
上傳時(shí)間： 2017-04-16
上傳用戶：semi1981
資源簡(jiǎn)介：A pure python module which implements the DES and Triple-DES encryption Algorithms. Triple DES is either DES-EDE3 with a 24 byte key, or DES-EDE2 with a 16 byte key.
上傳時(shí)間： 2017-05-06
上傳用戶：邶刖
資源簡(jiǎn)介：This is a code of Pseudo-Arc Length Continuation Method , the method can be used for Solving the nonlinear equations, the principle can re found in some text books. In the code,I prove the agreement of the code with other methods
上傳時(shí)間： 2013-12-03
上傳用戶：xzt
資源簡(jiǎn)介：In the rectangle packing Problem, encoding schemes to represent the placements of rectangles are the key factors of efficient Algorithms. In 1995, an epoch-making encoding scheme
上傳時(shí)間： 2017-06-16
上傳用戶：hn891122
資源簡(jiǎn)介：In the rectangle packing Problem, encoding schemes to represent the placements of rectangles are the key factors determining the efficiency of Algorithms. SEQP AIR is one of the most sophisticated encoding sheme, which has been consider...
上傳時(shí)間： 2013-12-24
上傳用戶：hphh
資源簡(jiǎn)介：標(biāo)準(zhǔn)遺傳算法代碼 simple genetic Algorithms
上傳時(shí)間： 2015-01-20
上傳用戶：caozhizhi
資源簡(jiǎn)介：Unique net-enabled GUI system based state of the art coding solutions with strong XML support.
上傳時(shí)間： 2013-12-24
上傳用戶：1101055045
