Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 9 of 9
Full-Text Articles in Entire DC Network
An Effective Asexual Genetic Algorithm For Solving The Job Shop Scheduling Problem, Mehrdad Amirghasemi, Reza R. Zamani
An Effective Asexual Genetic Algorithm For Solving The Job Shop Scheduling Problem, Mehrdad Amirghasemi, Reza R. Zamani
Faculty of Engineering and Information Sciences - Papers: Part A
All rights reserved. Abstract By using the notion of elite pool, this paper presents an effective asexual genetic algorithm for solving the job shop scheduling problem. Based on mutation operations, the algorithm selectively picks the solution with the highest quality from the pool and after its modification, it can replace the solution with the lowest quality with such a modified solution. The elite pool is initially filled with a number of non-delay schedules, and then, in each iteration, the best solution of the elite pool is removed and mutated in a biased fashion through running a limited tabu search procedure. …
On Transformation Of Query Scheduling Strategies In Distributed And Heterogeneous Database Systems, Janusz R. Getta, - Handoko
On Transformation Of Query Scheduling Strategies In Distributed And Heterogeneous Database Systems, Janusz R. Getta, - Handoko
Faculty of Engineering and Information Sciences - Papers: Part A
This work considers a problem of optimal query processing in heterogeneous and distributed database systems. A global query sub- mitted at a local site is decomposed into a number of queries processed at the remote sites. The partial results returned by the queries are in- tegrated at a local site. The paper addresses a problem of an optimal scheduling of queries that minimizes time spend on data integration of the partial results into the final answer. A global data model defined in this work provides a unified view of the heterogeneous data structures located at the remote sites and a …
Uncertainty Management In Multiobjective Hydro-Thermal Self-Scheduling Under Emission Considerations, Jamshid Aghaei, Abdollah Ahmadi, Abdorreza Rabiee, Vassilios G. Agelidis, Kashem M. Muttaqi, H A. Shayanfar
Uncertainty Management In Multiobjective Hydro-Thermal Self-Scheduling Under Emission Considerations, Jamshid Aghaei, Abdollah Ahmadi, Abdorreza Rabiee, Vassilios G. Agelidis, Kashem M. Muttaqi, H A. Shayanfar
Faculty of Engineering and Information Sciences - Papers: Part A
In this paper, a stochastic multiobjective framework is proposed for a day-ahead short-term Hydro Thermal Self-Scheduling (HTSS) problem for joint energy and reserve markets. An efficient linear formulations are introduced in this paper to deal with the nonlinearity of original problem due to the dynamic ramp rate limits, prohibited operating zones, operating services of thermal plants, multi-head power discharge characteristics of hydro generating units and spillage of reservoirs. Besides, system uncertainties including the generating units' contingencies and price uncertainty are explicitly considered in the stochastic market clearing scheme. For the stochastic modeling of probable multiobjective optimization scenarios, a lattice Monte …
Containership Routing And Scheduling In Liner Shipping: Overview And Future Research Directions, Qiang Meng, Shuaian Wang, Henrik Andersson, Kristian Thun
Containership Routing And Scheduling In Liner Shipping: Overview And Future Research Directions, Qiang Meng, Shuaian Wang, Henrik Andersson, Kristian Thun
Faculty of Engineering and Information Sciences - Papers: Part A
This paper reviews studies from the past 30 years that use operations research methods to tackle containership routing and scheduling problems at the strategic, tactical, and operational planning levels. These problems are first classified and summarized, with a focus on model formulations, assumptions, and algorithm design. The paper then gives an overview of studies on containership fleet size and mix, alliance strategy, and network design (at the strategic level); frequency determination, fleet deployment, speed optimization, and schedule design (at the tactical level); and container booking and routing and ship rescheduling (at the operational level). The paper further elaborates on the …
Delay Aware Joint Routing And Scheduling For Multi-Tx-Rx Wireless Mesh Networks, Luyao Wang, Kwan-Wu Chin, Raad Raad, Sieteng Soh
Delay Aware Joint Routing And Scheduling For Multi-Tx-Rx Wireless Mesh Networks, Luyao Wang, Kwan-Wu Chin, Raad Raad, Sieteng Soh
Faculty of Engineering and Information Sciences - Papers: Part A
Recently, researchers have created Wireless Mesh Networks (WMNs) where routers have multiple transmit (Tx) or receive (Rx) capability. A fundamental problem in such WMNs is deriving a transmission schedule that yields minimal end-to-end delays. In this paper, we approach this problem via joint routing and link scheduling. Specifically, we consider two fundamental issues that influence end-to-end delays: superframe length and transmission slot order. We propose two algorithms: JRS-Multi-DEC and JRS-BIP, where the former uses a novel metric to minimize the load of each link whilst the latter uses a binary integer program solver. Both algorithms have the similar aim of …
Integrating Iterative Crossover Capability In Orthogonal Neighborhoods For Scheduling Resource-Constrained Projects, Reza Zamani
Integrating Iterative Crossover Capability In Orthogonal Neighborhoods For Scheduling Resource-Constrained Projects, Reza Zamani
Faculty of Engineering and Information Sciences - Papers: Part A
An effective hybrid evolutionary search method is presented which integrates a genetic algorithm with a local search. Whereas its genetic algorithm improves the solutions obtained by its local search, its local search component utilizes a synergy between two neighborhood schemes in diversifying the pool used by the genetic algorithm. Through the integration of these two searches, the crossover operators further enhance the solutions that are initially local optimal for both neighborhood schemes; and the employed local search provides fresh solutions for the pool whenever needed. The joint endeavor of its local search mechanism and its genetic algorithm component has made …
Mip-Based Stochastic Security-Constrained Daily Hydrothermal Generation Scheduling, J Aghaei, M Karami, K M. Muttaqi, A Ahmadi, H A. Shayanfar
Mip-Based Stochastic Security-Constrained Daily Hydrothermal Generation Scheduling, J Aghaei, M Karami, K M. Muttaqi, A Ahmadi, H A. Shayanfar
Faculty of Engineering and Information Sciences - Papers: Part A
This paper presents the application of a mixedinteger programming (MIP) approach for solving stochastic security-constrained daily hydrothermal generation scheduling (SCDHGS). Power system uncertainties including generating units and branch contingencies and load uncertainty are explicitly considered in the stochastic programming of SCDHGS. The roulette wheel mechanism and lattice Monte Carlo simulation (LMCS) are first employed for random scenario generation wherein the stochastic SCDHGS procedure is converted into its respective deterministic equivalents (scenarios). Then, the generating units are scheduled through MIP over the set of deterministic scenarios for the purpose of minimizing the cost of supplying energy and ancillary services over the …
Fairness And Capacity Analysis Of Opportunistic Feedback Protocol With Proportional Fair Or Maximum Throughput Scheduling, Hang Li, Qinghua Guo, Licai Fang, Defeng (David) Huang
Fairness And Capacity Analysis Of Opportunistic Feedback Protocol With Proportional Fair Or Maximum Throughput Scheduling, Hang Li, Qinghua Guo, Licai Fang, Defeng (David) Huang
Faculty of Engineering and Information Sciences - Papers: Part A
An opportunistic feedback protocol with maximum throughput (MT) scheduling has been proposed in the literature to achieve multiuser diversity for the downlink transmission of a wireless system, and its system capacity has been analyzed with the assumption that the received signal-to-noise ratios (SNRs) for the users are independent and identically distributed. In this paper, fairness and capacity performances of the opportunistic feedback protocol are analyzed for SNRs with independent but not necessarily identical distributions. In addition to MT scheduling, we also analyze the fairness and capacity performances for proportional fair (PF) scheduling. Compared with MT scheduling, numerical results demonstrate that …
Introducing Algorithm Portfolios To A Class Of Vehicle Routing And Scheduling Problem, Nagesh Shukla, Yogesh Dashora, M K. Tiwari, F T. S Chan, T C. Wong
Introducing Algorithm Portfolios To A Class Of Vehicle Routing And Scheduling Problem, Nagesh Shukla, Yogesh Dashora, M K. Tiwari, F T. S Chan, T C. Wong
Faculty of Engineering and Information Sciences - Papers: Part A
The paper presents a comprehensive foundation and implementation of Algorithm Portfolios to solve Theater Distribution Vehicle Routing and Scheduling Problems (TDVRSP). In order to evaluate the performance of proposed approach, it has been applied to varying dimensions of theater distribution problem. In particular, eight random search metaheuristics embedded in four processors, packed to form different portfolios. Four basic algorithms- Genetic Algorithm (GA), Simulated Annealing (SA), Tabu Search (TS) and Artificial Immune System (AIS), as well as their group theoretic counterparts have been utilized. The proposed approach also takes care of platform dependence and helps evolving a robust solution pack. The …