Muutke küpsiste eelistusi

E-raamat: Evolutionary Computation in Combinatorial Optimization: 17th European Conference, EvoCOP 2017, Amsterdam, The Netherlands, April 19-21, 2017, Proceedings

Edited by , Edited by
  • Formaat - EPUB+DRM
  • Hind: 55,56 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This book constitutes the refereed proceedings of the 17th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2017, held in Amsterdam, The Netherlands, in April 2017, co-located with the Evo*2017 events EuroGP, EvoMUSART and EvoApplications.





The 16 revised full papers presented were carefully reviewed and selected from 39 submissions. The papers cover both empirical and theoretical studies on a wide range of academic and real-world applications. The methods include evolutionary and memetic algorithms, large neighborhood search, estimation of distribution algorithms, beam search, ant colony optimization, hyper-heuristics and matheuristics. Applications include both traditional domains, such as knapsack problem, vehicle routing, scheduling problems and SAT; and newer domains such as the traveling thief problem, location planning for car-sharing systems and spacecraft trajectory optimization. Papers also study important concepts such as pseudo-backbones, phase transitions in local optima networks, and the analysis of operators. This wide range of topics makes the EvoCOP proceedings an important source for current research trends in combinatorial optimization.
A Computational Study of Neighborhood Operators for Job-shop Scheduling
Problems with Regular Objectives.- A Genetic Algorithm for Multi-Component
Optimization Problems: the Case of the Travelling Thief Problem.- A Hybrid
Feature Selection Algorithm Based on Large Neighborhood Search.- A Memetic
Algorithm to Maximise the Employee Substitutability in Personnel Shift
Scheduling.- Construct, Merge, Solve and Adapt versus Large Neighborhood
Search for Solving the Multi-Dimensional Knapsack Problem: Which One Works
Better When.- Decomposing SAT Instances with Pseudo Backbones.- Efficient
Consideration of Soft Time Windows in a Large Neighborhood Search for the
Districting and Routing Problem for Security Control.- Estimation of
Distribution Algorithms for the Firefighter Problem.- LCS-Based Selective
Route Exchange Crossover for the Pickup and Delivery Problem with Time
Windows.- Multi-rendezvous Spacecraft Trajectory Optimization with Beam
P-ACO.- Optimizing Charging Station Locations for Electric Car-Sharing
Systems.- Selection of Auxiliary Objectives Using Landscape Features and
Offline Learned Classifier.- Sparse, Continuous Policy Representations for
Uniform Online Bin Packing via Regression of Interpolants.- The Weighted
Independent Domination Problem: ILP Model and Algorithmic