Metaheuristics:Progress in Complex Systems Optimization

图书简介

The aim of Metaheuristics: Progress in Complex Systems Optimization is to provide several different kinds of information: a delineation of general metaheuristics methods, a number of state-of-the-art articles from a variety of well-known classical application areas as well as an outlook to modern computational methods in promising new areas. Therefore, this book may equally serve as a textbook in graduate courses for students, as a reference book for people interested in engineering or social sciences, and as a collection of new and promising avenues for researchers working in this field. Highlighted are recent developments in the areas of Simulated Annealing, Path Relinking, Scatter Search, Tabu Search, Variable Neighborhood Search, Hyper-heuristics, Constraint Programming, Iterated Local Search, GRASP, bio-inspired algorithms like Genetic Algorithms, Memetic Algorithms, Ant Colony Optimization or Swarm Intelligence, and several other paradigms.

Scatter Search.- Experiments Using Scatter Search for the Multidemand Multidimensional Knapsack Problem.- A Scatter Search Heuristic for the Fixed-Charge Capacitated Network Design Problem.- Tabu Search.- Tabu Search-Based Metaheuristic Algorithm for Large-scale Set Covering Problems.- Log-Truck Scheduling with a Tabu Search Strategy.- Nature-inspired methods.- Solving the Capacitated Multi-Facility Weber Problem by Simulated Annealing, Threshold Accepting and Genetic Algorithms.- Reviewer Assignment for Scientific Articles using Memetic Algorithms.- GRASP and Iterative Methods.- Grasp with Path-Relinking for the Tsp.- Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for the University Course Timetabling Problem.- Dynamic and Stochastic Problems.- Variable Neighborhood Search for the Probabilistic Satisfiability Problem.- The ACO/F-Race Algorithm for Combinatorial Optimization Under Uncertainty.- Adaptive Control of Genetic Parameters for Dynamic Combinatorial Problems.- A Memetic Algorithm for Dynamic Location Problems.- A Study of Canonical GAs for NSOPs.- Particle Swarm Optimization and Sequential Sampling in Noisy Environments.- Distributed and Parallel Algorithms.- Embedding a Chained Lin-Kernighan Algorithm into a Distributed Algorithm.- Exploring Grid Implementations of Parallel Cooperative Metaheuristics.- Algorithm Tuning, Algorithm Design and Software Tools.- Using Experimental Design to Analyze Stochastic Local Search Algorithms for Multiobjective Problems.- Distance Measures and Fitness-Distance Analysis for the Capacitated Vehicle Routing Problem.- Tuning Tabu Search Strategies Via Visual Diagnosis.- Solving Vehicle Routing Using IOPT.

Trade Policy 买家须知

关于产品：
● 正版保障：本网站隶属于中国国际图书贸易集团公司，确保所有图书都是100%正版。
● 环保纸张：进口图书大多使用的都是环保轻型张，颜色偏黄，重量比较轻。
● 毛边版：即书翻页的地方，故意做成了参差不齐的样子，一般为精装版，更具收藏价值。
关于退换货：
由于预订产品的特殊性，采购订单正式发订后，买方不得无故取消全部或部分产品的订购。
由于进口图书的特殊性，发生以下情况的，请直接拒收货物，由快递返回：
● 外包装破损/发错货/少发货/图书外观破损/图书配件不全（例如：光盘等）
并请在工作日通过电话400-008-1110联系我们。
签收后，如发生以下情况，请在签收后的5个工作日内联系客服办理退换货：
● 缺页/错页/错印/脱线
关于发货时间：
一般情况下：
●【现货】下单后48小时内由北京（库房）发出快递。
●【预订】【预售】下单后国外发货，到货时间预计5-8周左右，店铺默认中通快递，如需顺丰快递邮费到付。
● 需要开具发票的客户，发货时间可能在上述基础上再延后1-2个工作日（紧急发票需求，请联系010-68433105/3213）；
● 如遇其他特殊原因，对发货时间有影响的，我们会第一时间在网站公告，敬请留意。
关于到货时间：
由于进口图书入境入库后，都是委托第三方快递发货，所以我们只能保证在规定时间内发出，但无法为您保证确切的到货时间。
● 主要城市一般2-4天
● 偏远地区一般4-7天
关于接听咨询电话的时间：
010-68433105/3213正常接听咨询电话的时间为：周一至周五上午8：30～下午5：00，周六、日及法定节假日休息，将无法接听来电，敬请谅解。
其它时间您也可以通过邮件联系我们：customer@readgo.cn,工作日会优先处理。
关于快递：
● 已付款订单：主要由中通、宅急送负责派送，订单进度查询请拨打010-68433105/3213。

Metaheuristics:Progress in Complex Systems Optimization（Operations Research/Computer Science Interfaces Series） 运筹学

Metaheuristics:Progress in Complex Systems Optimization（Operations Research/Computer Science Interfaces Series）
运筹学