Search results for: advanced planning and scheduling

Authors: G. M. Komaki, S. Mobin, E. Teymourian, S. Sheikh

Abstract:

This paper addresses minimizing the makespan of the distributed permutation flow shop scheduling problem. In this problem, there are several parallel identical factories or flowshops each with series of similar machines. Each job should be allocated to one of the factories and all of the operations of the jobs should be performed in the allocated factory. This problem has recently gained attention and due to NP-Hard nature of the problem, metaheuristic algorithms have been proposed to tackle it. Majority of the proposed algorithms require large computational time which is the main drawback. In this study, a general variable neighborhood search algorithm (GVNS) is proposed where several time-saving schemes have been incorporated into it. Also, the GVNS uses the sophisticated method to change the shaking procedure or perturbation depending on the progress of the incumbent solution to prevent stagnation of the search. The performance of the proposed algorithm is compared to the state-of-the-art algorithms based on standard benchmark instances.

Keywords: distributed permutation flow shop, scheduling, makespan, general variable neighborhood search algorithm

Procedia PDF Downloads 330

Authors: F. Keller, G. Reinhart

Abstract:

The efficient and economic allocation of resources is one main goal in the field of production planning and control. Nowadays, a new variable gains in importance throughout the planning process: Energy. Energy-efficiency has already been widely discussed in literature, but with a strong focus on reducing the overall amount of energy used in production. This paper provides a brief systematic approach, how energy-supply-orientation can be used for an energy-cost-efficient production planning and thus combining the idea of energy-efficiency and energy-flexibility.

Keywords: production planning, production control, energy-efficiency, energy-flexibility, energy-supply

Procedia PDF Downloads 610

Authors: Sanat Ramesh, Tarun Dutt, Abhilasha Aswal, Anushka Chandrababu, G. N. Srinivasa Prasanna

Abstract:

Optimal Schedule Generation for a large national railway network operating thousands of passenger trains with tens of thousands of kilometers of track is a grand computational challenge in itself. We present heuristics based on a Mixed Integer Program (MIP) formulation for local optimization. These methods provide flexibility in scheduling new trains with varying speed and delays and improve utilization of infrastructure. We propose methods that provide a robust solution with hundreds of trains being scheduled over a portion of the railway network without significant increases in delay. We also provide techniques to validate the nominal schedules thus generated over global correlated variations in travel times thereby enabling us to detect conflicts arising due to delays. Our validation results which assume only the support of the arrival and departure time distributions takes an order of few minutes for a portion of the network and is computationally efficient to handle the entire network.

Keywords: mixed integer programming, optimization, railway network, train scheduling

Procedia PDF Downloads 131

Authors: Emrehan Ozcan, Dilek Beyazlı

Abstract:

The development of tourism depends on an accurate planning approach as well as on the right planning process. This dependency is also a key factor in ensuring sustainability of tourism. The types of tourism, social expectations, planning practice, the socio-economic and the cultural structure of the region are determinants of planning approaches for tourism development. The tourism plans prepared for the historic city centers are usually based on the revitalization of cultural and historical values. The preservation and development of the tourism potentials of the historic city centers are important for providing an economic contribution to the locality, creating livable solutions for local residents and also the sustainability of tourism. This research is about experiencing and discussing a planning approach that will provide tourism development based on historical and cultural values. Historical and cultural values in the historical city center of Trabzon -which has a settlement history of approximately 4000 years, is located on the Black Sea coast of Turkey- wear out over years and lose their tourism potential. A planning study has been experienced with strategic spatial planning approach for Trabzon, which has not done a tourism-oriented planning study until now. The stages of the planning process provided by strategic spatial planning approach are an assessment of the current situation; vision, strategies, and actions; action planning; designing and implementation of actions and monitoring-evaluation. In the discussion section, the advantages, planning process, methods and techniques of the approach are discussed for the possibilities and constraints in terms of tourism planning. In this context, it is aimed to put forth tourism planning process, stages, and implementation tools within the scope of strategic spatial planning approach by comparing approaches used in the tourism-oriented/priority planning of historical city centers. Suggestions on the position and effect of the preferred planning approach in the existing spatial planning practice are the outputs of the study.

Keywords: cultural heritage, tourism oriented planning, Trabzon, strategic spatial Planning

Procedia PDF Downloads 233

Authors: H. S. Kumara

Abstract:

The rapid process of urbanization and the growing number of the metropolitan cities and its region call for better governance in India. This article attempts to argue that spatial planning really matters for measuring the governance at metropolitan scale. These study explore to metropolitan governance and spatial planning and its interrelationship issues, concepts and evolution of spatial planning in India and critically examines the multi actors’ scenario for measuring metropolitan governance by means of spatial planning in context with reviewing various master plans, concept of multi-actors viewpoint on role of spatial planning related to zoning regulations, master plan implementations and effective service delivery issues. This paper argues and concludes that the spatial planning of Bangalore directly impact on measuring metropolitan governance.

Keywords: metropolitan governance, spatial planning, service delivery, multi-actors’, opinion survey, master plan

Procedia PDF Downloads 566

Authors: Sina Saadati

Abstract:

Multiprocessors Systems-On-Chips (MPSOCs) are used widely on modern computers to execute sophisticated software and applications. These systems include different processors for distinct aims. Most of the proposed task schedulers attempt to improve energy consumption. In some schedulers, the processor's temperature is considered to increase the system's reliability and performance. In this research, we have proposed a new method for thermal-aware task scheduling which is based on an artificial neural network (ANN). This method enables us to consider a variety of factors in the scheduling process. Some factors like ambient temperature, season (which is important for some embedded systems), speed of the processor, computing type of tasks and have a complex relationship with the final temperature of the system. This Issue can be solved using a machine learning algorithm. Another point is that our solution makes the system intelligent So that It can be adaptive. We have also shown that the computational complexity of the proposed method is cheap. As a consequence, It is also suitable for battery-powered systems.

Keywords: task scheduling, MOSOC, artificial neural network, machine learning, architecture of computers, artificial intelligence

Procedia PDF Downloads 72

Authors: Elzbieta Sikorska-Simmons

Abstract:

Dementia is a progressive terminal disease. Despite this recognition, research shows that most family caregivers do not know it, and it is unclear how this knowledge affects the quality of patient care. The aim of this qualitative study of 20 family caregivers for patients with advanced dementia is to examine how the caregiver's knowledge about dementia affects the quality of patient care in the context of healthcare decision-making, advanced care planning, and access to adequate support systems. Knowledge about dementia implies family caregivers' understanding of dementia trajectories, common symptoms/complications, and alternative treatment options (e.g., comfort feeding versus tube feeding). Data were collected in semi-structured interviews with 20 family caregivers. The interviews were conducted in person by the author and designed to elicit rich descriptions of family caregivers' experiences with healthcare decision-making and the management of common symptoms/complications of end-stage dementia as patient healthcare proxies. The study findings suggest that caregivers who recognize that dementia is a terminal disease are less likely to opt for life-extending treatments during the advanced stages. They are also more likely to seek palliative/hospice care, and consequently, they are better able to avoid unnecessary hospitalizations or medical procedures. For example, those who know that dementia is a terminal disease tend to opt for "comfort feeding" rather than "tube feeding" in managing the swallowing difficulties that accompany advanced dementia. In the context of advance care planning, family caregivers who know that dementia is a terminal disease tend to have more meaningful advance directives (e.g., Power of Attorney and Do Not Resuscitate orders). They are better prepared to anticipate common problems and pursue treatments that foster the best quality of patient life and care. Greater knowledge about advanced dementia helps them make more informed decisions that focus on enhancing the quality of patient life rather than just survival. In addition, those who know that dementia is a terminal disease are more likely to establish adequate support systems to help them cope with the complex demands of caregiving. For example, they are more likely to seek dementia-oriented primary care programs that offer house visits or respite services. Based on the study findings, knowledge about dementia as a terminal disease is critical in the optimal management of patient care needs and the establishment of adequate support systems. More research is needed to better understand what caregivers need to know to better prepare them for the complex demands of dementia caregiving.

Keywords: dementia education, family caregiver, management of dementia, quality of care

Procedia PDF Downloads 70

Authors: In Su Na, Dongyeon Seo, Hwanyong Kim

Abstract:

This research focuses on new town planning methodology in aspects of Neighborhood Unit Formula and New Urbanism. In Korea, there were built many new towns since 1980’s. The urban design concepts also shifted variously in land use, transportation, open spaces and architectural design. This research aims to find out urban design planning and factors in each new town planning through comparison of four new town cases in aspects of land use, transportation and building design of metropolitan area of Seoul. In conclusion the recent new town has created an area with a unique place that has not been seen in the early new town, and it has a certain aspect that is in line with the planning principles of New Urbanism.

Keywords: compact city, neighborhood unit formula, new town planning, new urbanism

Procedia PDF Downloads 274

Authors: Nur Aidya Hanum Aizam, Vikneswary Uvaraja

Abstract:

The agenda of showing the scheduled time for performing certain tasks is known as timetabling. It widely used in many departments such as transportation, education, and production. Some difficulties arise to ensure all tasks happen in the time and place allocated. Therefore, many researchers invented various programming model to solve the scheduling problems from several fields. However, the studies in developing the general integer programming model for many timetabling problems are still questionable. Meanwhile, this thesis describe about creating a general model which solve different types of timetabling problems by considering the basic constraints. Initially, the common basic constraints from five different fields are selected and analyzed. A general basic integer programming model was created and then verified by using the medium set of data obtained randomly which is much similar to realistic data. The mathematical software, AIMMS with CPLEX as a solver has been used to solve the model. The model obtained is significant in solving many timetabling problems easily since it is modifiable to all types of scheduling problems which have same basic constraints.

Keywords: AIMMS mathematical software, integer linear programming, scheduling problems, timetabling

Procedia PDF Downloads 406

Authors: Rajamani Doraiswami, Lahouari Cheded

Abstract:

Fault diagnosis of Linear Parameter-Varying (LPV) system using an adaptive Kalman filter is proposed. The LPV model is comprised of scheduling parameters, and the emulator parameters. The scheduling parameters are chosen such that they are capable of tracking variations in the system model as a result of changes in the operating regimes. The emulator parameters, on the other hand, simulate variations in the subsystems during the identification phase and have negligible effect during the operational phase. The nominal model and the influence vectors, which are the gradient of the feature vector respect to the emulator parameters, are identified off-line from a number of emulator parameter perturbed experiments. A Kalman filter is designed using the identified nominal model. As the system varies, the Kalman filter model is adapted using the scheduling variables. The residual is employed for fault diagnosis. The proposed scheme is successfully evaluated on simulated system as well as on a physical process control system.

Keywords: identification, linear parameter-varying systems, least-squares estimation, fault diagnosis, Kalman filter, emulators

Procedia PDF Downloads 472

Authors: Vijay Shankar

Abstract:

In the era of water scarcity, effective use of water via irrigation requires good methods for determining crop water needs. Implementation of irrigation scheduling programs requires an accurate estimate of water use by the crop. Moisture depletion from the root zone represents the consequent crop evapotranspiration (ET). A numerical model for simulating soil water depletion in the root zone has been developed by taking into consideration soil physical properties, crop and climatic parameters. The governing differential equation for unsaturated flow of water in the soil is solved numerically using the fully implicit finite difference technique. The water uptake by plants is simulated by using three different sink functions. The non-linear model predictions are in good agreement with field data and thus it is possible to schedule irrigations more effectively. The present paper describes irrigation scheduling based on moisture depletion from the different layers of the root zone, obtained using different sink functions for three cash, oil and forage crops: cotton, safflower and barley, respectively. The soil is considered at a moisture level equal to field capacity prior to planting. Two soil moisture regimes are then imposed for irrigated treatment, one wherein irrigation is applied whenever soil moisture content is reduced to 50% of available soil water; and other wherein irrigation is applied whenever soil moisture content is reduced to 75% of available soil water. For both the soil moisture regimes it has been found that the model incorporating a non-linear sink function which provides best agreement of computed root zone moisture depletion with field data, is most effective in scheduling irrigations. Simulation runs with this moisture uptake function result in saving 27.3 to 45.5% & 18.7 to 37.5%, 12.5 to 25% % &16.7 to 33.3% and 16.7 to 33.3% & 20 to 40% irrigation water for cotton, safflower and barley respectively, under 50 & 75% moisture depletion regimes over other moisture uptake functions considered in the study. Simulation developed can be used for an optimized irrigation planning for different crops, choosing a suitable soil moisture regime depending upon the irrigation water availability and crop requirements.

Keywords: irrigation water, evapotranspiration, root uptake models, water scarcity

Procedia PDF Downloads 303

Authors: Sina Keyhanian, Abbas Ahmadi, Behrooz Karimi

Abstract:

We present a multi-objective binary programming model which considers surgical cases are scheduling among operating rooms and the configuration of surgical instruments in limited capacity hospital trays, simultaneously. Many mathematical models have been developed previously in the literature addressing different challenges in health-care logistics such as assigning operating rooms, leveling beds, etc. But what happens inside the operating rooms along with the inventory management of required instruments for various operations, and also their integration with surgical scheduling have been poorly discussed. Our model considers the minimization of movements between trays during a surgery which recalls the famous cell formation problem in group technology. This assumption can also provide a major potential contribution to robotic surgeries. The tray configuration problem which consumes surgical instruments requirement plan (SIRP) and sequence of surgical procedures based on required instruments (SIRO) is nested inside the bin packing problem. This modeling approach helps us understand that most of the same-output solutions will not be necessarily identical when it comes to the rearrangement of surgeries among rooms. A numerical example has been dealt with via a proposed nested simulated annealing (SA) optimization approach which provides insights about how various configurations inside a solution can alter the optimal condition.

Keywords: health-care logistics, hospital tray configuration, off-line bin packing, simulated annealing optimization, surgical case scheduling

Procedia PDF Downloads 247

Authors: Yu-Jen Chang, Yun Chen, Hei-Lam Wong

Abstract:

The Economic Lot Scheduling Problem (ELSP) is a valuable mathematical model that can support decision-makers to make scheduling decisions. The basic period approach is effective for solving the ELSP. The assumption for applying the basic period approach is that a product must use its maximum production rate to be produced. However, a product can lower its production rate to reduce the average total cost when a facility has extra idle time. The past researches discussed how a product adjusts its production rate under the common cycle approach. To the best of our knowledge, no studies have addressed how a product lowers its production rate under the basic period approach. This research is the first paper to discuss this topic. The research develops a simple fixed rate approach that adjusts the production rate of a product under the basic period approach to solve the ELSP. Our numerical example shows our approach can find a better solution than the traditional basic period approach. Our mathematical model that applies the fixed rate approach under the basic period approach can serve as a reference for other related researches.

Keywords: economic lot, basic period, genetic algorithm, fixed rate

Procedia PDF Downloads 538

Authors: Victor Emeli, Akansel Cosgun

Abstract:

This paper explores the navigation among movable obstacles (NAMO) problem and proposes joint path and push planning: which path to take and in what direction the obstacles should be pushed at, given a start and goal position. We present a planning algorithm for selecting a path and the obstacles to be pushed, where a rapidly-exploring random tree (RRT)-based heuristic is employed to calculate a minimal collision path. When it is necessary to apply a pushing force to slide an obstacle out of the way, the planners leverage means-end analysis through a dynamic physics simulation to determine the sequence of linear pushes to clear the necessary space. Simulation experiments show that our approach finds solutions in higher clutter percentages (up to 49%) compared to the straight-line push planner (37%) and RRT without pushing (18%).

Keywords: motion planning, path planning, push planning, robot navigation

Procedia PDF Downloads 142

Authors: T. Mersmann, P. Nyhuis

Abstract:

In the current economic climate, for many businesses it is generally no longer sufficient to pursue exclusively economic interests. Instead, integrating ecological and social goals into the corporate targets is becoming ever more important. However, the holistic integration of these new goals is missing from current factory planning approaches. This article describes the conceptual framework for a planning methodology for sustainable factories. To this end, the description of the key areas for action is followed by a description of the principal components for the systematization of sustainability for factories and their stakeholders. Finally, a conceptual framework is presented which integrates the components formulated into an established factory planning procedure.

Keywords: factory planning, stakeholder, systematization, sustainability

Procedia PDF Downloads 425

Authors: Ya-Hui Lee, Chien-Hung Hsieh, Ching-Yi Lu

Abstract:

Demographic aging is the major problem that Taiwanese society is facing, and retirement life adaptation is the most concerning issue. In recent years, studies have suggested that in order to have successful aging and retirement planning, a view for the future is necessary. In Taiwan, civil servants receive better pensions and retirement benefits than do other industries. Therefore, their retirement preparation is considerably more significant than other senior groups in Taiwan. The purpose of this study is to understand the correlation of proactive coping and retirement planning of senior civil servants in Taiwan. The method is conducted by questionnaire surveys, with 342 valid questionnaires collected. The results of this study are: 1. The background variables of the interviewees, including age, perceived economic statuses, and retirement statuses, are all significantly related to their proactive coping and retirement planning. 2. Regarding age, the interviewees with ages 55 and above have better proactive coping and retirement planning than those with ages 45 and below. 3. In the aspect of perceived economic statuses, the participants who feel “very good” economic statuses have better proactive coping ability and retirement readiness than those who feel “bad” and “very bad”. 4. Retirees have better proactive coping and retirement planning than those who are still working. 5. Monthly income is significant in retirement planning only. The participants’ retirement planning would be better if they have higher incomes. Furthermore, the participants’ retirement planning would be better if their revenue were €1453~€1937, than if their revenue were below €968. 6. There are positive correlations between proactive coping and retirement planning. 7. Proactive coping can predict retirement planning. The result of this study will be provided as references to the Taiwan government for educational retirement planning policies.

Keywords: proactive coping, retirement planning, civil servants, demographic aging

Procedia PDF Downloads 408

Authors: Sven Tackenberg, Sönke Duckwitz, Andreas Petz, Christopher M. Schlick

Abstract:

This paper introduces an extension to the well-established Resource-Constrained Project Scheduling Problem (RCPSP) to apply it to complex maintenance problems. The problem is to assign technicians to a team which has to process several tasks with multi-level skill requirements during a work shift. Here, several alternative activities for a task allow both, the temporal shift of activities or the reallocation of technicians and tools. As a result, switches from one valid work process variant to another can be considered and may be selected by the developed evolutionary algorithm based on the present skill level of technicians or the available tools. An additional complication of the observed scheduling problem is that the locations of the construction sites are only temporarily accessible during a day. Due to intensive rail traffic, the available time slots for maintenance and repair works are extremely short and are often distributed throughout the day. To identify efficient working periods, a first concept of a Bayesian network is introduced and is integrated into the extended RCPSP with pre-emptive and non-pre-emptive tasks. Thereby, the Bayesian network is used to calculate the probability of a maintenance task to be processed during a specific period of the shift. Focusing on the domain of maintenance of the railway infrastructure in metropolitan areas as the most unproductive implementation process at construction site, the paper illustrates how the extended RCPSP can be applied for maintenance planning support. A multi-criteria evolutionary algorithm with a problem representation is introduced which is capable of revising technician-task allocations, whereas the duration of the task may be stochastic. The approach uses a novel activity list representation to ensure easily describable and modifiable elements which can be converted into detailed shift schedules. Thereby, the main objective is to develop a shift plan which maximizes the utilization of each technician due to a minimization of the waiting times caused by rail traffic. The results of the already implemented core algorithm illustrate a fast convergence towards an optimal team composition for a shift, an efficient sequence of tasks and a high probability of the subsequent implementation due to the stochastic durations of the tasks. In the paper, the algorithm for the extended RCPSP is analyzed in experimental evaluation using real-world example problems with various size, resource complexity, tightness and so forth.

Keywords: maintenance management, scheduling, resource constrained project scheduling problem, genetic algorithms

Procedia PDF Downloads 206

Authors: Zhao Liu, Kang Cao

Abstract:

Strategic spatial planning, which is taken as an effective and competitive way for the governors of the city to improve the development and management level of a city, has been blooming in recent years all over the world. In the context of globalization and informatization, strategic spatial planning must transfer its focus on three different levels: global, regional and urban. Internal and external changes in environmental conditions lead to new advances in strategic planning both theoretically and practically. However, such advances or changes respond differently to cities on account of different dynamic mechanisms. This article aims at two cities of Tianjin in China and Melbourne in Australia, through a comparative study on strategic planning, to explore the differentiation of mechanisms in urban planning. By comparison and exploration, the purpose of this article is to exhibit two different planning worlds, western and Chinese, in a new way. The article can be divided into four parts. The first part outlines strategic planning transformations in the new era on three levels, generally analysing the internal and external environmental factors of today. The second part indicates the concepts of strategic planning theoretically, demonstrating briefly its development background and process in western and China, respectively. The third part takes Tianjin and Melbourne urban strategic spatial planning as examples to mainly carry on the contrast research from the aspects of strategic planning mode, competitive mechanism, contents, strategy implementation and management. It is expected to summarize the differences and similarities of the two plans, meanwhile, to explore the inherent factors or mechanisms probably spatial, material, political and etc., which affect cities in the course of urban planning. The final part is a summary of general mechanisms of planning from the perspective of strategic spatial planning.

Keywords: differentiation, strategic planning, Melbourne, Australia, Tianjin, China

Procedia PDF Downloads 493

Authors: Ignatio Madanhire, Charles Mbohwa

Abstract:

This study looks at the best model of aggregate planning activity in an industrial entity and uses the trial and error method on spreadsheets to solve aggregate production planning problems. Also linear programming model is introduced to optimize the aggregate production planning problem. Application of the models in a furniture production firm is evaluated to demonstrate that practical and beneficial solutions can be obtained from the models. Finally some benchmarking of other furniture manufacturing industries was undertaken to assess relevance and level of use in other furniture firms

Keywords: aggregate production planning, trial and error, linear programming, furniture industry

Procedia PDF Downloads 520

Authors: Dereje Habte, Jane Namasasu

Abstract:

Background: The aim of the analysis was to assess the practice of family planning (FP) among HIV-infected women and the influence of women’s awareness of HIV-positive status in the practice of FP. Methods: The analysis was made among 489 non-pregnant, sexually active, fecund women living with HIV. Result: Of the 489 confirmed HIV positive women, 184 (37.6%) reported that they knew they are HIV positive. The number of women with current use and unmet need of any family planning method were found to be 251 (51.2%) and 107 (21.9%) respectively. Women’s knowledge of HIV-positive status (AOR: 2.32(1.54,3.50)), secondary and above education (AOR: 2.36(1.16,4.78)), presence of 3-4 (AOR: 2.60(1.08,6.28)) and more than four alive children (AOR: 3.03(1.18,7.82)) were significantly associated with current use of family planning. Conclusion: Women’s awareness of HIV-positive status was found to significantly predict family planning practice among women living with HIV.

Keywords: family planning, HIV, Malawi, women

Procedia PDF Downloads 569

Authors: Rui Wu

Abstract:

In the volatile modern manufacturing environment, new orders randomly occur at any time, while the pre-emptive methods are infeasible. This leads to a real-time scheduling method that can produce a reasonably good schedule quickly. The dynamic Flexible Job Shop problem is an NP-hard scheduling problem that hybrid the dynamic Job Shop problem with the Parallel Machine problem. A Flexible Job Shop contains different work centres. Each work centre contains parallel machines that can process certain operations. Many algorithms, such as genetic algorithms or simulated annealing, have been proposed to solve the static Flexible Job Shop problems. However, the time efficiency of these methods is low, and these methods are not feasible in a dynamic scheduling problem. Therefore, a dynamic rule selection scheduling system based on the reinforcement learning method is proposed in this research, in which the dynamic Flexible Job Shop problem is divided into several parallel machine problems to decrease the complexity of the dynamic Flexible Job Shop problem. Firstly, the features of jobs, machines, work centres, and flexible job shops are selected to describe the status of the dynamic Flexible Job Shop problem at each decision point in each work centre. Secondly, a framework of reinforcement learning algorithm using a double-layer deep Q-learning network is applied to select proper composite dispatching rules based on the status of each work centre. Then, based on the selected composite dispatching rule, an available operation is selected from the waiting buffer and assigned to an available machine in each work centre. Finally, the proposed algorithm will be compared with well-known dispatching rules on objectives of mean tardiness, mean flow time, mean waiting time, or mean percentage of waiting time in the real-time Flexible Job Shop problem. The result of the simulations proved that the proposed framework has reasonable performance and time efficiency.

Keywords: dynamic scheduling problem, flexible job shop, dispatching rules, deep reinforcement learning

Procedia PDF Downloads 75

Authors: Divya Agarwal, Pushpendra S. Bharti

Abstract:

Autonomous mobile robots (AMR) are expected as smart tools for operations in every automation industry. Path planning and obstacle avoidance is the backbone of AMR as robots have to reach their goal location avoiding obstacles while traversing through optimized path defined according to some criteria such as distance, time or energy. Path planning can be classified into global and local path planning where environmental information is known and unknown/partially known, respectively. A number of sensors are used for data collection. A number of algorithms such as artificial potential field (APF), rapidly exploring random trees (RRT), bidirectional RRT, Fuzzy approach, Purepursuit, A* algorithm, vector field histogram (VFH) and modified local path planning algorithm, etc. have been used in the last three decades for path planning and obstacle avoidance for AMR. This paper makes an attempt to review some of the path planning and obstacle avoidance algorithms used in the field of AMR. The review includes comparative analysis of simulation and mathematical computations of path planning and obstacle avoidance algorithms using MATLAB 2018a. From the review, it could be concluded that different algorithms may complete the same task (i.e. with a different set of instructions) in less or more time, space, effort, etc.

Keywords: path planning, obstacle avoidance, autonomous mobile robots, algorithms

Procedia PDF Downloads 201

Authors: Ajit Rai, Hamza Deroui, Blandine Vacher, Khwansiri Ninpan, Arthur Aumont, Francesco Vitillo, Robert Plana

Abstract:

Large-scale critical industrial scheduling problems are based on Resource-Constrained Project Scheduling Problems (RCPSP), that necessitate integration with other optimization problems (e.g., vehicle routing, supply chain, or unique industrial ones), thus requiring practical solutions (i.e., modular, computationally efficient with feasible solutions). To the best of our knowledge, the current industrial state of the art is not addressing this holistic problem. We propose an original modular solution that answers the issues exhibited by the delivery of complex projects. With three interlinked entities (project, task, resources) having their constraints, it uses a greedy heuristic with a dynamic cost function for each task with a situational assessment at each time step. It handles large-scale data and can be easily integrated with other optimization problems, already existing industrial tools and unique constraints as required by the use case. The solution has been tested and validated by domain experts on three use cases: outage management in Nuclear Power Plants (NPPs), planning of future NPP maintenance operation, and application in the defense industry on supply chain and factory relocation. In the first use case, the solution, in addition to the resources’ availability and tasks’ logical relationships, also integrates several project-specific constraints for outage management, like, handling of resource incompatibility, updating of tasks priorities, pausing tasks in a specific circumstance, and adjusting dynamic unit of resources. With more than 20,000 tasks and multiple constraints, the solution provides a feasible schedule within 10-15 minutes on a standard computer device. This time-effective simulation corresponds with the nature of the problem and requirements of several scenarios (30-40 simulations) before finalizing the schedules. The second use case is a factory relocation project where production lines must be moved to a new site while ensuring the continuity of their production. This generates the challenge of merging job shop scheduling and the RCPSP with location constraints. Our solution allows the automation of the production tasks while considering the rate expectation. The simulation algorithm manages the use and movement of resources and products to respect a given relocation scenario. The last use case establishes a future maintenance operation in an NPP. The project contains complex and hard constraints, like on Finish-Start precedence relationship (i.e., successor tasks have to start immediately after predecessors while respecting all constraints), shareable coactivity for managing workspaces, and requirements of a specific state of "cyclic" resources (they can have multiple states possible with only one at a time) to perform tasks (can require unique combinations of several cyclic resources). Our solution satisfies the requirement of minimization of the state changes of cyclic resources coupled with the makespan minimization. It offers a solution of 80 cyclic resources with 50 incompatibilities between levels in less than a minute. Conclusively, we propose a fast and feasible modular approach to various industrial scheduling problems that were validated by domain experts and compatible with existing industrial tools. This approach can be further enhanced by the use of machine learning techniques on historically repeated tasks to gain further insights for delay risk mitigation measures.

Keywords: deterministic scheduling, optimization coupling, modular scheduling, RCPSP

Procedia PDF Downloads 155

Authors: Pruthvi Nath Palleti, Sarmada Madhulika Kone

Abstract:

Communities are formed based on the commonalities that exist in a set of individuals and when the group comes together on identifying those commonalities and to achieve their common goals. Thus, community planning with its vision to strengthen the community mostly involves with making or remaking of commons, which results in making or remaking of communities. This paper looks into different practices of planning around the world and tried to establish a link between commoning (the act of exercising the rights over commons by commoners) and participatory approach to community planning.

Keywords: commoners, commoning, community, participatory planning, urban local bodies

Procedia PDF Downloads 346

Authors: Carolina Silva, João Nuno Oliveira, Rui Sousa, João Paulo Silva

Abstract:

This study uses genetic algorithms to solve a job scheduling problem in a weaving factory. The underline problem regards an NP-Hard problem concerning unrelated parallel machines, with sequence-dependent setup times. This research uses real data regarding a weaving industry located in the North of Portugal, with a capacity of 96 looms and a production, on average, of 440000 meters of fabric per month. Besides, this study includes a high level of complexity once most of the real production constraints are applied, and several real data instances are tested. Topics such as data analyses and algorithm performance are addressed and tested, to offer a solution that can generate reliable and due date results. All the approaches will be tested in the operational environment, and the KPIs monitored, to understand the solution's impact on the production, with a particular focus on the total number of weeks of late deliveries to clients. Thus, the main goal of this research is to develop a solution that allows for the production of automatically optimized production plans, aiming to the tardiness minimizing.

Keywords: genetic algorithms, textile industry, job scheduling, optimization

Procedia PDF Downloads 125

Authors: Brahmia Nadjet

Abstract:

The growing needs of displacements led advanced countries in this field install new specific transport systems, able to palliate any deficiencies, especially when regular public transport does not adequately meet the requests of users. In this context, on-demand transport systems (ODT) are very efficient; they rely on techniques based on the location of trip generators which should be assured effectively with the use of operators responsible of the advance reservation, planning and organization, and studying the different ODT criteria (organizational, technical, geographical, etc.). As the advanced countries in the field of transport, some developing countries are involved in the adaptation of the new technologies to reduce the deficit in their communication system. This communication presents the study of an ODT implementation in the west of Algeria, by developing the Geomatics side of the study. This part requires the use of specific systems (such as GIS, RDBMS), so we developed the process through an application in an environment of mobility by using the computer tools dedicated to the management of the entities related to the transport field.

Keywords: ODT, geomatics, GIS, transport systems

Procedia PDF Downloads 474

Authors: Ali Cheshmehzangi, Ayotunde Dawodu

Abstract:

In urban planning, Floor Area Ratio (FAR) of the site plays a major role in the multiplicity of performances, from humane living environments to energy performance. When one considers the astounding volume of new housing that is going to be constructed across the globe during the next few decades due to growing urbanisation (e.g. particularly in developing world), it is imperative that we have an empirically grounded grasp of which building configurations are more energy efficient. As a common planning metric, it would be helpful to know exactly how managing FAR connects with energy efficiency. Hence, this study puts together a set of modelling of various FARs for a typical residential compound and address the considerations of energy planning integration in the practice of building configuration and urban planning. Such decision makings at the planning and design stage enable us to provide pathways of optimising urban climate at mesoscale of the built environment, i.e. the neighbourhood or community level. In this study, a comparative study is conducted using Eco-Tect Software, using a case study in the City of Ningbo, China. Findings of the study contribute to identifying scenarios of various FAR use and energy planning at mesoscale. The final results contribute to studies in urban climate, from the perspectives of urban planning, energy planning, and urban modelling.

Keywords: China, energy planning, FAR, floor-area-ratio, mesoscale, urban climate, urban modelling

Procedia PDF Downloads 136

Authors: Jihoon Lim, Patrick Kirchen, Ryozo Nagamune

Abstract:

This paper proposes a linear parameter-varying (LPV) controller capable of reducing nitrogen oxide (NOx) emissions with low ammonia (NH3) slip downstream of selective catalytic reduction (SCR) systems. SCR systems are widely adopted in diesel engines due to high NOx conversion efficiency. However, the nonlinearity of the SCR system and sensor uncertainty result in a challenging control problem. In order to overcome the control challenges, an LPV controller is proposed based on gain-scheduling parameters, that is, exhaust gas temperature and exhaust gas flow rate. Based on experimentally obtained data under the non-road transient driving cycle (NRTC), the simulations firstly show that the proposed controller yields high NOx conversion efficiency with a desired low NH3 slip. The performance of the proposed LPV controller is then compared with other controllers, including a gain-scheduling PID controller and a sliding mode controller. Additionally, the robustness is also demonstrated using the uncertainties ranging from 10 to 30%. The results show that the proposed controller is robustly stable under uncertainties.

Keywords: diesel engine, gain-scheduling control, linear parameter-varying, selective catalytic reduction

Procedia PDF Downloads 123

Authors: Nadjet Brahmia

Abstract:

The growing needs of displacements led advanced countries in this field install new specific transport systems, able to palliate any deficiencies, especially when regular public transport does not adequately meet the requests of users. In this context, on-demand transportation (ODT) are very efficient; they rely on techniques based on the location of trip generators which should be assured effectively with the use of operators responsible of the advance reservation, planning and organization, and studying the different ODT criteria (organizational, technical, geographical, etc.). As the advanced countries in the field of transport, some developing countries are involved in the adaptation of the new technologies to reduce the deficit in their communication system. This communication presents the study of an ODT implementation in the west of Algeria, by developing the Geomatics side of the study. This part requires the use of specific systems (such as GIS, RDBMS…), so we developed the process through an application in an environment of mobility by using the computer tools dedicated to the management of the entities related to the transport field.

Keywords: ODT, geomatics, GIS, transport systems

Procedia PDF Downloads 527

Authors: Roland Lachmayer, Mahtab Afsari

Abstract:

Research is the cornerstone for advancement of human communities. So that it is one of the indexes for evaluating advancement of countries. Research projects are usually cost and time-consuming and do not end in result in short term. Project scheduling is one of the integral parts of project management. The present article offers a new method by using C# and Matlab software to solve Fuzzy GERT networks for Exclusive-OR kind of nodes to schedule the network. In this article we concentrate on flowcharts that we used in Matlab to show how we apply Matlab to schedule Exclusive-OR nodes.

Keywords: research projects, fuzzy GERT, fuzzy CPM, CPM, α-cuts, scheduling

Procedia PDF Downloads 364