Search
نمایش تعداد 1-10 از 17
Using Scatter Search Algorithm to solve a multi_objective Transportation problem_ a case study
on scatter search is proposed. In this problem operating costs as well as equality of services are considered. The solution procedure consists of developing feasible solutions, then improving the solutions by using the local and global search operand...
Public Transport Fleet Scheduling for Minimizing Total Transfer Waiting Time
it using ILOG CPLEX solver. For large-scale test instances, we develop a metaheuristic based on the scatter search algorithm to obtain good solutions in reasonable CPU run times. Finally, in the computational section, the
efficiency of the proposed...
Population-based metaheuristics for R&D project scheduling problems under activity failure risk
and construct two population-based metaheuristics including scatter search algorithm and genetic algorithm as solution approaches. Computational experiments indicate scatter search outperforms genetic algorithm and also available exact solution algorithms....
Modification of scatter search for examination timetabling problem
s timetable and also so much time.
Therefore it is no longer good enough to use the previous year s timetable.
In this approach we modify Scatter Search method and solve the Examination
Timetabling Problem (ETP) with a first solution...
Using Scatter Search to solve a multi-objective transportation problem- a case study
Routing vehicles for schools and and similar services is one of the most visible ....
Memetic and scatter search metaheuristic algorithms for a multiobjective fortnightly university course timetabling problem: a case study
, four objectives should be optimized where we used the Lp-metric method to aggregate them into a single objective. An integer linear programming model and two metaheuristic algorithms, i.e. memetic and scatter search, have been developed for the studied...
A hybrid metaheuristic for concurrent layout and scheduling problem in a job shop environment
hybrid metaheuristic approach based on the scatter search algorithm is developed to tackle this problem. Using 43 randomly generated benchmark instances, the performance of the scatter search and its components are evaluated. We also applied our procedure...
Simultaneous selection and scheduling with sequence-dependent setup times, lateness penalties, and machine availability constraint: Heuristic approaches
is maximized. The cost components considered include jobs' processing costs and weighted earliness/tardiness penalties. Two heuristic algorithms; namely scatter search (SS) and simulated annealing (SA), were employed to solve the problem...
A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling
. The objective is to schedule each activity in one of its modes in order to minimize the project makespan. We use a scatter search algorithm to tackle this problem, using
path relinking methodology as a solution combination method. Computational results...
A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search
deadline. We apply a so called electromagnetic scatter search to solve this problem. In this process, we initially generate a population of feasible solutions. In so doing, we use frequency memory to well sample the feasible region. A number...