Urban Transit Network Design Problem (UTNDP) focuses on deriving useful set of
routes, manageable timetabling for each transit route and transit scheduling based on
available resources. UTNDP is commonly subdivided into Urban Transit Routing
Problem (UTRP) and Urban Transit Scheduling Problem (UTSP), respectively. There are
various approaches applied to solve the UTSP. The aim of this paper is to give a
comprehensive list of studies on UTSP that deals with metaheuristic approaches such
as Tabu Search, Simulated Annealing, Genetic Algorithm and their hybrid methods. This
review also addressed possible gaps of the approaches and the limitations of the
overall problem. It can be concluded that only some of the metaheuristic approaches
and sub-problems are highly studied in UTSP. This review will be useful for researchers
who are interested in expanding their knowledge and conduct research in UTSP using
metaheuristic approaches.
The urban transit network design problem (UTNDP) involves the development of a transit route set and associated schedules for an urban public transit system. The design of efficient public transit systems is widely considered as a viable option for the economic, social, and physical structure of an urban setting. This paper reviews four well-known population-based metaheuristics that have been employed and deemed potentially viable for tackling the UTNDP. The aim is to give a thorough review of the algorithms and identify the gaps for future research directions.
Facility Layout Problem (FLP) is a NP-hard problem concerned with the arrangement of facilities as to minimize the distance travelled between all pairs of facilities. Many exact and approximate approaches have been proposed with an extensive applicability to deal with this problem. This paper studies the fundamentals of some well-known heuristics and metaheuristics used in solving the FLPs. It is hoped that this paper will trigger researchers for in-depth studies in FLPs looking into more specific interest such as equal or unequal FLPs.
Credit scoring is an important tool used by financial institutions to correctly identify defaulters and non-defaulters. Support Vector Machines (SVM) and Random Forest (RF) are the Artificial Intelligence techniques that have been attracting interest due to their flexibility to account for various data patterns. Both are black-box models which are sensitive to hyperparameter settings. Feature selection can be performed on SVM to enable explanation with the reduced features, whereas feature importance computed by RF can be used for model explanation. The benefits of accuracy and interpretation allow for significant improvement in the area of credit risk and credit scoring. This paper proposes the use of Harmony Search (HS), to form a hybrid HS-SVM to perform feature selection and hyperparameter tuning simultaneously, and a hybrid HS-RF to tune the hyperparameters. A Modified HS (MHS) is also proposed with the main objective to achieve comparable results as the standard HS with a shorter computational time. MHS consists of four main modifications in the standard HS: (i) Elitism selection during memory consideration instead of random selection, (ii) dynamic exploration and exploitation operators in place of the original static operators, (iii) a self-adjusted bandwidth operator, and (iv) inclusion of additional termination criteria to reach faster convergence. Along with parallel computing, MHS effectively reduces the computational time of the proposed hybrid models. The proposed hybrid models are compared with standard statistical models across three different datasets commonly used in credit scoring studies. The computational results show that MHS-RF is most robust in terms of model performance, model explainability and computational time.
A novel technique has been introduced in this research which lends its basis to the Directional Slack-Based Measure for the inverse Data Envelopment Analysis. In practice, the current research endeavors to elucidate the inverse directional slack-based measure model within a new production possibility set. On one occasion, there is a modification imposed on the output (input) quantities of an efficient decision making unit. In detail, the efficient decision making unit in this method was omitted from the present production possibility set but substituted by the considered efficient decision making unit while its input and output quantities were subsequently modified. The efficiency score of the entire DMUs will be retained in this approach. Also, there would be an improvement in the efficiency score. The proposed approach was investigated in this study with reference to a resource allocation problem. It is possible to simultaneously consider any upsurges (declines) of certain outputs associated with the efficient decision making unit. The significance of the represented model is accentuated by presenting numerical examples.