Construct, Merge, Solve & Adapt: A Hybrid Metaheuristic for Combinatorial Optimization ebook

$28.00

Construct, Merge, Solve & Adapt A Hybrid Metaheuristic for Combinatorial Optimization This book describes a general hybrid metaheuristic for combinatorial optimization labeled Construct, Merge, Solve & Adapt (CMSA). The general idea of standard CMSA is the following one. At each iteration, a number of valid solutions to the tackled problem instance are generated in a probabilistic way. Hereby, each of these solutions is composed of a set of solution components. The components found in the generated solutions are then added to an initially empty sub-instance. Next, an exact solver is applied in order to compute the best solution of the sub-instance, which is then used to update the sub-instance provided as input for the next iteration. In this way, the power of exact solvers can be exploited for solving problem instances much too large for a standalone application of the solver. Important research lines on CMSA from recent years are covered in this book. After an introductory chapter about standard CMSA, subsequent chapters cover a self-adaptive CMSA variant as well as a variant equipped with a learning component for improving the quality of the generated solutions over time. Furthermore, on outlining the advantages of using set-covering-based integer linear programming models for sub-instance solving, the author shows how to apply CMSA to problems naturally modelled by non-binary integer linear programming models. The book concludes with a chapter on topics such as the development of a problem-agnostic CMSA and the relation between large neighborhood search and CMSA. Combinatorial optimization problems used in the book as test cases include the minimum dominating set problem, the variable-sized bin packing problem, and an electric vehicle routing problem. The book will be valuable and is intended for researchers, professionals and graduate students working in a wide range of fields, such as combinatorial optimization, algorithmics, metaheuristics, mathematical modeling, evolutionary computing, operations research, artificial intelligence, or statistics.Construct, Merge, Solve & Adapt: A Hybrid Metaheuristic for Combinatorial Optimization is written by Christian Blum and published by Springer. ISBNs for Construct, Merge, Solve & Adapt are 9783031601033, 3031601033 and the print ISBNs are 9783031601026, 3031601025.

Order Processing Time

All orders placed on our website are processed within 2-4 business days, from Monday to Friday, 8:00 AM – 6:00 PM Pacific Time (PT). Orders received after our daily cut-off time of 10:00 PM PT will be processed on the next business day. Please note that we do not process orders on weekends or public holidays.

Shipping Methods and Carriers

Zetlly partners exclusively with reputable shipping carriers to ensure timely delivery of your orders. We utilize:

FedEx
UPS
USPS

The choice of carrier is determined by factors such as destination, weight, and delivery timeframe to provide optimal service.

Shipping Rates and Fees

Free shipping is provided for all orders over $199.
Orders under $199 will incur a flat-rate shipping fee of $7.99.
All orders shipped within the United States will be subject to a sales tax charge of 5%.

Estimated Delivery Time

Once shipped, orders typically arrive within 6 to 10 business days. Our delivery times are from Monday to Friday, 8:00 AM – 6:00 PM Pacific Time (PT). Please allow additional time for deliveries to remote or rural locations.

Shipping Restrictions

Zetlly currently ships exclusively within the United States. At present, we do not offer international shipping or deliveries to P.O. boxes or APO/FPO addresses. Orders placed with addresses outside our designated delivery areas will be canceled, and refunds will be processed accordingly.

Tracking Your Order

Upon shipment, customers will receive a confirmation email containing tracking information. You can track your order directly through the provided tracking link or by visiting the carrier’s official website:

Please allow up to 48 hours for tracking information to update in the carrier’s system.

Eligibility for Returns and Exchanges

We accept returns and exchanges within 30 days from the date your order is delivered. Items must be unused, in the original condition, and accompanied by the original packaging and receipt or proof of purchase.

How to Return or Exchange an Item

To initiate a return or exchange, please follow these steps:

Contact our customer support at [email protected] with your order number and reason for return or exchange.
Our team will respond within 24 hours to provide detailed instructions, including the specific Return Address for your shipment.
Package your item securely and include all original packaging and proof of purchase.

Return shipments should be sent to: Blanq LLC 1201 South Hope Street Apt 2413, Los Angeles, CA 90015, USA

Return Conditions

Items must be returned in their original condition, unworn, undamaged, and complete with all original packaging and documentation.
Items returned without prior authorization or not meeting the above conditions may not qualify for a refund or exchange.

Return Shipping Costs

Customers are responsible for return shipping costs unless the return is due to our error or a defective product. We recommend using a trackable shipping service to ensure your return reaches us safely.

Non-Returnable Items

The following items cannot be returned:

Digital products (e-books or downloadable content)
Personalized or customized items
Gift cards

Accepted Payment Methods

Zetlly accepts the following secure and widely trusted payment options:

PayPal: Easily pay through your PayPal account, benefiting from secure transactions and buyer protection.
Stripe: Pay securely using major credit and debit cards including Visa, MasterCard, American Express, and Discover via Stripe’s encrypted payment gateway.

Payment Security

At Zetlly, your security is our utmost priority. We utilize advanced encryption technologies and robust security protocols provided by PayPal and Stripe. All payment information entered on our site is encrypted using Secure Socket Layer (SSL) technology, ensuring your financial information remains private and secure throughout the transaction process.

Zetlly does not store any credit card or sensitive financial information directly on our servers, further enhancing the security and protection of your personal data.

Payment Process and Confirmation

Upon placing an order, your chosen payment method (PayPal or Stripe) will immediately process the transaction. You will receive an automated confirmation email shortly after your payment has been successfully completed, detailing your transaction and order summary.

Please retain this confirmation email for your records and reference in case of any inquiries or disputes.

The general idea of standard CMSA is the following one. At each iteration, a number of valid solutions to the tackled problem instance are generated in a probabilistic way. Hereby, each of these solutions is composed of a set of solution components. The components found in the generated solutions are then added to an initially empty sub-instance. Next, an exact solver is applied in order to compute the best solution of the sub-instance, which is then used to update the sub-instance provided as input for the next iteration. In this way, the power of exact solvers can be exploited for solving problem instances much too large for a standalone application of the solver. Important research lines on CMSA from recent years are covered in this book. After an introductory chapter about standard CMSA, subsequent chapters cover a self-adaptive CMSA variant as well as a variant equipped with a learning component for improving the quality of the generated solutions over time. Furthermore, on outlining the advantages of using set-covering-based integer linear programming models for sub-instance solving, the author shows how to apply CMSA to problems naturally modelled by non-binary integer linear programming models. The book concludes with a chapter on topics such as the development of a problem-agnostic CMSA and the relation between large neighborhood search and CMSA. Combinatorial optimization problems used in the book as test cases include the minimum dominating set problem, the variable-sized bin packing problem, and an electric vehicle routing problem. The book will be valuable and is intended for researchers, professionals and graduate students working in a wide range of fields, such as combinatorial optimization, algorithmics, metaheuristics, mathematical modeling, evolutionary computing, operations research, artificial intelligence, or statistics.Construct, Merge, Solve & Adapt: A Hybrid Metaheuristic for Combinatorial Optimization is written by Christian Blum and published by Springer. ISBNs for Construct, Merge, Solve & Adapt are 9783031601033, 3031601033 and the print ISBNs are 9783031601026, 3031601025.