图书简介
This book highlights state-of-the-art developments in metaheuristics research. It examines all aspects of metaheuristic research including new algorithmic developments, applications, new research challenges, theoretical developments, implementation issues, in-depth experimental studies. The book is divided into two sections. Part I is focused on new optimization and modeling techniques based on metaheuristics. The chapters in this section cover topics from multi-objective problems with fuzzy data with triangular-valued objective functions, to hyper-heuristics optimization methodology, designing genetic algorithms, and also the cuckoo search algorithm. The techniques described help to enhance the usability and increase the potential of metaheuristic algorithms. Part II showcases advanced metaheuristic approaches to solve real-life applications issues. This includes an examination of scheduling, the vehicle routing problem, multimedia sensor network, supplier selection, bin packing, objects tracking, and radio frequency identification. In the fields covered in the chapters are of high-impact applications of metaheuristics. The chapters offer innovative applications of metaheuristics that have a potential of widening research frontiers. Altogether, this book offers a comprehensive look at how researchers are currently using metaheuristics in different domains of design and application.
Chapter 1. Hidden Markov Model Classifier for the Adaptive Particle Swarm Optimization.- by Oussama Aoun, Malek Sarhani and Abdellatif El Afia.- Chapter 2. Possibilistic Framework for Multi-objective Optimization under Uncertainty.- by Oumayma Bahri and Nahla Ben Amor and El-Ghazali Talbi.- Chapter 3. Combining Neighborhoods into Local Search Strategies.- by Renaud De Landtsheer, Yoann Guyot, Gustavo Ospina, and Christophe Ponsard.- Chapter 4 All-Terrain Tabu Search Approaches for Production Management Problems.- by Nicolas Zufferey Jean Respen Simon Thevenin.- Chapter 5. A re-characterization of hyper-heuristics.- by Jerry Swan, Patrick De Causmaecker, Simon Martin, Ender Ozcan.- Chapter 6. POSL: A Parallel-Oriented metaheuristic-based Solver Language.- by Alejandro Reyes Amaro, Eric Monfroy and Florian Richoux.- Chapter 7. An Extended Neighborhood Vision for Hill-climbing Move Strategy Design.- by Sara Tari, Matthieu Basseur and Adrien Goeffon.- Chapter 8. Theory driven design of efficient genetic algorithms for a classical graph problem.- by Dogan Corus and Per Kristian Lehre.- Chapter 9. On the impact of representation and algorithm selection for optimisation in process design: motivating a meta-heuristic framework.- by Eric S. Fraga, Abdellah Salhi and El-Ghazali Talbi.- Chapter 10. Manufacturing Cell Formation Problem using Hybrid Cuckoo Search Algorithm.- by Bouchra Karoum, Bouazza Elbenani, Noussaima El Khattabi and Abdelhakim A. El Imrani.- Chapter 11. Hybridization of Branch and Bound Algorithm with Metaheuristics for Designing Reliable Wireless Multimedia Sensor Network.- by Omer Ozkan, Murat Ermis, and Ilker Bekmezci.- Chapter 12. A hybrid MCDM approach for supplier selection with a case study.- by Hanane Asselaou, Brahim Ouhbi and Bouchra Frikh.- Chapter 13. A Multi-Objective Optimization via Simulation framework for restructuring traffic networks subject to increases in population.- by Enrique Gabriel Baquela and Ana Carolina Olivera.- Chapter 14. Hybrid metaheuristic for air traffic management with uncertainty.- by S. Chaimatanan and D. Delahaye and M. Mongeau.- Chapter 15. Sampling-Based Genetic Algorithms for the Bi-Objective Stochastic Covering Tour Problem.- by Michaela Zehetner and Walter J. Gutjahr.- Chapter 16. A metaheuristic framework for dynamic network flow problems.- by M. Hajjem, H. Bouziri and E.G. Talbi.- Chapter 17. A Greedy Randomized Adaptive Search for the Surveillance Patrol Vehicle Routing Problem.- by Simona Mancini.- Chapter 18. Strip Algorithms as an Efficient Way to Initialise Population-based Metaheuristics.- by Birsen ?Irem Selamoglu, Abdellah Salhi and Muhammad Sulaiman.- Chapter 19. Matheuristics for the Temporal Bin Packing Problem.- by Fabio Furini and Xueying Shen.- Chapter 20. A fast reoptimization approach for the dynamic technician routing and scheduling problem.- by V. Pillac, C. Guéret and A.L. Medaglia.- Chapter 21. Optimized air routes connections for real hub schedule using SMPSO Algorithm.- by H. Rahil, B. Abou El Majd and M. Bouchoum.- Chapter 22. Solving the P/Prec,pj;Ci j/Cmax using an evolutionary algorithm.- by Dalila Tayachi.- Chapter 23. A User Experiment on Interactive Reoptimization Using Iterated Local Search.- by David Meignan.- Chapter 24. Surrogate-Assisted Multiobjective Evolutionary Algorithm for Fuzzy Job Shop Problems.- by Juan Jose Palacios, Jorge Puente, Camino R. Vela, Inès Gonzalez-Rodriguez and El-Ghazali Talbi.- Chapter 25. Towards a novel reidentification method using metaheuristics.- by Tarik Ljouad, Aouatif Amine, Ayoub Al-Hamadi and Mohammed Rziza.- Chapter 26. Facing the feature selection problem with a binary PSO-GSA approach.- by Malek Sarhani, Abdellatif El Afia and Rdouan Faizi.- Chapter 27. An Optimal Deployment of Readers for RFID Network Planning using NSGA-II.- by Abdelkader Raghib, Badr Abou El Majd, and Brahim Aghezzaf.- Chapter 28. An
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。
本书暂无推荐
本书暂无推荐