Genetic Algorithm-Based Approaches and Their Applications in Operations Research

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "Mathematics and Computer Science".

Deadline for manuscript submissions: closed (31 December 2019) | Viewed by 7947

Special Issue Editors


E-Mail Website
Guest Editor
Division of Business Administration, Chosun University, 309 Pilmun-daero, Dong-gu, Gwangju 61452, Republic of Korea
Interests: genetic algorithm; logistics; supply chain management

E-Mail Website
Guest Editor
Department of Accounting, Dongeui University, 176 Eomgwang-ro, Busanjin-gu, Busan 47340, Korea
Interests: reverse logistics; genetic algorithm; optimization; logistics cost

Special Issue Information

Dear Colleagues,

Genetic algorithms, as powerful and broadly applicable stochastic search and optimization techniques, are perhaps the most widely known type of evolutionary computation method today. In recent years, research on genetic algorithms has turned much of its attention to various optimization problems in operations research fields. Recently, based on genetic algorithms, various hybrid approaches using genetic algorithms and conventional approaches (e.g., Tabu search, Cuckoo search, particle swarm optimization, ant colony optimization, etc.) have been proved to be effective and efficient in many optimization problems. Genetic algorithm-based approaches have also been adapted to logistics/supply chain management, advanced planning/scheduling, and production/distribution planning. This Special Issue of Mathematics aims to address the critical issues involved in “Genetic Algorithm-Based Approaches and Their Applications in Operations Research”.

The purpose of this Special Issue is to promote, exchange, and disseminate information and research results on genetic algorithm-based approaches and their applications in operations research. This Special Issue will address many important problems of interest in this area. Potential topics include, but are not limited to:

  • Genetic algorithm-based approaches (e.g., hybrid genetic algorithm, adaptive hybrid genetic algorithm, etc.);
  • Other intelligent-related algorithms (e.g., Tabu search, Cuckoo search, particle swarm optimization, ant colony optimization, etc.);
  • Soft computing and metaheuristics applications in various operations research fields (e.g., linear/nonlinear optimization models, transportation/assignment problems, inventory models, network models, decision analysis, multicriteria decisions, etc.);
  • Logistics/supply chain management, advanced planning/scheduling, and production/distribution planning using genetic algorithm-based approaches.

Prof. Dr. YoungSu Yun
Dr. JeongEun Lee
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • Genetic algorithm
  • Operations research
  • Soft computing
  • Metaheuristics
  • Logistics
  • Supply chain management

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue polices can be found here.

Published Papers (2 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

19 pages, 1440 KiB  
Article
Sustainable Closed-Loop Supply Chain Design Problem: A Hybrid Genetic Algorithm Approach
by YoungSu Yun, Anudari Chuluunsukh and Mitsuo Gen
Mathematics 2020, 8(1), 84; https://doi.org/10.3390/math8010084 - 4 Jan 2020
Cited by 27 | Viewed by 4103
Abstract
In this paper, we propose a solution to the sustainable closed-loop supply chain (SCLSC) design problem. Three factors (economic, environmental, and social) are considered for the problem and the three following requirements are addressed while satisfying associated constraint conditions: (i) minimizing the total [...] Read more.
In this paper, we propose a solution to the sustainable closed-loop supply chain (SCLSC) design problem. Three factors (economic, environmental, and social) are considered for the problem and the three following requirements are addressed while satisfying associated constraint conditions: (i) minimizing the total cost; (ii) minimizing the total amount of CO2 emission during production and transportation of products; (iii) maximizing the social influence. Further, to ensure the efficient distribution of products through the SCLSC network, three types of distribution channels (normal delivery, direct delivery, and direct shipment) are considered, enabling a reformulation of the problem as a multi-objective optimization problem that can be solved using Pareto optimal solutions. A mathematical formulation is proposed for the problem, and it is solved using a hybrid genetic algorithm (pro-HGA) approach. The performance of the pro-HGA approach is compared with those of other conventional approaches at varying scales, and the performances of the SCLSC design problems with and without three types of distribution channels are also compared. Finally, we prove that the pro-HGA approach outperforms its competitors, and that the SCLSC design problem with three types of distribution channels is more efficient than that with a single distribution channel. Full article
Show Figures

Figure 1

20 pages, 1084 KiB  
Article
Cooperative Co-Evolution Algorithm with an MRF-Based Decomposition Strategy for Stochastic Flexible Job Shop Scheduling
by Lu Sun, Lin Lin, Haojie Li and Mitsuo Gen
Mathematics 2019, 7(4), 318; https://doi.org/10.3390/math7040318 - 28 Mar 2019
Cited by 10 | Viewed by 2660
Abstract
Flexible job shop scheduling is an important issue in the integration of research area and real-world applications. The traditional flexible scheduling problem always assumes that the processing time of each operation is fixed value and given in advance. However, the stochastic factors in [...] Read more.
Flexible job shop scheduling is an important issue in the integration of research area and real-world applications. The traditional flexible scheduling problem always assumes that the processing time of each operation is fixed value and given in advance. However, the stochastic factors in the real-world applications cannot be ignored, especially for the processing times. We proposed a hybrid cooperative co-evolution algorithm with a Markov random field (MRF)-based decomposition strategy (hCEA-MRF) for solving the stochastic flexible scheduling problem with the objective to minimize the expectation and variance of makespan. First, an improved cooperative co-evolution algorithm which is good at preserving of evolutionary information is adopted in hCEA-MRF. Second, a MRF-based decomposition strategy is designed for decomposing all decision variables based on the learned network structure and the parameters of MRF. Then, a self-adaptive parameter strategy is adopted to overcome the status where the parameters cannot be accurately estimated when facing the stochastic factors. Finally, numerical experiments demonstrate the effectiveness and efficiency of the proposed algorithm and show the superiority compared with the state-of-the-art from the literature. Full article
Show Figures

Figure 1

Back to TopTop