Home > Mathematics and Science Textbooks > Mathematics > Optimization > Evolutionary Computation in Combinatorial Optimization: 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings(9595 Lecture Notes in Computer Science)
36%
Evolutionary Computation in Combinatorial Optimization: 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings(9595 Lecture Notes in Computer Science)

Evolutionary Computation in Combinatorial Optimization: 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings(9595 Lecture Notes in Computer Science)

          
5
4
3
2
1

Available


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

This book constitutes the refereed proceedings of the 16th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2016, held in Porto, Portugal, in March/April 2016, co-located with the Evo*2015 events EuroGP, EvoMUSART and EvoApplications. The 17 revised full papers presented were carefully reviewed and selected from 44 submissions. The papers cover methodology, applications and theoretical studies. The methods included evolutionary and memetic algorithms, variable neighborhood search, particle swarm optimization, hyperheuristics, mat-heuristic and other adaptive approaches. Applications included both traditional domains, such as graph coloring, vehicle routing, the longest common subsequence problem, the quadratic assignment problem; and new(er) domains such as the traveling thief problem, web service location, and finding short addition chains. The theoretical studies involved fitness landscape analysis, local search and recombination operator analysis, and the big valley search space hypothesis. The consideration of multiple objectives, dynamic and noisy environments was also present in a number of articles.

Table of Contents:
A Hybrid Constructive Mat-Heuristic Algorithm for The Heterogeneous Vehicle Routing Problem with Simultaneous Pick-up and Delivery.- A Property Preserving Method for Extending a Single-Objective Problem Instance to Multiple Objectives with Specific Correlations.- An Evolutionary Approach to the Full Optimization of the Traveling Thief Problem.- Construct, Merge, Solve & Adapt: Application to the Repetition-Free Longest Common Subsequence Problem.- Deconstructing the Big Valley Search Space Hypothesis.- Determining the Difficulty of Landscapes by PageRank Centrality in Local Optima Networks.- Efficient Hill Climber for Multi-Objective Pseudo-Boolean Optimization.- Evaluating Hyperheuristics and Local Search Operators for Periodic Routing Problems.- Evolutionary Algorithms for Finding Short Addition Chains: Going the Distance.- Experimental Evaluation of Two Approaches to Optimal Recombination for Permutation Problems.- Hyperplane Elimination for Quickly Enumerating Local Optima.- Limits to Learning in Reinforcement Learning Hyperheuristics.- Modifying Colourings between Time-Steps to Tackle Changes in Dynamic Random Graphs.- Particle Swarm Optimisation with Sequence-Like Indirect Representation for Web Service Composition.- Particle Swarm Optimization for Multi-Objective Web Service Location Allocation.- Sim-EDA: A Multipopulation Estimation of Distribution Algorithm Based on Problem Similarity.- Solving the Quadratic Assignment Problem with Cooperative Parallel Extremal Optimization. 


Best Sellers


Product Details
  • ISBN-13: 9783319306971
  • Publisher: Springer International Publishing AG
  • Publisher Imprint: Springer International Publishing AG
  • Edition: 1st ed. 2016
  • Language: English
  • Returnable: Y
  • Spine Width: 15 mm
  • Weight: 394 gr
  • ISBN-10: 3319306979
  • Publisher Date: 16 Mar 2016
  • Binding: Paperback
  • Height: 235 mm
  • No of Pages: 267
  • Series Title: 9595 Lecture Notes in Computer Science
  • Sub Title: 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings
  • Width: 155 mm


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Evolutionary Computation in Combinatorial Optimization: 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings(9595 Lecture Notes in Computer Science)
Springer International Publishing AG -
Evolutionary Computation in Combinatorial Optimization: 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings(9595 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Evolutionary Computation in Combinatorial Optimization: 16th European Conference, EvoCOP 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings(9595 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA