Abstract: China’s declared transformation towards a ‘new electricity system dominated by renewable energy’ requires a cleaner electricity consumption mix with high shares of renewable energy sourced-electricity (RES-E). Unfortunately, integration of RES-E into Chinese electricity markets remains a problem pending more robust legal support, evidenced by the curtailment of wind and solar power due to integration constraints. The upcoming Energy Law of the PRC (Energy Law) is expected to provide such long-awaiting support and coordinate the existing diverse sector-specific laws to deal with the weak implementation that dampening the delivery of their desired regulatory effects. However, in the shadow of the COVID-19 crisis, it remains uncertain how this new Energy Law brings synergies to RES-E integration, mindful of the significant impacts of the pandemic. Through the theoretical lens of the interplay between China’s electricity market reform and legislative development, this paper investigates whether there is a paradigm shift in Energy Law regarding renewable energy integration compared with the existing sector-specific energy laws. It examines the 2020 Draft for Comments on the Energy Law and analyses its relationship with sector-specific energy laws focusing on RES-E integration. The comparison is drawn upon five critical aspects of the RES-E integration issue, including the status of renewables, marketisation, incentive schemes, consumption mechanisms, access to power grids and dispatching. The analysis shows that it is reasonable to expect a more open and well-organised electricity market, enabling the absorption of high shares of RES-E. The present paper concludes that a period of prosperous development of RES-E in the post-COVID-19 era can be anticipated with the legal support by the upcoming Energy Law. It contributes to understanding the signals China is sending regarding the transition towards a cleaner energy future.
Abstract: In Japan, taxi is one of the popular transportations and taxi industry is one of the big businesses. However, in recent years, there has been a difficult problem of reducing the number of taxi drivers. In the taxi business, mainly three passenger catching methods are applied. One style is "cruising" that drivers catches passengers while driving on a road. Second is "waiting" that waits passengers near by the places with many requirements for taxies such as entrances of hospitals, train stations. The third one is "dispatching" that is allocated based on the contact from the taxi company. Above all, the cruising taxi drivers need the experience and intuition for finding passengers, and it is difficult to decide "the destination for cruising". The strong recommendation system for the cruising taxies supports the new drivers to find passengers, and it can be the solution for the decreasing the number of drivers in the taxi industry. In this research, we propose a method of recommending a destination for cruising taxi drivers. On the other hand, as a machine learning technique, the embedding models that embed the high dimensional data to a low dimensional space is widely used for the data analysis, in order to represent the relationship of the meaning between the data clearly. Taxi drivers have their favorite courses based on their experiences, and the courses are different for each driver. We assume that the course of cruising taxies has meaning such as the course for finding business man passengers (go around the business area of the city of go to main stations) and course for finding traveler passengers (go around the sightseeing places or big hotels), and extract the meaning of their destinations. We analyze the cruising history data of taxis based on the embedding model and propose the recommendation system for passengers. Finally, we demonstrate the recommendation of destinations for cruising taxi drivers based on the real-world data analysis using proposing method.
Abstract: In this paper, we report how to acquire serious victims’ locations in the Acute Stage of Large-scale Disasters, in an Emergency Information Network System designed by us. The background of our concept is based on the Great East Japan Earthquake occurred on March 11th, 2011. Through many experiences of national crises caused by earthquakes and tsunamis, we have established advanced communication systems and advanced disaster medical response systems. However, Japan was devastated by huge tsunamis swept a vast area of Tohoku causing a complete breakdown of all the infrastructures including telecommunications. Therefore, we noticed that we need interdisciplinary collaboration between science of disaster medicine, regional administrative sociology, satellite communication technology and systems engineering experts. Communication of emergency information was limited causing a serious delay in the initial rescue and medical operation. For the emergency rescue and medical operations, the most important thing is to identify the number of casualties, their locations and status and to dispatch doctors and rescue workers from multiple organizations. In the case of the Tohoku earthquake, the dispatching mechanism and/or decision support system did not exist to allocate the appropriate number of doctors and locate disaster victims. Even though the doctors and rescue workers from multiple government organizations have their own dedicated communication system, the systems are not interoperable.
Abstract: Traditionally, three important manufacturing functions which are process planning, scheduling and due-date assignment are performed sequentially and separately. Although there are numerous works on the integration of process planning and scheduling and plenty of works focusing on scheduling with due date assignment, there are only a few works on integrated process planning, scheduling and due-date assignment. Although due-dates are determined without taking into account of weights of the customers in the literature, here weighted due-date assignment is employed to get better performance. Jobs are scheduled according to weighted earliest due date dispatching rule and due dates are determined according to some popular due date assignment methods by taking into account of the weights of each job. Simulated Annealing, Evolutionary Strategies, Random Search, hybrid of Random Search and Simulated Annealing, and hybrid of Random Search and Evolutionary Strategies, are applied as solution techniques. Three important manufacturing functions are integrated step-by-step and higher integration levels are found better. Search meta-heuristics are found to be very useful while improving performance measure.
Abstract: Composite patching is a common way for reinforcing the cracked pipes and cylinders. The effects of composite patch reinforcement on fracture parameters of a cracked pipe depend on a variety of parameters such as number of layers, angle, thickness, and material of each layer. Therefore, stacking sequence optimization of composite patch becomes crucial for the applications of cracked pipes. In this study, in order to obtain the optimal stacking sequence for a composite patch that has minimum weight and maximum resistance in propagation of cracks, a coupled Multi-Objective Genetic Algorithm (MOGA) and Finite Element Method (FEM) process is proposed. This optimization process has done for longitudinal and transverse semi-elliptical cracks and optimal stacking sequences and Pareto’s front for each kind of cracks are presented. The proposed algorithm is validated against collected results from the existing literature.
Abstract: This paper aims to present non-population search algorithms called tabu search (TS), simulated annealing (SA) and variable neighborhood search (VNS) to minimize the total cost of capacitated MRP problem in multi-stage assembly flow shop with two alternative machines. There are three main steps for the algorithm. Firstly, an initial sequence of orders is constructed by a simple due date-based dispatching rule. Secondly, the sequence of orders is repeatedly improved to reduce the total cost by applying TS, SA and VNS separately. Finally, the total cost is further reduced by optimizing the start time of each operation using the linear programming (LP) model. Parameters of the algorithm are tuned by using real data from automotive companies. The result shows that VNS significantly outperforms TS, SA and the existing algorithm.
Abstract: Conventionally, process planning, scheduling, and due-date assignment functions are performed separately and sequentially. The interdependence of these functions requires integration. Although integrated process planning and scheduling, and scheduling with due date assignment problems are popular research topics, only a few works address the integration of these three functions. This work focuses on the integration of process planning, WMS scheduling, and WPPW due date assignment. Another novelty of this work is the use of a weighted due date assignment. In the literature, due dates are generally assigned without considering the importance of customers. However, in this study, more important customers get closer due dates. Typically, only tardiness is punished, but the JIT philosophy punishes both earliness and tardiness. In this study, all weighted earliness, tardiness, and due date related costs are penalized. As no customer desires distant due dates, such distant due dates should be penalized. In this study, various levels of integration of these three functions are tested and genetic search and random search are compared both with each other and with ordinary solutions. Higher integration levels are superior, while search is always useful. Genetic searches outperformed random searches.
Abstract: In this paper, we introduce a flexible box erecting
machine (BEM) that swiftly and automatically transforms cardboard
into a three dimensional box. Recently, the parcel service and
home-shopping industries have grown rapidly, and there is an
increasing need for various box types to ship various products.
However, workers cannot fold thousands of boxes manually in a day.
As such, automatic BEMs are garnering greater attention. This study
takes equipment operation into consideration as well as mechanical
improvements in order to design a BEM that is able to outperform its
conventional counterparts. We analyzed six dispatching rules – First In
First Out (FIFO), Shortest Processing Time (SPT), Earliest Due Date
(EDD), Setup Avoidance, EDD + SPT, and EDD + Setup Avoidance –
to determine which one was most suitable for BEM operation.
Consequently, SPT and Setup Avoidance were found to be the most
critical rules, followed by EDD + Setup Avoidance, EDD + SPT,
EDD, and FIFO. This hierarchy was valid for both our conventional
BEM and our new flexible BEM from the viewpoint of processing
time. We believe that this research can contribute to flexible BEM
management, which has the potential to increase productivity and
convenience.
Abstract: Microscopic simulation tool kits allow for
consideration of the two processes of railway operations and the
previous timetable production. Block occupation conflicts on both
process levels are often solved by using defined train priorities. These
conflict resolutions (dispatching decisions) generate reactionary
delays to the involved trains. The sum of reactionary delays is
commonly used to evaluate the quality of railway operations, which
describes the timetable robustness. It is either compared to an
acceptable train performance or the delays are appraised
economically by linear monetary functions. It is impossible to
adequately evaluate dispatching decisions without a well-founded
objective function. This paper presents a new approach for the
evaluation of dispatching decisions. The approach uses mode choice
models and considers the behaviour of the end-customers. These
models evaluate the reactionary delays in more detail and consider
other competing modes of transport. The new approach pursues the
coupling of a microscopic model of railway operations with the
macroscopic choice mode model. At first, it will be implemented for
railway operations process but it can also be used for timetable
production. The evaluation considers the possibility for the customer
to interchange to other transport modes. The new approach starts to
look at rail and road, but it can also be extended to air travel. The
result of mode choice models is the modal split. The reactions by the
end-customers have an impact on the revenue of the train operating
companies. Different purposes of travel have different payment
reserves and tolerances towards late running. Aside from changes to
revenues, longer journey times can also generate additional costs.
The costs are either time- or track-specific and arise from required
changes to rolling stock or train crew cycles. Only the variable values
are summarised in the contribution margin, which is the base for the
monetary evaluation of delays. The contribution margin is calculated
for different possible solutions to the same conflict. The conflict
resolution is optimised until the monetary loss becomes minimal. The
iterative process therefore determines an optimum conflict resolution
by monitoring the change to the contribution margin. Furthermore, a
monetary value of each dispatching decision can also be derived.
Abstract: While millings materials from old pavement surface
can be an important component of cost effective maintenance
operation, their use in maintenance projects are not uniform and well
documented. This study documents the different maintenance
practices followed by four transportation districts of New Mexico
Department of Transportation (NMDOT) in an attempt to find
whether millings are being used in maintenance projects by those
districts. Based on existing literature, a questionnaire was developed
related to six common maintenance practices. NMDOT district
personal were interviewed face to face to discuss and get answers to
that questionnaire. It revealed that NMDOT districts mainly use chip
seal and patching. Other maintenance procedures such as sand seal,
scrub seal, slurry seal, and thin overlay have limited use. Two out of
four participating districts do not have any documents on chip
sealing; rather they employ the experiences of the chip seal crew. All
districts use polymer modified high float emulsion (HFE100P) for
chip seal with an application rate ranging from 0.4 to 0.56 gallons per
square yard. Chip application rate varies from 15 to 40 lb/ square
yard. State wide, the thickness of chip seal varies from 3/8'' to 1'' and
life varies from 3 to 10 years. NMDOT districts mainly use three type
of patching: pothole, dig-out and blade patch. Pothole patches are
used for small potholes and during emergency, dig-out patches are
used for all type of potholes sometimes after pothole patching, and
blade patch is used when a significant portion of the pavement is
damaged. Pothole patches last as low as three days whereas, blade
patch lasts as long as 3 years. It was observed that all participating
districts use millings in maintenance projects.
Abstract: This research proposes Bee Algorithm (BA) to
optimize Ready Mixed Concrete (RMC) truck scheduling problem
from single batch plant to multiple construction sites. This problem is
considered as an NP-hard constrained combinatorial optimization
problem. This paper provides the details of the RMC dispatching
process and its related constraints. BA was then developed to
minimize total waiting time of RMC trucks while satisfying all
constraints. The performance of BA is then evaluated on two
benchmark problems (3 and 5construction sites) according to
previous researchers. The simulation results of BA are compared in
term of efficiency and accuracy with Genetic Algorithm (GA) and all
problems show that BA approach outperforms GA in term of
efficiency and accuracy to obtain optimal solution. Hence, BA
approach could be practically implemented to obtain the best
schedule.
Abstract: Distributed generation units (DGs) are grid-connected or stand-alone electric generation units located within the electric distribution system at or near the end user. It is generally accepted that centralized electric power plants will remain the major source of the electric power supply for the near future. DGs, however, can complement central power by providing incremental capacity to the utility grid or to an end user. This paper presents an efficient power dispatching model for hybrid wind-Solar power generation system, to satisfy some essential requirements, such as dispersed electric power demand, electric power quality and reducing generation cost and so on. In this paper, presented some elements of the main parts in the hybrid system; and then made fundamental dispatching strategies according to different situations; then pointed out four improving measures to improve genetic algorithm, such as: modify the producing way of selection probability, improve the way of crossover, protect excellent chromosomes, and change mutation range and so on. Finally, propose a technique for solving the unit's commitment for dispatching problem based on an improved genetic algorithm.
Abstract: In this paper, multi-processors job shop scheduling problems are solved by a heuristic algorithm based on the hybrid of priority dispatching rules according to an ant colony optimization algorithm. The objective function is to minimize the makespan, i.e. total completion time, in which a simultanous presence of various kinds of ferons is allowed. By using the suitable hybrid of priority dispatching rules, the process of finding the best solution will be improved. Ant colony optimization algorithm, not only promote the ability of this proposed algorithm, but also decreases the total working time because of decreasing in setup times and modifying the working production line. Thus, the similar work has the same production lines. Other advantage of this algorithm is that the similar machines (not the same) can be considered. So, these machines are able to process a job with different processing and setup times. According to this capability and from this algorithm evaluation point of view, a number of test problems are solved and the associated results are analyzed. The results show a significant decrease in throughput time. It also shows that, this algorithm is able to recognize the bottleneck machine and to schedule jobs in an efficient way.
Abstract: Economic Load Dispatch (ELD) is a method of determining
the most efficient, low-cost and reliable operation of a power
system by dispatching available electricity generation resources to
supply load on the system. The primary objective of economic
dispatch is to minimize total cost of generation while honoring
operational constraints of available generation resources. In this paper
an intelligent water drop (IWD) algorithm has been proposed to
solve ELD problem with an objective of minimizing the total cost of
generation. Intelligent water drop algorithm is a swarm-based natureinspired
optimization algorithm, which has been inspired from natural
rivers. A natural river often finds good paths among lots of possible
paths in its ways from source to destination and finally find almost
optimal path to their destination. These ideas are embedded into
the proposed algorithm for solving economic load dispatch problem.
The main advantage of the proposed technique is easy is implement
and capable of finding feasible near global optimal solution with
less computational effort. In order to illustrate the effectiveness of
the proposed method, it has been tested on 6-unit and 20-unit test
systems with incremental fuel cost functions taking into account the
valve point-point loading effects. Numerical results shows that the
proposed method has good convergence property and better in quality
of solution than other algorithms reported in recent literature.
Abstract: The process of wafer fabrication is arguably the most
technologically complex and capital intensive stage in semiconductor
manufacturing. This large-scale discrete-event process is highly reentrant,
and involves hundreds of machines, restrictions, and
processing steps. Therefore, production control of wafer fabrication
facilities (fab), specifically scheduling, is one of the most challenging
problems that this industry faces. Dispatching rules have been
extensively applied to the scheduling problems in semiconductor
manufacturing. Moreover, lot release policies are commonly used in
this manufacturing setting to further improve the performance of such
systems and reduce its inherent variability. In this work, simulation is
used in the scheduling of re-entrant flow shop manufacturing systems
with an application in semiconductor wafer fabrication; where, a
simulation model has been developed for the Intel Five-Machine Six
Step Mini-Fab using the ExtendTM simulation environment. The
Mini-Fab has been selected as it captures the challenges involved in
scheduling the highly re-entrant semiconductor manufacturing lines.
A number of scenarios have been developed and have been used to
evaluate the effect of different dispatching rules and lot release
policies on the selected performance measures. Results of simulation
showed that the performance of the Mini-Fab can be drastically
improved using a combination of dispatching rules and lot release
policy.
Abstract: Various intelligences and inspirations have been
adopted into the iterative searching process called as meta-heuristics.
They intelligently perform the exploration and exploitation in the
solution domain space aiming to efficiently seek near optimal
solutions. In this work, the bee algorithm, inspired by the natural
foraging behaviour of honey bees, was adapted to find the near
optimal solutions of the transportation management system, dynamic
multi-zone dispatching. This problem prepares for an uncertainty and
changing customers- demand. In striving to remain competitive,
transportation system should therefore be flexible in order to cope
with the changes of customers- demand in terms of in-bound and outbound
goods and technological innovations. To remain higher service
level but lower cost management via the minimal imbalance scenario,
the rearrangement penalty of the area, in each zone, including time
periods are also included. However, the performance of the algorithm
depends on the appropriate parameters- setting and need to be
determined and analysed before its implementation. BEE parameters
are determined through the linear constrained response surface
optimisation or LCRSOM and weighted centroid modified simplex
methods or WCMSM. Experimental results were analysed in terms
of best solutions found so far, mean and standard deviation on the
imbalance values including the convergence of the solutions
obtained. It was found that the results obtained from the LCRSOM
were better than those using the WCMSM. However, the average
execution time of experimental run using the LCRSOM was longer
than those using the WCMSM. Finally a recommendation of proper
level settings of BEE parameters for some selected problem sizes is
given as a guideline for future applications.
Abstract: Grid computing is growing rapidly in the distributed
heterogeneous systems for utilizing and sharing large-scale resources
to solve complex scientific problems. Scheduling is the most recent
topic used to achieve high performance in grid environments. It aims
to find a suitable allocation of resources for each job. A typical
problem which arises during this task is the decision of scheduling. It
is about an effective utilization of processor to minimize tardiness
time of a job, when it is being scheduled. This paper, therefore,
addresses the problem by developing a general framework of grid
scheduling using dynamic information and an ant colony
optimization algorithm to improve the decision of scheduling. The
performance of various dispatching rules such as First Come First
Served (FCFS), Earliest Due Date (EDD), Earliest Release Date
(ERD), and an Ant Colony Optimization (ACO) are compared.
Moreover, the benefit of using an Ant Colony Optimization for
performance improvement of the grid Scheduling is also discussed. It
is found that the scheduling system using an Ant Colony
Optimization algorithm can efficiently and effectively allocate jobs
to proper resources.
Abstract: Automated material handling is given prime
importance in the semi automated and automated facilities since it
provides solution to the gigantic problems related to inventory and
also support the latest philosophies like just in time production JIT
and lean production. Automated storage and retrieval system is an
antidote (if designed properly) to the facility sufferings like getting
the right material , materials getting perished, long cycle times or
many other similar kind of problems. A working model of automated
storage and retrieval system (AS/RS) is designed and developed
under the design parameters specified by Material Handling Industry
of America (MHIA). Later on analysis was carried out to calculate
the throughput and size of the machine. The possible implementation
of this technology in local scenario is also discussed in this paper.
Abstract: This article discusses the questions concerning of creating small packet networks for energy companies with application of high voltage power line carrier equipment (PLC) with functionality of IP traffic transmission. The main idea is to create converged PLC links between substations and dispatching centers where packet data and voice are transmitted in one data flow. The article contents description of basic conception of the network, evaluation of voice traffic transmission parameters, and discussion of header compression techniques in relation to PLC links. The results of exploration show us, that convergent packet PLC links can be very useful in the construction of small packet networks between substations in remote locations, such as deposits or low populated areas.