Titlebook: Recent Developments in Metaheuristics; Lionel Amodeo,El-Ghazali Talbi,Farouk Yalaoui Book 2018 Springer International Publishing AG 2018 M

幼兒

BORE

羽飾

音樂等

帶來墨水

Sampling-Based Genetic Algorithms for the Bi-Objective Stochastic Covering Tour Problem,. The proposed extension uses variable samples for gradually improving approximations to the Pareto front. The approach is evaluated on a test benchmark for a humanitarian logistics application with data from Senegal. Comparisons to alternative solution techniques, in particular also to the exact so

encyclopedia

A Metaheuristic Framework for Dynamic Network Flow Problems,e dependent parameters. This can occur in many applications such in evacuation of people or vehicules in emergency time..The majority of existing algorithms are based on mathematical approximations. However, this work proposes another technique based on metaheuristics. A general framework is provide

Morsel

A Greedy Randomized Adaptive Search for the Surveillance Patrol Vehicle Routing Problem,a real need of a surveillance company to create fairer routing plans for its security patrols. The problem consist into routing a set of patrols in order to visit a set of checkpoints. Each checkpoint requires one or more visits, each one of which, to be performed within a fixed time window. A minim

孤僻

Strip Algorithms as an Efficient Way to Initialise Population-Based Metaheuristics,oblems with some success. Its attraction is its efficiency. In its simplest form, it can find tours of length . in .?(.?log?.) operations where . is the number of nodes. Here, we set out to investigate new variants such as the 2-Part Strip Algorithm (2-PSA), the Spiral Strip Algorithm (SSA) and the

多嘴

Matheuristics for the Temporal Bin Packing Problem,mum number of bins to pack all the items respecting the bin capacity at any instant of time. Both a polynomial-size formulation and an extensive formulation are studied. Moreover, various heuristic algorithms are developed and compared, including greedy heuristicsand a column generationbased heurist

Provenance

All-Terrain Tabu Search Approaches for Production Management Problems,cussed: different neighborhood structures (i.e., different types of moves), guided restarts based on a distance function, and deconstruction/reconstruction techniques. The resulting . tabu search approaches are illustrated for various production problems:car sequencing,job scheduling,resource allocation, andinventory management.