Designing a reverse logistics network for end-of-life vehicles recovery.
Zarei, Masoud, Mansour, Saeed, Kashan, Ali Husseinzadeh, Karimi, Behrooz (2010)
Mathematical Problems in Engineering
Similarity:
Zarei, Masoud, Mansour, Saeed, Kashan, Ali Husseinzadeh, Karimi, Behrooz (2010)
Mathematical Problems in Engineering
Similarity:
Jozef Kratica, Dušan Tošic, Vladimir Filipović, Ivana Ljubić (2001)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve this problem. By using the developed algorithm it is possible to solve SPLP with more than 1000 facility sites and customers. Computational results are presented and compared to dual based algorithms.
Chen, Hanning, Zhu, Yunlong, Hu, Kunyuan, Li, Xuhui (2010)
Mathematical Problems in Engineering
Similarity:
Wojciech Jaśkowski, Krzysztof Krawiec, Bartosz Wieloch (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Anabela Tereso, Rui Novais, M. Araújo, Salah Elmaghraby (2009)
Control and Cybernetics
Similarity:
Zdzisław Kowalczuk, Tomasz Białaszewski (2006)
International Journal of Applied Mathematics and Computer Science
Similarity:
Different types of niching can be used in genetic algorithms (GAs) or evolutionary computations (ECs) to sustain the diversity of the sought optimal solutions and to increase the effectiveness of evolutionary multi-objective optimization solvers. In this paper four schemes of niching are proposed, which are also considered in two versions with respect to the method of invoking: a continuous realization and a periodic one. The characteristics of these mechanisms are discussed, while as...
José A. Moreno Pérez, Belén Melián Batista, Manuel Laguna (2005)
The Yugoslav Journal of Operations Research
Similarity:
Jozef Kratica, Dušan Tošić, Vladimir Filipović, Đorđe Dugošija (2011)
The Yugoslav Journal of Operations Research
Similarity:
Mahjoub Dridi, Imed Kacem (2004)
International Journal of Applied Mathematics and Computer Science
Similarity:
In this paper, we consider a regulation problem of an urban transportation network. From a given timetable, we aim to find a new schedule of multiple vehicles after the detection of a disturbance at a given time. The main objective is to find a solution maximizing the level of service for all passengers. This problem was intensively studied with evolutionary approaches and multi-agent techniques, but without identifying its type before. In this paper, we formulate the problem as a classical...
Khaled Mesghouni, Slim Hammadi, Pierre Borne (2004)
International Journal of Applied Mathematics and Computer Science
Similarity:
This paper explains how to use Evolutionary Algorithms (EA) to deal with a flexible job shop scheduling problem, especially minimizing the makespan. The Job-shop Scheduling Problem (JSP) is one of the most difficult problems, as it is classified as an NP-complete one (Carlier and Chretienne, 1988; Garey and Johnson, 1979). In many cases, the combination of goals and resources exponentially increases the search space, and thus the generation of consistently good scheduling is particularly...
Spinellis, Diomidis D., Papadopoulos, Chrissoleon T. (2001)
Mathematical Problems in Engineering
Similarity:
Giardini, Giovanni, Kalmár-Nagy, Tamás (2011)
Mathematical Problems in Engineering
Similarity:
Ghoseiri, Keivan, Morshedsolouk, Fahimeh (2006)
Journal of Applied Mathematics and Decision Sciences
Similarity: