Filters








191,483 Hits in 6.0 sec

Procedural Modeling of Residential Zone Subject to Urban Planning Constraints [chapter]

Liying Wang, Wei Hua, Hujun Bao
2007 Lecture Notes in Computer Science  
The approach represents design goals as cost function subject to planning constraints. We can obtain the design plan by minimizing the objective function.  ...  In this paper taking the layout problems of a residential zone as background, a framework of procedural modeling and a constrained layout optimization approach is presented to simulate the design procedure  ...  The approach represents design goals as cost function subject to planning constraints. The idea mainly comes from iterative adjustment and redesign during human design.  ... 
doi:10.1007/978-3-540-74873-1_19 fatcat:xjk6xoqssbaclcmseqdxa2o4ru

A Literature Survey on Various Factors in Dynamic Cellular Manufacturing System

S.M. Saleemuddin, Sanjeev Reddy K. Hudgikar
2017 IOSR Journal of Mechanical and Civil Engineering  
In previous work manufacturing companies has faces a lot of problems in meeting the customer requirement in dynamic conditions.  ...  This paper gives the brief review about the work which was focused on all published paper on this subject.  ...  , cell formation (CF) problem considered to minimize the production cost.  ... 
doi:10.9790/1684-1403059396 fatcat:tg464nnkhngoflz7eey6bbzji4

Sensitivity analysis and comparison of algorithms in preventive maintenance and replacement scheduling optimization models

Kamran S. Moghaddam, John S. Usher
2011 Computers & industrial engineering  
The objective is to determine a plan of actions for each component in the system while minimizing the total cost and maximizing overall system reliability over the planning horizon.  ...  In addition, a comprehensive experiment is designed to analyze and compare the efficiency and accuracy of the exact and metaheuristic algorithms.  ...  The objective is to determine a plan of actions for each component in the system while minimizing the total cost and maximizing overall system reliability over the planning horizon.  ... 
doi:10.1016/j.cie.2011.02.012 fatcat:vzyfvyczb5gqtkvsjjgpor2khy

Automatic Game Design via Mechanic Generation [article]

Alexander Zook, Mark O. Riedl
2019 arXiv   pre-print
We use a constraint solver to generate mechanics subject to design requirements on the form of those mechanics---what they do in the game.  ...  Game designs often center on the game mechanics---rules governing the logical evolution of the game. We seek to develop an intelligent system that generates computer games.  ...  New design requirements may control the amount of change to make to a set of mechanics. The defini-tion of 'minimal change' varies by game domain and must be specified to adapt mechanics.  ... 
arXiv:1908.01420v1 fatcat:lmix66x6szgzjhefxh3z2frnua

Line planning in public transportation: models and methods

Anita Schöbel
2011 OR spectrum  
The goal of the optimization process is on the one hand, to offer a high quality of service for the passengers while, on the other hand, the costs for setting up and running the transit system should be  ...  This leads to a variety of different published line planning models.  ...  The goal of this work was to determine lines that minimize the operational costs subject to service constraints and capacity requirements.  ... 
doi:10.1007/s00291-011-0251-6 fatcat:52fe7j2rz5d2nis6cnax4b2xbe

An efficient surrogate subgradient method within Lagrangian relaxation for the Payment Cost Minimization problem

M. A. Bragin, P. B. Luh, J. H. Yan, Nanpeng Yu, Xu Han, G. A. Stern
2012 2012 IEEE Power and Energy Society General Meeting  
1 -Studies have shown that for a given set of bids, Payment Cost Minimization leads to lower customer payments as compared to Bid Cost Minimization.  ...  This paper develops an efficient methodology to solve Payment Cost Minimization using the surrogate optimization framework and the branch-and-cut method.  ...  In the Payment Cost Minimization problem, the total customer payment cost is minimized subject to the system demand, start-up cost and the market-clearing price constraints.  ... 
doi:10.1109/pesgm.2012.6345529 fatcat:uoz2qxjjnbf5rd43c34ahixlme

Page 1054 of The Journal of the Operational Research Society Vol. 47, Issue 8 [page]

1996 The Journal of the Operational Research Society  
The problem is to find a partition of families into batches, sequences of jobs in particular batches and a sequence of batches which minimize a general regular cost function.  ...  Processing the jobs of each family contiguously and in the order of increasing indexes minimizes the total setup time, but this need not be an optimal sched- ule with respect to other cost functions, e.g  ... 

Overview of Dynamic Facility Layout Planning as a Sustainability Strategy

Pablo Pérez-Gosende, Josefa Mula, Manuel Díaz-Madroñero
2020 Sustainability  
First, a taxonomy of the reviewed papers is proposed based on the problem formulation current trends (related to the problem type, planning phase, planning approach, number of facilities, number of floors  ...  The facility layout design problem is significantly relevant within the business operations strategies framework and has emerged as an alternate strategy towards supply chain sustainability.  ...  Li et al. [58] √ (1) Minimization of materials handling costs and facility rearrangement costs. (2) Consideration of budget limitations when planning the layout design.  ... 
doi:10.3390/su12198277 fatcat:mkhvbjictzfhzg2xpaqr424lqq

Integrated Decision Algorithms for Auto-steered Electric Transmission System Asset Management [chapter]

James McCalley, Vasant Honavar, Sarah Ryan, William Meeker, Daji Qiao, Ron Roberts, Yuan Li, Jyotishman Pathak, Mujing Ye, Yili Hong
2007 Lecture Notes in Computer Science  
Industry processes to these ends have evolved ad-hoc over the years, and no systematic structures exist to coordinate the various decision problems.  ...  We particularly focus on the decision algorithms and the Benders approach we have taken to solve them in an integrated fashion.  ...  Acknowledgments The work described in this paper is funded by the National Science Foundation under grant NSF CNS0540293.  ... 
doi:10.1007/978-3-540-72584-8_140 fatcat:sncgibd3ejah5ac2stg3xndium

Upgrading Shortest Paths in Networks [chapter]

Bistra Dilkina, Katherine J. Lai, Carla P. Gomes
2011 Lecture Notes in Computer Science  
The goal is to choose a set of upgrade actions to minimize the shortest delay paths between demand pairs of terminals in the network, subject to a budget constraint.  ...  We define the problem in terms of a network with node delays and a set of node upgrade actions, each associated with a cost and an upgraded (reduced) node delay.  ...  Lai is supported by a Graduate Research Fellowship from the National Science Foundation.  ... 
doi:10.1007/978-3-642-21311-3_9 fatcat:dn565kmuobet5piofvcxl2vzei

FUZZY NON-LINEAR OPTIMIZATION MODEL FOR PRODUCTION LINE BALANCING OF JADHAV INDUSTRIES USING GENETIC ALGORITHM

Girish R. Naik
2017 International Journal of Advanced Research in Computer Science  
Further, soft computing techniques have the power of reducing NP-Hard problems to be solvable in polynomial time.  ...  The lowest common denominator in all such approaches is to attain an optimal level of service keeping the total cost associated with service cost and the waiting cost at its minimum.  ...  The statement of the crisp optimization problem is: Minimize : = (2) Subject to the constraints where, C is the total cost comprising of waiting cost and a service cost. λ -arrival rate per unit time.  ... 
doi:10.26483/ijarcs.v8i8.4706 fatcat:6rzuwbma75hkdcur7zfzm4dck4

Single Machine Scheduling with Major and Minor Setup Times: A Tabu Search Approach

E. Nowicki, S. Zdrzalka
1996 Journal of the Operational Research Society  
The problem is to find a partition of families into batches, sequences of jobs in particular batches and a sequence of batches which minimize a general regular cost function.  ...  Processing the jobs of each family contiguously and in the order of increasing indexes minimizes the total setup time, but this need not be an optimal sched- ule with respect to other cost functions, e.g  ... 
doi:10.2307/3010413 fatcat:6erq76bd7bfa3n4si2wdcga6ey

Capacity planning and warehouse location in supply chains with uncertain demands

E Aghezzaf
2005 Journal of the Operational Research Society  
+ Blu 1 / Then, this is the robust model (CPWLar): Minimize r OD + S- e a 1 I Ob >. ye . —— rel J subject to To tackle the stochastic capacity planning problem, some authors adopted a two-stage stochastic  ...  Clearly the problem (CPWLp) belongs to the class of NP- hard problems, since it can be viewed as a multiple-source capacitated economic lot-sizing problem.  ... 
doi:10.1057/palgrave.jors.2601834 fatcat:u2hi7ep4h5abrfzwb22cz2w57e

Registration area planning for PCS networks using genetic algorithms

Tsan-Pin Wang, Shu-Yuen Hwang, Chien-Chao Tseng
1998 IEEE Transactions on Vehicular Technology  
The requirement to minimize this traffic increases the importance of registration area (RA) planning in the PCS network design.  ...  In this paper, we reformulate the problem of RA planning as a costoptimization problem and propose genetic algorithms for RA planning in PCS networks.  ...  ACKNOWLEDGMENT The authors would like to thank Professor Y.-B. Lin and the reviewers for their valuable comments.  ... 
doi:10.1109/25.704853 fatcat:l6rcrrw6cbfede4v5zybmrltqq

Energy-Efficient Timely Transportation of Long-Haul Heavy-Duty Trucks

Lei Deng, Mohammad H. Hajiesmaili, Minghua Chen, Haibo Zeng
2018 IEEE transactions on intelligent transportation systems (Print)  
Our objective is to minimize the total fuel consumption of the truck, by optimizing both route planning and speed planning.  ...  The problem is important for cost-effective and environment-friendly truck operation, and it is uniquely challenging due to its combinatorial nature as well as the need of considering hard deadline constraint  ...  The goal is to minimize the energy/fuel 1 consumption subject to a hard deadline requirement T > 0 (unit: hour).  ... 
doi:10.1109/tits.2017.2749262 fatcat:vzmqscxmjrckfj5qsgob62k6li
« Previous Showing results 1 — 15 out of 191,483 results