Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

24 results for “integer linear programming”
Set a search alert
Research ArticleOpen accessIn the keywordsNew Integer Programming Formulations of the Generalized Travelling Salesman ProblemPetrica C. PopThe Generalized Travelling Salesman Problem, denoted by GTSP, is a variant of the classical travelling salesman problem (TSP), in which the nodes of an undirected graph are partitioned into node sets (clusters) and the salesman has to visit exactly one node from every cluster. In this paper we described six distinct formulations of the GTSP as an integer programming. Apart … …American Journal of Applied Sciences, Vol. 4, Issue 11 · 30 Nov 2007 · 7,200 accessesView PDFCite
Research ArticleOpen accessIn the keywordsSolving One-Dimensional Cutting Stock Problem with Discrete Demands and Capacitated Planning ObjectiveSirirat Wongprakornkul, Peerayuth CharnsethikulProblem statement: One-dimensional cutting stock problem with discrete demands and capacitated planning objective is an NP hard problem. Approach: The mathematical model with column-generation technique by a branch-and-bound procedure and the heuristic based on the first fit decreasing method are proposed. Then, both approaches were compared and some characteristics were investigated such as upper-bound value, percentage above lower-bound value, computation … …Journal of Mathematics and Statistics, Vol. 6, Issue 2 · 30 Jun 2010 · 7,947 accessesView PDFCite
Research ArticleOpen accessIn the abstractImproved Meta-Heuristic for Multi-Objective Integrated Procurement, Production and Distribution Problem of Supply Chain Network Under Fuzziness UncertaintiesKaoutar Douaioui, Mouhsene Fri, Charif Mabrouki, El Alami SemmaIn this study, we devoted a design under uncertainty of a supply chain network composed of multiple suppliers, multiple plants, multiple distributors and multiple customers. The proposed model is a bi- objective mixed integer linear programming which consider several constraints and optimize the total costs including the procurement, production, storage and distribution costs as well as maximize on-time deliveries. In … …Journal of Computer Science, Vol. 17, Issue 12 · 27 Dec 2021 · 6,625 accessesView PDFCite
Research ArticleOpen accessIn the abstractData Preparation in Machine Learning for Condition-based MaintenanceOns Masmoudi, Mehdi Jaoua, Amel Jaoua, Soumaya YacoutUsing Machine Learning (ML) prediction to achieve a successful, cost-effective, Condition-Based Maintenance (CBM) strategy has become very attractive in the context of Industry 4.0. In other fields, it is well known that in order to benefit from the prediction capability of ML algorithms, the data preparation phase must be well conducted. Thus, the objective of this paper is to investigate … …Journal of Computer Science, Vol. 17, Issue 6 · 4 Jun 2021 · 8,412 accessesView PDFCite
Research ArticleOpen accessIn the abstractMULTICAST ROUTING WITH QUALITY OF SERVICE CONSTRAINTS IN THE AD HOC WIRELESS NETWORKSAbdellah Idrissi, Fadoua YakineThe recent multimedia applications and services are very demanding in terms of Quality of Service (QoS). This creates new challenges in ensuring QoS when delivering those services over wireless networks. Motivated by the need of supporting high quality multicast applications in wireless ad hoc networks, we propose a network topology that can minimize the power when connecting the source node … …Journal of Computer Science, Vol. 10, Issue 9 · 30 Apr 2014 · 6,890 accessesView PDFCite
Research ArticleOpen accessIn the abstract“OPTIMIZATION OF MULTI-COMMODITIES CONSUMER SUPPLY CHAINS FOR-PART I-MODELING”Zeinab Haji Abolhasani, Romeo M. Marian, Lee LoungThis study and its companions (Part II, Part III) will concentrate on optimizing a class of supply chain problems known as Multi-Commodities Consumer Supply Chain (MCCSC) problem. MCCSC problem belongs to Production-Distribution (P-D) planning category. It aims to determine facilities location, consumers’ allocation and facilities configuration to minimize total Cost (CT) of the entire network. These facilities can be manufacturer … …Journal of Computer Science, Vol. 9, Issue 12 · 26 Nov 2013 · 7,840 accessesView PDFCite
Research ArticleOpen accessIn the abstractOR/MS Applications in Mt. Merapi Disaster ManagementAmril Aman, Toni Bakhtiar, Farida Hanum, Prapto Tri SupriyoProblem statement: Much of researches on the management of disaster deal with their social aspects such as sociological and psychological effects on communities. Recently there had been a growing credit of the demand for application of the operational research and management science matters in disaster management. This approach commonly utilizes decision theory, dynamical system and optimization technique to minimize the … …Journal of Mathematics and Statistics, Vol. 8, Issue 2 · 19 Jun 2012 · 7,035 accessesView PDFCite
Research ArticleOpen accessIn the abstractIntegrated Electricity Planning Comprise Renewable Energy and Feed-In TariffHo Wai Shin, Haslenda HashimProblem statement: Mitigation of global warming and energy crisis has called upon the need of an efficient tool for electricity planning. This study thus presents an electricity planning tool that incorporates RE with Feed in-Tariff (FiT) for various sources of Renewable Energy (RE) to minimize grid-connected electricity generation cost as well as to satisfy nominal electricity demand and CO2 emission … …American Journal of Engineering and Applied Sciences, Vol. 5, Issue 1 · 28 Feb 2012 · 8,695 accessesView PDFCite
Research ArticleOpen accessIn the abstractBenders' Decomposition Based Heuristics for Large-Scale Dynamic Quadratic Assignment ProblemsSirirat Muenvanichakul, Peerayuth CharnsethikulProblem statement: Dynamic Quadratic Assignment Problem (DQAP) is NP hard problem. Benders decomposition based heuristics method is applied to the equivalent mixed-integer linear programming problem of the original DQAP. Approach: Approximate Benders Decomposition (ABD) generates the ensemble of a subset of feasible layout for Approximate Dynamic Programming (ADP) to determine the sub-optimal optimal solution. A Trust-Region Constraint (TRC) for the … …Journal of Computer Science, Vol. 5, Issue 1 · 31 Jan 2009 · 7,681 accessesView PDFCite
Research ArticleOpen accessIn the abstractTwo Mathematical Modeling Approaches for Integrating Production and Transportation Decisions in the Process IndustryMohamed K. Omar, A. AjithaIn this study we focus on coordination of the production planning of finished products and intermediate products in the process industry. The problem consists of two manufacturing facilities with similar production environment, one producing the intermediates and the other producing end products that are separated by a distance. There is transportation between the facilities. The problem considered has been formulated … …American Journal of Applied Sciences, Vol. 5, Issue 8 · 31 Aug 2008 · 6,521 accessesView PDFCite