Filters








1,846 Hits in 6.9 sec

Data-Driven Models and Methodologies to Optimize Production Schedules

Prabhakar Sastri
2016 Automation Control and Intelligent Systems  
Using these data statistical models have been developed and used to find an optimal solution to the Job-Shop scheduling problem using three algorithms namely Particle Filter, Particle Swarm Optimization  ...  The algorithm is useful when we would like to arrive at job schedules based on a mix of both time and cost optimization.  ...  Review of Previous Work The Job-Shop Scheduling problem is known to be n-p hard. Different algorithms are used to solve these problems.  ... 
doi:10.11648/j.acis.20160401.11 fatcat:nobysy46jbck3kotesot3afg3m

Smart Urban Transit Systems: From Integrated Framework to Interdisciplinary Perspective

Kai Lu, Baoming Han, Xuesong Zhou
2018 Urban Rail Transit  
The methodologies for solving those models were proposed and the genetic algorithm and simulated annealing have been mostly used, which will be helpful for filling the gaps for further research.  ...  For the planning part, this paper first summarized the objectives, constraints, algorithms, and implications of the models currently in use and classified the objectives and constraints with classic category  ...  and Economics for helping us edit and polish the language of this paper.  ... 
doi:10.1007/s40864-018-0080-x fatcat:ipnoax3qkbcvleqwqr7s465cem

Operational variable job scheduling with eligibility constraints: A randomized constraint‐graph‐based approach

Deniz Tüsel Eliiyi, Aslihan Gizem Korkmaz, Abdullah Ercüent Çiçk
2009 Technological and Economic Development of Economy  
We use genetic algorithm and other improvement algorithms to enhance the solution.  ...  The problem is a more general version of the Fixed Job Scheduling problem, involving a time window for each job larger than its processing time.  ...  Genetic algorithm (GA) was used to solve the tactical FJS problem by Santos, Zhong (2001) , where each gene contains information about assignments of the jobs to the machines.  ... 
doi:10.3846/1392-8619.2009.15.245-266 fatcat:c6r2ujlsi5cz3nbwqicpwbo2ne

Seasonal Reservation Scheduling with Resource Costs: A Mathematical Modeling Approach

Uğur ELİİYİ
2021 İzmir İktisat Dergisi  
The objective of the problem is to maximize the net profit gained from the processed reservations. To the best of our knowledge, the problem was not previously studied.  ...  In this study, a novel optimization problem for simultaneous capacity planning and scheduling in reservation scheduling environments is proposed.  ...  Improvement algorithms including genetic algorithm were also developed. The results indicate a superior performance of the developed heuristic as compared to the genetic algorithm.  ... 
doi:10.24988/ije.202136211 fatcat:zp4bkp6v2fespmmdruggosy4au

Trends in Models and Algorithms for Fleet Management

Maurizio Bielli, Alessandro Bielli, Riccardo Rossi
2011 Procedia - Social and Behavioral Sciences  
Many fleet management problems correspond to combinatorial optimization problems, such as vehicle routing and scheduling, that are notoriously difficult to solve, even in a static context.  ...  From a modelling standpoint, many fleet management problems correspond to combinatorial optimisation problems (e.g., vehicle routing, scheduling, network design) that are notoriously difficult to solve  ...  , genetic algorithms, variable neighborhood search.  ... 
doi:10.1016/j.sbspro.2011.08.004 fatcat:7tgw664otbcobbqxlz2iirlehy

Modeling and optimization of the terminal control area with holding unit

Yun-Xiang Han
2021 PLoS ONE  
Similar to the job-shop scheduling problem, this problem is solved through a max-plus model with additional constraints.  ...  Based on the realistic airspace network selected, the proposed models are tested using actual flight data.  ...  Acknowledgments I would like to thank the editors and anonymous referees for their constructive comments on previous draft of the article.  ... 
doi:10.1371/journal.pone.0241204 pmid:33651822 pmcid:PMC7924791 fatcat:eivjcqqozvfude2xrnyw2owwaq

Uncertainty in Intermodal and Synchromodal Transport: Review and Future Research Directions

Thibault Delbart, Yves Molenbruch, Kris Braekers, An Caris
2021 Sustainability  
The literature is classified based on the planning level, which is either strategic, tactical or operational.  ...  This work contributes to the research field by reviewing the literature on intermodal and synchromodal transport with uncertainty, presenting measures to mitigate the effects of uncertainty and proposing  ...  [40] use a memetic algorithm, which combines a genetic algorithm with two local search methods.  ... 
doi:10.3390/su13073980 fatcat:jxw5xdkxhjb7vnufaos4aa7gmy

Evolution-Based Deliberative Planning for Cooperating Unmanned Ground Vehicles in a Dynamic Environment [chapter]

Talib Hussain, David Montana, Gordon Vidaver
2004 Lecture Notes in Computer Science  
Our evolutionary system applies domain-specific genetic operators, termed tactical advocates because they capture specific tactical behaviors, to make targeted improvements to plans.  ...  We have developed such a planning system that uses an evolutionary algorithm to assign waypoints and mission goals to multiple UGVs so that they jointly achieve a set of mission goals.  ...  Krisler and Sarah Siracuse in the development of the simulation environment used to test our approach.  ... 
doi:10.1007/978-3-540-24855-2_113 fatcat:6y3ktyfrdbcd3azy3xexzjrf5q

Integrating noncyclical preventive maintenance scheduling and production planning for multi-state systems

Mohamed-Chahir Fitouhi, Mustapha Nourelfath
2014 Reliability Engineering & System Safety  
The model is first solved by comparing the results of several multi-products capacitated lot-sizing problems.  ...  Then, for large-size problems, a simulated annealing algorithm is developed and illustrated through numerical experiments.  ...  The model was solved by genetic algorithms. Berrichi et al. [8] improved the obtained results by using an ant colony algorithm.  ... 
doi:10.1016/j.ress.2013.07.009 fatcat:rvr2h4evxfgt5bnixtg52vknve

Batch scheduling in the histopathology laboratory

A. G. Leeftink, R. J. Boucherie, E. W. Hans, M. A. M. Verdaasdonk, I. M. H. Vliegen, P. J. van Diest
2016 Flexible Services and Manufacturing Journal  
This reduces the peaks of physical work available in the laboratory. Second, the remaining processes are scheduled to minimize the tardiness of orders using a list scheduling algorithm.  ...  We develop a new 2-phased decomposition approach to solve this NP-hard problem, aiming to improve the spread of workload and to reduce the tardiness.  ...  Appendix: Model formulation This appendix presents the model developed for scheduling the 3-stage HFPB. For notation, refer to Table 12. The objective and constraints are as follows:  ... 
doi:10.1007/s10696-016-9257-3 fatcat:pswlizpkkvcevlqwabqyacyu7i

A population-based algorithm for the railroad blocking problem

Masoud Yaghini, Masoud Seyedabadi, Mohamad M Khoshraftar
2012 Journal of Industrial Engineering International  
To evaluate the efficiency and the quality of solutions of the proposed algorithm, several simulated test problems are used.  ...  In this paper, for the first time, a new genetic algorithm-based solution method, which is a population-based algorithm, is proposed to solve the RBP.  ...  hybrid genetic algorithm and ant colony optimization to enable the algorithm for solving more large-scale problems and decrease solving time of algorithm.  ... 
doi:10.1186/2251-712x-8-8 fatcat:5y7hif7ef5bpxm54d3bha4gt54

A Memetic Algorithm for Multiple-Drug Cancer Chemotherapy Schedule Optimization

Sui-Man Tse, Yong Liang, Kwong-Sak Leung, Kin-Hong Lee, Tony Shu-Kam Mok
2007 IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)  
MA-IDP has been shown to be very efficient in solving the multidrug scheduling optimization problem.  ...  We combine the adaptive elitist genetic algorithm with a local search algorithm called iterative dynamic programming (IDP) to form a new memetic algorithm (MA-IDP) for solving the problem.  ...  ACKNOWLEDGMENT The authors would like to thank Y. S. Ong and the four anonymous reviewers for their constructive comments that have helped greatly in improving this correspondence.  ... 
doi:10.1109/tsmcb.2006.883265 pmid:17278562 fatcat:4mxlf5r6vnejdjlujjkyaggf7y

Cross-docking: State of the art

Jan Van Belle, Paul Valckenaers, Dirk Cattrysse
2012 Omega : The International Journal of Management Science  
The discussed articles are classified based on the problem type that is tackled (ranging from more strategical or tactical to more operational problems).  ...  Guidelines for the successful use and implementation of cross-docking are discussed and several characteristics are described that can be used to distinguish between different cross-dock types.  ...  Because the problem is NPhard, a genetic algorithm (GA) is proposed to solve it.  ... 
doi:10.1016/j.omega.2012.01.005 fatcat:ut2zw5qhxbhtxc6blh3ljxdgde

A Taxonomy of Railway Track Maintenance Planning and Scheduling: A Review and Research Trends

Mahdieh Sedghi, Osmo Kauppila, Bjarne Bergquist, Erik Vanhatalo, Murat Kulahci
2021 Reliability Engineering & System Safety  
This article reviews the literature in decision support models for railway track maintenance planning and scheduling and transforms the results into a problem taxonomy.  ...  Furthermore, the article discusses current approaches in optimising maintenance planning and scheduling, research trends, and possible gaps in the related decision-making models.  ...  Acknowledgements The authors gratefully acknowledge the financial and other support obtained from the Swedish Transportation Administration and Luleå Railway Research Centre (JVTC) through the project  ... 
doi:10.1016/j.ress.2021.107827 fatcat:u7w5th73uvai3ane5b254bpcey

General lot-sizing and scheduling for perishable food products

Zohreh Alipour, Fariborz Jolai, Ehsan Monabbati, Nima Zaerpour
2019 Reserche operationelle  
We apply two mixed-integer programming based heuristics to solve generated instances. The heuristics are compared in terms of solution quality and computational time.  ...  General lot-sizing and scheduling is a well-studied problem in the literature, but for perishable or time-sensitive products is less investigated.  ...  The authors would like to thank the reviewers for their helpful and effective comments which help us to improve this paper scientifically.  ... 
doi:10.1051/ro/2019021 fatcat:iksg4jaegne55inl4l3onbr24e
« Previous Showing results 1 — 15 out of 1,846 results