ShopSpell

Metaheuristics: 15th International Conference, MIC 2024, Lorient, France, June 47, 2024, Proceedings, Part I [Paperback]

$96.99       (Free Shipping)
100 available
  • Category: Books (Computers)
  • ISBN-10:  3031629116
  • ISBN-10:  3031629116
  • ISBN-13:  9783031629112
  • ISBN-13:  9783031629112
  • Publisher:  Springer
  • Publisher:  Springer
  • Binding:  Paperback
  • Binding:  Paperback
  • SKU:  3031629116-11-SPRI
  • SKU:  3031629116-11-SPRI
  • Pages:  399
  • Pages:  399
  • Item ID: 106799311
  • Seller: ShopSpell
  • Ships in: 5 business days
  • Transit time: Up to 5 business days
  • Delivery by: Oct 10 to Oct 12
  • Notes: Brand New Item. Not shipped to AK, HI, APO, FPO, AE.

This volume constitutes the refereed proceedings of Metaheuristics on 15th International Conference, MIC 2024, held in Lorient, France, during June 47, 2024.

The 36 full papers presented together with 34 short papers were carefully reviewed and selected from 127 submissions. The conference focuses on artificial intelligence, combinatorial optimization, computer science, graph theory, evolutionary algorithms, genetic algorithms, simulated annealing, optimization, optimization problems.

Advances in Combinatorial Optimization.- Breakout Local Search for Heaviest Subgraph Problem.- A Biased Random Key Genetic Algorithm for solving the ? neighbor p center problem.- A Continuous GRASP Random Key Optimizer.- Adaptive Ant Colony Optimization Using Node Clustering with Simulated Annealing.- Job Shop Scheduling with robot synchronization for transport operations.- AI and metaheuristics for routing.- SIRO A deep learning based next generation optimizer for solving global optimization problems.- Investigation of the Benefit of Extracting Patterns from Local Optima to solve a Bi objective VRPTW.- A Memetic Algorithm for Large Scale Real World Vehicle Routing Problems with Simultaneous Pickup and Delivery with Time Windows.- Tabu Search for Solving Covering Salesman Problem with Nodes and Segments.- GRASP with PATH RELINKING.- VNS with Path Relinking for the Profitable Close Enough Arc Routing Problem.- Meta heuristics for preference learning.- A simulated annealing algorithm to learn an RMP preference model.- New VRP and extensions.- Iterative Heuristic over Periods for the Inventory Routing Problem.- Combining Heuristics and Constraint Programming for the Parallel Drone Scheduling Vehicle Routing Problem with Clƒ$

Add Review