• No results found

Variable neighborhood search algorithm

Variable neighborhood search algorithm for the green vehicle routing problem   Pages 195-204
		 Download PDF

Variable neighborhood search algorithm for the green vehicle routing problem Pages 195-204 Download PDF

... adaptive variable neighborhood search (AVNS) to deal with this ...a variable neighborhood search (VNS) with a tabu search (TS) to solve the electric vehicle routing ...

10

A Variable Neighborhood Search Algorithm for Solving the Steiner Minimal Tree Problem in Sparse Graphs

A Variable Neighborhood Search Algorithm for Solving the Steiner Minimal Tree Problem in Sparse Graphs

... the search space; The metaheuristic algorithm belongs to the class of optimal search ...local search algorithms, Tabu search algorithms, genetic algorithms, parallel genetic algorithms, ...

6

Investigating Zone Pricing in a Location-Routing Problem Using a Variable Neighborhood Search Algorithm

Investigating Zone Pricing in a Location-Routing Problem Using a Variable Neighborhood Search Algorithm

... One of the notable pricing policy is mill pricing that excludes the cost of transporting the commodities from the point of sale. In this area, Beckmann and Ingene [11] and Hansen et al. [15] discussed the situation with ...

10

A hybrid integer programming and variable neighborhood search algorithm to solve Nurse Rostering Problems

A hybrid integer programming and variable neighborhood search algorithm to solve Nurse Rostering Problems

... VNS algorithm to improve the quality of the obtained solution and diversify the search process at the same ...Local Search framework for generating an initial solution and employed VNS and CP in ...

35

Hybrid algorithms for Job shop Scheduling Problem with Lot streaming and A Parallel Assembly Stage

Hybrid algorithms for Job shop Scheduling Problem with Lot streaming and A Parallel Assembly Stage

... of neighborhood structures and the sequence of their implementations are ...the algorithm is comprised of internal and external ...And search process begins again at the first iteration of the ...

21

Multiobjective optimization in delivering pharmaceutical products with disrupted vehicle routing problem   Pages 299-316
		 Download PDF

Multiobjective optimization in delivering pharmaceutical products with disrupted vehicle routing problem Pages 299-316 Download PDF

... local search methods to solve the multi objective ...local search; the idea consists of selecting a solution, searching around it in each direction then updating the ...metaheuristic algorithm ...

18

Hybrid Genetic Algorithm and Variable Neighborhood Search for Dynamic Facility Layout Problem

Hybrid Genetic Algorithm and Variable Neighborhood Search for Dynamic Facility Layout Problem

... In this paper, a new hybrid GA-VNS was introduced to deal with the DFLP. In the proposed hybrid algorithm, the population was splitted into two parts; one part was assigned into the GA and the other part was ...

12

A two-phase variable neighborhood search for solving nonlinear optimal control problems

A two-phase variable neighborhood search for solving nonlinear optimal control problems

... two-phase algorithm, namely IVNS, is proposed for solving nonlinear optimal control ...the algorithm, we use a variable neighborhood search (VNS), which performs a uniform distribution ...

25

An Integrated Approach of Support Vector Machine and Variable Neighborhood Search for Discovering Combinational Gene Signatures in Predicting Chemo-response of Osteosarcoma

An Integrated Approach of Support Vector Machine and Variable Neighborhood Search for Discovering Combinational Gene Signatures in Predicting Chemo-response of Osteosarcoma

... Local Search Function is developed as a simple hill-climbing algorithm based on both aforementioned ...the algorithm stops if the number of moves, n, meets a predefined number, n max ...

5

Variable Neighborhood Search for solving Bandwidth Coloring Problem

Variable Neighborhood Search for solving Bandwidth Coloring Problem

... for algorithm comparison ...local search and constraint ...local search algorithms for solving general and large size instances of the set T-coloring ...

20

Use of Genetic algorithm based approaches in scheduling of FMS: A Review.

Use of Genetic algorithm based approaches in scheduling of FMS: A Review.

... genetic algorithm to solve the flexible job-shop scheduling problem with makespan ...the algorithm. Numerical experiments show that our algorithm can find out high-quality ...genetic algorithm ...

7

Modified Particle Swarm Optimization Combined with Trigonometric Function and Variable Neighborhood Search

Modified Particle Swarm Optimization Combined with Trigonometric Function and Variable Neighborhood Search

... The particle swarm optimization (PSO), inspired by social behavior of bird flocking and fish schooling, is a stochastic population-based powerful optimization technique for solving global optimization problems, firstly ...

8

Variable Neighborhood Search Methods for the Dynamic Minimum Cost Hybrid Berth Allocation Problem

Variable Neighborhood Search Methods for the Dynamic Minimum Cost Hybrid Berth Allocation Problem

... the algorithm by hybridization of the metaheuristic ap- proach with mathematical ...branch-and-cut algorithm incorporated in CPLEX solver is also used in [30] in the case of BAP under time-dependent ...

18

Simulation optimization based ant colony algorithm for the uncertain quay crane scheduling problem   Pages 111-132
		 Download PDF

Simulation optimization based ant colony algorithm for the uncertain quay crane scheduling problem Pages 111-132 Download PDF

... a Variable Neighborhood Descent (VND) local search is proposed to determine the assignments of tasks to quay cranes and the sequences of executions of tasks on each ...optimization algorithm ...

22

A Novel Evolutionary Algorithm with Neighborhood Search for Project Portfolios Optimization Problem

A Novel Evolutionary Algorithm with Neighborhood Search for Project Portfolios Optimization Problem

... evolutionary algorithm with neighborhood search (QEANS) for project portfolios optimization problem with limited re- sources and bounded risks for each project ...decision variable is directly ...

8

A mathematical model for the electric vehicle routing with time windows considering queuing system at charging stations and alternative paths

A mathematical model for the electric vehicle routing with time windows considering queuing system at charging stations and alternative paths

... ALNS algorithm with several removal and insertion mechanisms by selecting them dynamically and adaptively based on their past performances, including new mechanisms specifically designed for E-VRPTW and ...local ...

23

An adaptive large neighborhood search heuristic for solving the reliable multiple allocation hub location problem under hub disruptions   Pages 191-202
		 Download PDF

An adaptive large neighborhood search heuristic for solving the reliable multiple allocation hub location problem under hub disruptions Pages 191-202 Download PDF

... first algorithm, demand nodes are allocated to nearest hub and in second method, allocations are determined based on the value of the objective function between the first nearest and the second ...taboo ...

12

Hybrid Real-Coded Genetic Algorithm and Variable Neighborhood Search for Optimization of Product Storage

Hybrid Real-Coded Genetic Algorithm and Variable Neighborhood Search for Optimization of Product Storage

... genetic algorithm (GA) as the optimization ...complex search spaces because it is easy to be trapped in local ...genetic algorithm and Variable Neighborhood Search (HRCGA- VNS) ...

11

A Hybrid Water Flow-Like Algorithm and Variable Neighbourhood Search for Traveling Salesman Problem

A Hybrid Water Flow-Like Algorithm and Variable Neighbourhood Search for Traveling Salesman Problem

... Flow Algorithm (WFA) is one of the recent population-based metaheuristic optimization techniques used for solving this ...local search strategy has a significant impact on the algorithm ...a ...

7

Application of Algorithms with Variable Greedy Heuristics for k-Medoids Problems

Application of Algorithms with Variable Greedy Heuristics for k-Medoids Problems

... the algorithm must find several points called cluster centers, centroids, medoids, depending on the specific problem which minimize some function of distances from known objects to the ...the Variable ...

8

Show all 10000 documents...

Related subjects