CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: mixed integer problem</title> <meta name="description" content="Search results for: mixed integer problem"> <meta name="keywords" content="mixed integer problem"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="mixed integer problem" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="mixed integer problem"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 9742</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: mixed integer problem</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9742</span> Multi-Objective Optimization of Combined System Reliability and Redundancy Allocation Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vijaya%20K.%20Srivastava">Vijaya K. Srivastava</a>, <a href="https://publications.waset.org/abstracts/search?q=Davide%20Spinello"> Davide Spinello</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents established 3<strong><sup>n</sup></strong> enumeration procedure for mixed integer optimization problems for solving multi-objective reliability and redundancy allocation problem subject to design constraints. The formulated problem is to find the optimum level of unit reliability and the number of units for each subsystem. A number of illustrative examples are provided and compared to indicate the application of the superiority of the proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=integer%20programming" title="integer programming">integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20programming" title=" mixed integer programming"> mixed integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20optimization" title=" multi-objective optimization"> multi-objective optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=Reliability%20Redundancy%20Allocation" title=" Reliability Redundancy Allocation"> Reliability Redundancy Allocation</a> </p> <a href="https://publications.waset.org/abstracts/107208/multi-objective-optimization-of-combined-system-reliability-and-redundancy-allocation-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/107208.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">172</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9741</span> A Mixed Integer Linear Programming Model for Flexible Job Shop Scheduling Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohsen%20Ziaee">Mohsen Ziaee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a mixed integer linear programming (MILP) model is presented to solve the flexible job shop scheduling problem (FJSP). This problem is one of the hardest combinatorial problems. The objective considered is the minimization of the makespan. The computational results of the proposed MILP model were compared with those of the best known mathematical model in the literature in terms of the computational time. The results show that our model has better performance with respect to all the considered performance measures including relative percentage deviation (RPD) value, number of constraints, and total number of variables. By this improved mathematical model, larger FJS problems can be optimally solved in reasonable time, and therefore, the model would be a better tool for the performance evaluation of the approximation algorithms developed for the problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=scheduling" title="scheduling">scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=flexible%20job%20shop" title=" flexible job shop"> flexible job shop</a>, <a href="https://publications.waset.org/abstracts/search?q=makespan" title=" makespan"> makespan</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20linear%20programming" title=" mixed integer linear programming"> mixed integer linear programming</a> </p> <a href="https://publications.waset.org/abstracts/92281/a-mixed-integer-linear-programming-model-for-flexible-job-shop-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92281.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">186</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9740</span> Supplier Selection by Considering Cost and Reliability</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=K.%20-H.%20Yang">K. -H. Yang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Supplier selection problem is one of the important issues of supply chain problems. Two categories of methodologies include qualitative and quantitative approaches which can be applied to supplier selection problems. However, due to the complexities of the problem and lacking of reliable and quantitative data, qualitative approaches are more than quantitative approaches. This study considers operational cost and supplier’s reliability factor and solves the problem by using a quantitative approach. A mixed integer programming model is the primary analytic tool. Analyses of different scenarios with variable cost and reliability structures show that the effectiveness of this approach to the supplier selection problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20programming" title="mixed integer programming">mixed integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=quantitative%20approach" title=" quantitative approach"> quantitative approach</a>, <a href="https://publications.waset.org/abstracts/search?q=supplier%E2%80%99s%20reliability" title=" supplier’s reliability"> supplier’s reliability</a>, <a href="https://publications.waset.org/abstracts/search?q=supplier%20selection" title=" supplier selection"> supplier selection</a> </p> <a href="https://publications.waset.org/abstracts/45770/supplier-selection-by-considering-cost-and-reliability" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45770.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">384</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9739</span> Optimal Production Planning in Aromatic Coconuts Supply Chain Based on Mixed-Integer Linear Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chaimongkol%20Limpianchob">Chaimongkol Limpianchob</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This work addresses the problem of production planning that arises in the production of aromatic coconuts from Samudsakhorn province in Thailand. The planning involves the forwarding of aromatic coconuts from the harvest areas to the factory, which is classified into two groups; self-owned areas and contracted areas, the decisions of aromatic coconuts flow in the plant, and addressing a question of which warehouse will be in use. The problem is formulated as a mixed-integer linear programming model within supply chain management framework. The objective function seeks to minimize the total cost including the harvesting, labor and inventory costs. Constraints on the system include the production activities in the company and demand requirements. Numerical results are presented to demonstrate the feasibility of coconuts supply chain model compared with base case. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=aromatic%20coconut" title="aromatic coconut">aromatic coconut</a>, <a href="https://publications.waset.org/abstracts/search?q=supply%20chain%20management" title=" supply chain management"> supply chain management</a>, <a href="https://publications.waset.org/abstracts/search?q=production%20planning" title=" production planning"> production planning</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed-integer%20linear%20programming" title=" mixed-integer linear programming"> mixed-integer linear programming</a> </p> <a href="https://publications.waset.org/abstracts/6619/optimal-production-planning-in-aromatic-coconuts-supply-chain-based-on-mixed-integer-linear-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6619.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">460</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9738</span> On the convergence of the Mixed Integer Randomized Pattern Search Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ebert%20Brea">Ebert Brea</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We propose a novel direct search algorithm for identifying at least a local minimum of mixed integer nonlinear unconstrained optimization problems. The Mixed Integer Randomized Pattern Search Algorithm (MIRPSA), so-called by the author, is based on a randomized pattern search, which is modified by the MIRPSA for finding at least a local minimum of our problem. The MIRPSA has two main operations over the randomized pattern search: moving operation and shrinking operation. Each operation is carried out by the algorithm when a set of conditions is held. The convergence properties of the MIRPSA is analyzed using a Markov chain approach, which is represented by an infinite countable set of state space λ, where each state d(q) is defined by a measure of the qth randomized pattern search Hq, for all q in N. According to the algorithm, when a moving operation is carried out on the qth randomized pattern search Hq, the MIRPSA holds its state. Meanwhile, if the MIRPSA carries out a shrinking operation over the qth randomized pattern search Hq, the algorithm will visit the next state, this is, a shrinking operation at the qth state causes a changing of the qth state into (q+1)th state. It is worthwhile pointing out that the MIRPSA never goes back to any visited states because the MIRPSA only visits any qth by shrinking operations. In this article, we describe the MIRPSA for mixed integer nonlinear unconstrained optimization problems for doing a deep study of its convergence properties using Markov chain viewpoint. We herein include a low dimension case for showing more details of the MIRPSA, when the algorithm is used for identifying the minimum of a mixed integer quadratic function. Besides, numerical examples are also shown in order to measure the performance of the MIRPSA. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=direct%20search" title="direct search">direct search</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20optimization" title=" mixed integer optimization"> mixed integer optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20search" title=" random search"> random search</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence" title=" convergence"> convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=Markov%20chain" title=" Markov chain"> Markov chain</a> </p> <a href="https://publications.waset.org/abstracts/33175/on-the-convergence-of-the-mixed-integer-randomized-pattern-search-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33175.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">470</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9737</span> Optimal Placement of Phasor Measurement Units (PMU) Using Mixed Integer Programming (MIP) for Complete Observability in Power System Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Harshith%20Gowda%20K.%20S">Harshith Gowda K. S</a>, <a href="https://publications.waset.org/abstracts/search?q=Tejaskumar%20N"> Tejaskumar N</a>, <a href="https://publications.waset.org/abstracts/search?q=Shubhanga%20R.%20B"> Shubhanga R. B</a>, <a href="https://publications.waset.org/abstracts/search?q=Gowtham%20N"> Gowtham N</a>, <a href="https://publications.waset.org/abstracts/search?q=Deekshith%20Gowda%20H.%20S"> Deekshith Gowda H. S</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Phasor measurement units (PMU) are playing an important role in the current power system for state estimation. It is necessary to have complete observability of the power system while minimizing the cost. For this purpose, the optimal location of the phasor measurement units in the power system is essential. In a bus system, zero injection buses need to be evaluated to minimize the number of PMUs. In this paper, the optimization problem is formulated using mixed integer programming to obtain the optimal location of the PMUs with increased observability. The formulation consists of with and without zero injection bus as constraints. The formulated problem is simulated using a CPLEX solver in the GAMS software package. The proposed method is tested on IEEE 30, IEEE 39, IEEE 57, and IEEE 118 bus systems. The results obtained show that the number of PMUs required is minimal with increased observability. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=PMU" title="PMU">PMU</a>, <a href="https://publications.waset.org/abstracts/search?q=observability" title=" observability"> observability</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20programming%20%28MIP%29" title=" mixed integer programming (MIP)"> mixed integer programming (MIP)</a>, <a href="https://publications.waset.org/abstracts/search?q=zero%20injection%20buses%20%28ZIB%29" title=" zero injection buses (ZIB)"> zero injection buses (ZIB)</a> </p> <a href="https://publications.waset.org/abstracts/143686/optimal-placement-of-phasor-measurement-units-pmu-using-mixed-integer-programming-mip-for-complete-observability-in-power-system-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/143686.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">165</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9736</span> Supplier Selection by Bi-Objectives Mixed Integer Program Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=K.-H.%20Yang">K.-H. Yang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the past, there was a lot of excellent research studies conducted on topics related to supplier selection. Because the considered factors of supplier selection are complicated and difficult to be quantified, most researchers deal supplier selection issues by qualitative approaches. Compared to qualitative approaches, quantitative approaches are less applicable in the real world. This study tried to apply the quantitative approach to study a supplier selection problem with considering operation cost and delivery reliability. By those factors, this study applies Normalized Normal Constraint Method to solve the dual objectives mixed integer program of the supplier selection problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bi-objectives%20MIP" title="bi-objectives MIP">bi-objectives MIP</a>, <a href="https://publications.waset.org/abstracts/search?q=normalized%20normal%20constraint%20method" title=" normalized normal constraint method"> normalized normal constraint method</a>, <a href="https://publications.waset.org/abstracts/search?q=supplier%20selection" title=" supplier selection"> supplier selection</a>, <a href="https://publications.waset.org/abstracts/search?q=quantitative%20approach" title=" quantitative approach"> quantitative approach</a> </p> <a href="https://publications.waset.org/abstracts/65651/supplier-selection-by-bi-objectives-mixed-integer-program-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/65651.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">415</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9735</span> Benders Decomposition Approach to Solve the Hybrid Flow Shop Scheduling Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ebrahim%20Asadi-Gangraj">Ebrahim Asadi-Gangraj</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Hybrid flow shop scheduling problem (HFS) contains sequencing in a flow shop where, at any stage, there exist one or more related or unrelated parallel machines. This production system is a common manufacturing environment in many real industries, such as the steel manufacturing, ceramic tile manufacturing, and car assembly industries. In this research, a mixed integer linear programming (MILP) model is presented for the hybrid flow shop scheduling problem, in which, the objective consists of minimizing the maximum completion time (makespan). For this purpose, a Benders Decomposition (BD) method is developed to solve the research problem. The proposed approach is tested on some test problems, small to moderate scale. The experimental results show that the Benders decomposition approach can solve the hybrid flow shop scheduling problem in a reasonable time, especially for small and moderate-size test problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hybrid%20flow%20shop" title="hybrid flow shop">hybrid flow shop</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20linear%20programming" title=" mixed integer linear programming"> mixed integer linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=Benders%20decomposition" title=" Benders decomposition"> Benders decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=makespan" title=" makespan"> makespan</a> </p> <a href="https://publications.waset.org/abstracts/106041/benders-decomposition-approach-to-solve-the-hybrid-flow-shop-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/106041.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">190</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9734</span> A Reactive Flexible Job Shop Scheduling Model in a Stochastic Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Majid%20Khalili">Majid Khalili</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamed%20Tayebi"> Hamed Tayebi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper considers a stochastic flexible job-shop scheduling (SFJSS) problem in the presence of production disruptions, and reactive scheduling is implemented in order to find the optimal solution under uncertainty. In this problem, there are two main disruptions including machine failure which influences operation time, and modification or cancellation of the order delivery date during production. In order to decrease the negative effects of these difficulties, two derived strategies from reactive scheduling are used; the first one is relevant to being able to allocate multiple machine to each job, and the other one is related to being able to select the best alternative process from other job while some disruptions would be created in the processes of a job. For this purpose, a Mixed Integer Linear Programming model is proposed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=flexible%20job-shop%20scheduling" title="flexible job-shop scheduling">flexible job-shop scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=reactive%20scheduling" title=" reactive scheduling"> reactive scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20environment" title=" stochastic environment"> stochastic environment</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20linear%20programming" title=" mixed integer linear programming"> mixed integer linear programming</a> </p> <a href="https://publications.waset.org/abstracts/69932/a-reactive-flexible-job-shop-scheduling-model-in-a-stochastic-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/69932.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">361</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9733</span> Low-Level Modeling for Optimal Train Routing and Scheduling in Busy Railway Stations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Quoc%20Khanh%20Dang">Quoc Khanh Dang</a>, <a href="https://publications.waset.org/abstracts/search?q=Thomas%20Bourdeaud%E2%80%99huy"> Thomas Bourdeaud’huy</a>, <a href="https://publications.waset.org/abstracts/search?q=Khaled%20Mesghouni"> Khaled Mesghouni</a>, <a href="https://publications.waset.org/abstracts/search?q=Armand%20Toguy%C2%B4eni"> Armand Toguy´eni</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper studies a train routing and scheduling problem for busy railway stations. Our objective is to allow trains to be routed in dense areas that are reaching saturation. Unlike traditional methods that allocate all resources to setup a route for a train and until the route is freed, our work focuses on the use of resources as trains progress through the railway node. This technique allows a larger number of trains to be routed simultaneously in a railway node and thus reduces their current saturation. To deal with this problem, this study proposes an abstract model and a mixed-integer linear programming formulation to solve it. The applicability of our method is illustrated on a didactic example. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=busy%20railway%20stations" title="busy railway stations">busy railway stations</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed-integer%20linear%20programming" title=" mixed-integer linear programming"> mixed-integer linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=offline%20railway%20station%20management" title=" offline railway station management"> offline railway station management</a>, <a href="https://publications.waset.org/abstracts/search?q=train%20platforming" title=" train platforming"> train platforming</a>, <a href="https://publications.waset.org/abstracts/search?q=train%20routing" title=" train routing"> train routing</a>, <a href="https://publications.waset.org/abstracts/search?q=train%20scheduling" title=" train scheduling"> train scheduling</a> </p> <a href="https://publications.waset.org/abstracts/108783/low-level-modeling-for-optimal-train-routing-and-scheduling-in-busy-railway-stations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/108783.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">254</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9732</span> An Integrated Mixed-Integer Programming Model to Address Concurrent Project Scheduling and Material Ordering</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Babak%20H.%20Tabrizi">Babak H. Tabrizi</a>, <a href="https://publications.waset.org/abstracts/search?q=Seyed%20Farid%20Ghaderi"> Seyed Farid Ghaderi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Concurrent planning of project scheduling and material ordering can provide more flexibility to the project scheduling problem, as the project execution costs can be enhanced. Hence, the issue has been taken into account in this paper. To do so, a mixed-integer mathematical model is developed which considers the aforementioned flexibility, in addition to the materials quantity discount and space availability restrictions. Moreover, the activities duration has been treated as decision variables. Finally, the efficiency of the proposed model is tested by different instances. Additionally, the influence of the aforementioned parameters is investigated on the model performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=material%20ordering" title="material ordering">material ordering</a>, <a href="https://publications.waset.org/abstracts/search?q=project%20scheduling" title=" project scheduling"> project scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=quantity%20discount" title=" quantity discount"> quantity discount</a>, <a href="https://publications.waset.org/abstracts/search?q=space%20availability" title=" space availability"> space availability</a> </p> <a href="https://publications.waset.org/abstracts/40331/an-integrated-mixed-integer-programming-model-to-address-concurrent-project-scheduling-and-material-ordering" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40331.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">368</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9731</span> Decomposition-Based Pricing Technique for Solving Large-Scale Mixed IP</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Babul%20Hasan">M. Babul Hasan </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Management sciences (MS), big group of companies and industries or government policies (GP) is affiliated with a huge number of decision ingredients and complicated restrictions. Every factor in MS, every product in Industries or decision in GP is not always bankable in practice. After formulating these models there arises large-scale mixed integer programming (MIP) problem. In this paper, we developed decomposition-based pricing procedure to filter the unnecessary decision ingredients from MIP where the variables in huge number will be abated and the complicacy of restrictions will be elementary. A real life numerical example has been illustrated to demonstrate the methods. We develop the computer techniques for these methods by using a mathematical programming language (AMPL). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lagrangian%20relaxation" title="Lagrangian relaxation">Lagrangian relaxation</a>, <a href="https://publications.waset.org/abstracts/search?q=decomposition" title=" decomposition"> decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=sub-problem" title=" sub-problem"> sub-problem</a>, <a href="https://publications.waset.org/abstracts/search?q=master-problem" title=" master-problem"> master-problem</a>, <a href="https://publications.waset.org/abstracts/search?q=pricing" title=" pricing"> pricing</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20IP" title=" mixed IP"> mixed IP</a>, <a href="https://publications.waset.org/abstracts/search?q=AMPL" title=" AMPL"> AMPL</a> </p> <a href="https://publications.waset.org/abstracts/2358/decomposition-based-pricing-technique-for-solving-large-scale-mixed-ip" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2358.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">505</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9730</span> Mixed Integer Programing for Multi-Tier Rebate with Discontinuous Cost Function</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Y.%20Long">Y. Long</a>, <a href="https://publications.waset.org/abstracts/search?q=L.%20Liu"> L. Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20V.%20Branin"> K. V. Branin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One challenge faced by procurement decision-maker during the acquisition process is how to compare similar products from different suppliers and allocate orders among different products or services. This work focuses on allocating orders among multiple suppliers considering rebate. The objective function is to minimize the total acquisition cost including purchasing cost and rebate benefit. Rebate benefit is complex and difficult to estimate at the ordering step. Rebate rules vary for different suppliers and usually change over time. In this work, we developed a system to collect the rebate policies, standardized the rebate policies and developed two-stage optimization models for ordering allocation. Rebate policy with multi-tiers is considered in modeling. The discontinuous cost function of rebate benefit is formulated for different scenarios. A piecewise linear function is used to approximate the discontinuous cost function of rebate benefit. And a Mixed Integer Programing (MIP) model is built for order allocation problem with multi-tier rebate. A case study is presented and it shows that our optimization model can reduce the total acquisition cost by considering rebate rules. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=discontinuous%20cost%20function" title="discontinuous cost function">discontinuous cost function</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20programming" title=" mixed integer programming"> mixed integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=procurement" title=" procurement"> procurement</a>, <a href="https://publications.waset.org/abstracts/search?q=rebate" title=" rebate"> rebate</a> </p> <a href="https://publications.waset.org/abstracts/84161/mixed-integer-programing-for-multi-tier-rebate-with-discontinuous-cost-function" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/84161.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">260</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9729</span> Two Efficient Heuristic Algorithms for the Integrated Production Planning and Warehouse Layout Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Pourmohammadi%20Fallah">Mohammad Pourmohammadi Fallah</a>, <a href="https://publications.waset.org/abstracts/search?q=Maziar%20Salahi"> Maziar Salahi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the literature, a mixed-integer linear programming model for the integrated production planning and warehouse layout problem is proposed. To solve the model, the authors proposed a Lagrangian relax-and-fix heuristic that takes a significant amount of time to stop with gaps above 5$\%$ for large-scale instances. Here, we present two heuristic algorithms to solve the problem. In the first one, we use a greedy approach by allocating warehouse locations with less reservation costs and also less transportation costs from the production area to locations and from locations to the output point to items with higher demands. Then a smaller model is solved. In the second heuristic, first, we sort items in descending order according to the fraction of the sum of the demands for that item in the time horizon plus the maximum demand for that item in the time horizon and the sum of all its demands in the time horizon. Then we categorize the sorted items into groups of 3, 4, or 5 and solve a small-scale optimization problem for each group, hoping to improve the solution of the first heuristic. Our preliminary numerical results show the effectiveness of the proposed heuristics. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=capacitated%20lot-sizing" title="capacitated lot-sizing">capacitated lot-sizing</a>, <a href="https://publications.waset.org/abstracts/search?q=warehouse%20layout" title=" warehouse layout"> warehouse layout</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed-integer%20linear%20programming" title=" mixed-integer linear programming"> mixed-integer linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristics%20algorithm" title=" heuristics algorithm"> heuristics algorithm</a> </p> <a href="https://publications.waset.org/abstracts/154415/two-efficient-heuristic-algorithms-for-the-integrated-production-planning-and-warehouse-layout-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/154415.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">196</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9728</span> Cutting Plane Methods for Integer Programming: NAZ Cut and Its Variations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Bari">A. Bari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Integer programming is a branch of mathematical programming techniques in operations research in which some or all of the variables are required to be integer valued. Various cuts have been used to solve these problems. We have also developed cuts known as NAZ cut & A-T cut to solve the integer programming problems. These cuts are used to reduce the feasible region and then reaching the optimal solution in minimum number of steps. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Integer%20Programming" title="Integer Programming">Integer Programming</a>, <a href="https://publications.waset.org/abstracts/search?q=NAZ%20cut" title=" NAZ cut"> NAZ cut</a>, <a href="https://publications.waset.org/abstracts/search?q=A-T%20cut" title=" A-T cut"> A-T cut</a>, <a href="https://publications.waset.org/abstracts/search?q=Cutting%20plane%20method" title=" Cutting plane method"> Cutting plane method</a> </p> <a href="https://publications.waset.org/abstracts/8763/cutting-plane-methods-for-integer-programming-naz-cut-and-its-variations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8763.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">364</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9727</span> Timetabling Communities’ Demands for an Effective Examination Timetabling Using Integer Linear Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20F.%20Jamaluddin">N. F. Jamaluddin</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20A.%20H.%20Aizam"> N. A. H. Aizam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper explains the educational timetabling problem, a type of scheduling problem that is considered as one of the most challenging problem in optimization and operational research. The university examination timetabling problem (UETP), which involves assigning a set number of exams into a set number of timeslots whilst fulfilling all required conditions, has been widely investigated. The limitation of available timeslots and resources with the increasing number of examinations are the main reasons in the difficulty of solving this problem. Dynamical change in the examination scheduling system adds up the complication particularly in coping up with the demand and new requirements by the communities. Our objective is to investigate these demands and requirements with subjects taken from Universiti Malaysia Terengganu (UMT), through questionnaires. Integer linear programming model which reflects the preferences obtained to produce an effective examination timetabling was formed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=demands" title="demands">demands</a>, <a href="https://publications.waset.org/abstracts/search?q=educational%20timetabling" title=" educational timetabling"> educational timetabling</a>, <a href="https://publications.waset.org/abstracts/search?q=integer%20linear%20programming" title=" integer linear programming"> integer linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=university%20examination%20timetabling%20problem%20%28UETP%29" title=" university examination timetabling problem (UETP)"> university examination timetabling problem (UETP)</a> </p> <a href="https://publications.waset.org/abstracts/49545/timetabling-communities-demands-for-an-effective-examination-timetabling-using-integer-linear-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49545.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">337</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9726</span> Integer Programming Model for the Network Design Problem with Facility Dependent Shortest Path Routing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Taehan%20Lee">Taehan Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We consider a network design problem which has shortest routing restriction based on the values determined by the installed facilities on each arc. In conventional multicommodity network design problem, a commodity can be routed through any possible path when the capacity is available. But, we consider a problem in which the commodity between two nodes must be routed on a path which has shortest metric value and the link metric value is determined by the installed facilities on the link. By this routing restriction, the problem has a distinct characteristic. We present an integer programming formulation containing the primal-dual optimality conditions to the shortest path routing. We give some computational results for the model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=integer%20programming" title="integer programming">integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=multicommodity%20network%20design" title=" multicommodity network design"> multicommodity network design</a>, <a href="https://publications.waset.org/abstracts/search?q=routing" title=" routing"> routing</a>, <a href="https://publications.waset.org/abstracts/search?q=shortest%20path" title=" shortest path"> shortest path</a> </p> <a href="https://publications.waset.org/abstracts/51447/integer-programming-model-for-the-network-design-problem-with-facility-dependent-shortest-path-routing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51447.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">420</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9725</span> Interactive Winding Geometry Design of Power Transformers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Paffrath%20Meinhard">Paffrath Meinhard</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhou%20Yayun"> Zhou Yayun</a>, <a href="https://publications.waset.org/abstracts/search?q=Guo%20Yiqing"> Guo Yiqing</a>, <a href="https://publications.waset.org/abstracts/search?q=Ertl%20Harald"> Ertl Harald</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Winding geometry design is an important part of power transformer electrical design. Conventionally, the winding geometry is designed manually, which is a time-consuming job because it involves many iteration steps in order to meet all cost, manufacturing and electrical requirements. Here a method is presented which automatically generates the winding geometry for given user parameters and allows the user to interactively set and change parameters. To achieve this goal, the winding problem is transferred to a mixed integer nonlinear optimization problem. The relevant geometrical design parameters are defined as optimization variables. The cost and other requirements are modeled as constraints. For the solution, a stochastic ant colony optimization algorithm is applied. It is well-known, that an optimizer can get stuck in a local minimum. For the winding problem, we present efficient strategies to come out of local minima, furthermore a reduced variable search range helps to accelerate the solution process. Numerical examples show that the optimization result is delivered within seconds such that the user can interactively change the variable search area and constraints to improve the design. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20optimization" title="ant colony optimization">ant colony optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20nonlinear%20programming" title=" mixed integer nonlinear programming"> mixed integer nonlinear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20transformer" title=" power transformer"> power transformer</a>, <a href="https://publications.waset.org/abstracts/search?q=winding%20design" title=" winding design"> winding design</a> </p> <a href="https://publications.waset.org/abstracts/74700/interactive-winding-geometry-design-of-power-transformers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/74700.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">380</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9724</span> Feature Selection for Production Schedule Optimization in Transition Mines</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Angelina%20Anani">Angelina Anani</a>, <a href="https://publications.waset.org/abstracts/search?q=Ignacio%20Ortiz%20Flores"> Ignacio Ortiz Flores</a>, <a href="https://publications.waset.org/abstracts/search?q=Haitao%20Li"> Haitao Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The use of underground mining methods have increased significantly over the past decades. This increase has also been spared on by several mines transitioning from surface to underground mining. However, determining the transition depth can be a challenging task, especially when coupled with production schedule optimization. Several researchers have simplified the problem by excluding operational features relevant to production schedule optimization. Our research objective is to investigate the extent to which operational features of transition mines accounted for affect the optimal production schedule. We also provide a framework for factors to consider in production schedule optimization for transition mines. An integrated mixed-integer linear programming (MILP) model is developed that maximizes the NPV as a function of production schedule and transition depth. A case study is performed to validate the model, with a comparative sensitivity analysis to obtain operational insights. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=underground%20mining" title="underground mining">underground mining</a>, <a href="https://publications.waset.org/abstracts/search?q=transition%20mines" title=" transition mines"> transition mines</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed-integer%20linear%20programming" title=" mixed-integer linear programming"> mixed-integer linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=production%20schedule" title=" production schedule"> production schedule</a> </p> <a href="https://publications.waset.org/abstracts/144388/feature-selection-for-production-schedule-optimization-in-transition-mines" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/144388.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">169</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9723</span> An Efficient Approach to Optimize the Cost and Profit of a Tea Garden by Using Branch and Bound Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abu%20Hashan%20Md%20Mashud">Abu Hashan Md Mashud</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Sharif%20Uddin"> M. Sharif Uddin</a>, <a href="https://publications.waset.org/abstracts/search?q=Aminur%20Rahman%20Khan"> Aminur Rahman Khan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we formulate a new problem as a linear programming and Integer Programming problem and maximize profit within the limited budget and limited resources based on the construction of a tea garden problem. It describes a new idea about how to optimize profit and focuses on the practical aspects of modeling and the challenges of providing a solution to a complex real life problem. Finally, a comparative study is carried out among Graphical method, Simplex method and Branch and bound method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=integer%20programming" title="integer programming">integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=tea%20garden" title=" tea garden"> tea garden</a>, <a href="https://publications.waset.org/abstracts/search?q=graphical%20method" title=" graphical method"> graphical method</a>, <a href="https://publications.waset.org/abstracts/search?q=simplex%20method" title=" simplex method"> simplex method</a>, <a href="https://publications.waset.org/abstracts/search?q=branch%20and%20bound%20method" title=" branch and bound method"> branch and bound method</a> </p> <a href="https://publications.waset.org/abstracts/2584/an-efficient-approach-to-optimize-the-cost-and-profit-of-a-tea-garden-by-using-branch-and-bound-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2584.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">625</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9722</span> Green Closed-Loop Supply Chain Network Design Considering Different Production Technologies Levels and Transportation Modes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mahsa%20Oroojeni%20Mohammad%20Javad">Mahsa Oroojeni Mohammad Javad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Globalization of economic activity and rapid growth of information technology has resulted in shorter product lifecycles, reduced transport capacity, dynamic and changing customer behaviors, and an increased focus on supply chain design in recent years. The design of the supply chain network is one of the most important supply chain management decisions. These decisions will have a long-term impact on the efficacy and efficiency of the supply chain. In this paper, a two-objective mixed-integer linear programming (MILP) model is developed for designing and optimizing a closed-loop green supply chain network that, to the greatest extent possible, includes all real-world assumptions such as multi-level supply chain, the multiplicity of production technologies, and multiple modes of transportation, with the goals of minimizing the total cost of the chain (first objective) and minimizing total emissions of emissions (second objective). The ε-constraint and CPLEX Solver have been used to solve the problem as a single-objective problem and validate the problem. Finally, the sensitivity analysis is applied to study the effect of the real-world parameters’ changes on the objective function. The optimal management suggestions and policies are presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=closed-loop%20supply%20chain" title="closed-loop supply chain">closed-loop supply chain</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-level%20green%20supply%20chain" title=" multi-level green supply chain"> multi-level green supply chain</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed-integer%20programming" title=" mixed-integer programming"> mixed-integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=transportation%20modes" title=" transportation modes"> transportation modes</a> </p> <a href="https://publications.waset.org/abstracts/169009/green-closed-loop-supply-chain-network-design-considering-different-production-technologies-levels-and-transportation-modes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/169009.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">80</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9721</span> Heuristic Algorithms for Time Based Weapon-Target Assignment Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hyun%20Seop%20Uhm">Hyun Seop Uhm</a>, <a href="https://publications.waset.org/abstracts/search?q=Yong%20Ho%20Choi"> Yong Ho Choi</a>, <a href="https://publications.waset.org/abstracts/search?q=Ji%20Eun%20Kim"> Ji Eun Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Young%20Hoon%20Lee"> Young Hoon Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Weapon-target assignment (WTA) is a problem that assigns available launchers to appropriate targets in order to defend assets. Various algorithms for WTA have been developed over past years for both in the static and dynamic environment (denoted by SWTA and DWTA respectively). Due to the problem requirement to be solved in a relevant computational time, WTA has suffered from the solution efficiency. As a result, SWTA and DWTA problems have been solved in the limited situation of the battlefield. In this paper, the general situation under continuous time is considered by Time based Weapon Target Assignment (TWTA) problem. TWTA are studied using the mixed integer programming model, and three heuristic algorithms; decomposed opt-opt, decomposed opt-greedy, and greedy algorithms are suggested. Although the TWTA optimization model works inefficiently when it is characterized by a large size, the decomposed opt-opt algorithm based on the linearization and decomposition method extracted efficient solutions in a reasonable computation time. Because the computation time of the scheduling part is too long to solve by the optimization model, several algorithms based on greedy is proposed. The models show lower performance value than that of the decomposed opt-opt algorithm, but very short time is needed to compute. Hence, this paper proposes an improved method by applying decomposition to TWTA, and more practical and effectual methods can be developed for using TWTA on the battlefield. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=air%20and%20missile%20defense" title="air and missile defense">air and missile defense</a>, <a href="https://publications.waset.org/abstracts/search?q=weapon%20target%20assignment" title=" weapon target assignment"> weapon target assignment</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20programming" title=" mixed integer programming"> mixed integer programming</a>, <a href="https://publications.waset.org/abstracts/search?q=piecewise%20linearization" title=" piecewise linearization"> piecewise linearization</a>, <a href="https://publications.waset.org/abstracts/search?q=decomposition%20algorithm" title=" decomposition algorithm"> decomposition algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=military%20operations%20research" title=" military operations research"> military operations research</a> </p> <a href="https://publications.waset.org/abstracts/51706/heuristic-algorithms-for-time-based-weapon-target-assignment-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51706.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">336</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9720</span> A New Multi-Target, Multi-Agent Search and Rescue Path Planning Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jean%20Berger">Jean Berger</a>, <a href="https://publications.waset.org/abstracts/search?q=Nassirou%20Lo"> Nassirou Lo</a>, <a href="https://publications.waset.org/abstracts/search?q=Martin%20Noel"> Martin Noel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Perfectly suited for natural or man-made emergency and disaster management situations such as flood, earthquakes, tornadoes, or tsunami, multi-target search path planning for a team of rescue agents is known to be computationally hard, and most techniques developed so far come short to successfully estimate optimality gap. A novel mixed-integer linear programming (MIP) formulation is proposed to optimally solve the multi-target multi-agent discrete search and rescue (SAR) path planning problem. Aimed at maximizing cumulative probability of successful target detection, it captures anticipated feedback information associated with possible observation outcomes resulting from projected path execution, while modeling agent discrete actions over all possible moving directions. Problem modeling further takes advantage of network representation to encompass decision variables, expedite compact constraint specification, and lead to substantial problem-solving speed-up. The proposed MIP approach uses CPLEX optimization machinery, efficiently computing near-optimal solutions for practical size problems, while giving a robust upper bound obtained from Lagrangean integrality constraint relaxation. Should eventually a target be positively detected during plan execution, a new problem instance would simply be reformulated from the current state, and then solved over the next decision cycle. A computational experiment shows the feasibility and the value of the proposed approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=search%20path%20planning" title="search path planning">search path planning</a>, <a href="https://publications.waset.org/abstracts/search?q=search%20and%20rescue" title=" search and rescue"> search and rescue</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-agent" title=" multi-agent"> multi-agent</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed-integer%20linear%20programming" title=" mixed-integer linear programming"> mixed-integer linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a> </p> <a href="https://publications.waset.org/abstracts/5918/a-new-multi-target-multi-agent-search-and-rescue-path-planning-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5918.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">372</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9719</span> An Adiabatic Quantum Optimization Approach for the Mixed Integer Nonlinear Programming Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maxwell%20Henderson">Maxwell Henderson</a>, <a href="https://publications.waset.org/abstracts/search?q=Tristan%20Cook"> Tristan Cook</a>, <a href="https://publications.waset.org/abstracts/search?q=Justin%20Chan%20Jin%20Le"> Justin Chan Jin Le</a>, <a href="https://publications.waset.org/abstracts/search?q=Mark%20Hodson"> Mark Hodson</a>, <a href="https://publications.waset.org/abstracts/search?q=YoungJung%20Chang"> YoungJung Chang</a>, <a href="https://publications.waset.org/abstracts/search?q=John%20Novak"> John Novak</a>, <a href="https://publications.waset.org/abstracts/search?q=Daniel%20Padilha"> Daniel Padilha</a>, <a href="https://publications.waset.org/abstracts/search?q=Nishan%20Kulatilaka"> Nishan Kulatilaka</a>, <a href="https://publications.waset.org/abstracts/search?q=Ansu%20Bagchi"> Ansu Bagchi</a>, <a href="https://publications.waset.org/abstracts/search?q=Sanjoy%20Ray"> Sanjoy Ray</a>, <a href="https://publications.waset.org/abstracts/search?q=John%20Kelly"> John Kelly</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present a method of using adiabatic quantum optimization (AQO) to solve a mixed integer nonlinear programming (MINLP) problem instance. The MINLP problem is a general form of a set of NP-hard optimization problems that are critical to many business applications. It requires optimizing a set of discrete and continuous variables with nonlinear and potentially nonconvex constraints. Obtaining an exact, optimal solution for MINLP problem instances of non-trivial size using classical computation methods is currently intractable. Current leading algorithms leverage heuristic and divide-and-conquer methods to determine approximate solutions. Creating more accurate and efficient algorithms is an active area of research. Quantum computing (QC) has several theoretical benefits compared to classical computing, through which QC algorithms could obtain MINLP solutions that are superior to current algorithms. AQO is a particular form of QC that could offer more near-term benefits compared to other forms of QC, as hardware development is in a more mature state and devices are currently commercially available from D-Wave Systems Inc. It is also designed for optimization problems: it uses an effect called quantum tunneling to explore all lowest points of an energy landscape where classical approaches could become stuck in local minima. Our work used a novel algorithm formulated for AQO to solve a special type of MINLP problem. The research focused on determining: 1) if the problem is possible to solve using AQO, 2) if it can be solved by current hardware, 3) what the currently achievable performance is, 4) what the performance will be on projected future hardware, and 5) when AQO is likely to provide a benefit over classical computing methods. Two different methods, integer range and 1-hot encoding, were investigated for transforming the MINLP problem instance constraints into a mathematical structure that can be embedded directly onto the current D-Wave architecture. For testing and validation a D-Wave 2X device was used, as well as QxBranch’s QxLib software library, which includes a QC simulator based on simulated annealing. Our results indicate that it is mathematically possible to formulate the MINLP problem for AQO, but that currently available hardware is unable to solve problems of useful size. Classical general-purpose simulated annealing is currently able to solve larger problem sizes, but does not scale well and such methods would likely be outperformed in the future by improved AQO hardware with higher qubit connectivity and lower temperatures. If larger AQO devices are able to show improvements that trend in this direction, commercially viable solutions to the MINLP for particular applications could be implemented on hardware projected to be available in 5-10 years. Continued investigation into optimal AQO hardware architectures and novel methods for embedding MINLP problem constraints on to those architectures is needed to realize those commercial benefits. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adiabatic%20quantum%20optimization" title="adiabatic quantum optimization">adiabatic quantum optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20nonlinear%20programming" title=" mixed integer nonlinear programming"> mixed integer nonlinear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20computing" title=" quantum computing"> quantum computing</a>, <a href="https://publications.waset.org/abstracts/search?q=NP-hard" title=" NP-hard"> NP-hard</a> </p> <a href="https://publications.waset.org/abstracts/79560/an-adiabatic-quantum-optimization-approach-for-the-mixed-integer-nonlinear-programming-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/79560.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">526</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9718</span> Vehicle Routing Problem with Mixed Fleet of Conventional and Heterogenous Electric Vehicles and Time Dependent Charging Costs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ons%20Sassi">Ons Sassi</a>, <a href="https://publications.waset.org/abstracts/search?q=Wahiba%20Ramdane%20Cherif-Khettaf"> Wahiba Ramdane Cherif-Khettaf</a>, <a href="https://publications.waset.org/abstracts/search?q=Ammar%20Oulamara"> Ammar Oulamara</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we consider a new real-life Heterogenous Electric Vehicle Routing Problem with Time Dependant Charging Costs and a Mixed Fleet (HEVRP-TDMF), in which a set of geographically scattered customers have to be served by a mixed fleet of vehicles composed of a heterogenous fleet of Electric Vehicles (EVs), having different battery capacities and operating costs, and Conventional Vehicles (CVs). We include the possibility of charging EVs in the available charging stations during the routes in order to serve all customers. Each charging station offers charging service with a known technology of chargers and time-dependent charging costs. Charging stations are also subject to operating time windows constraints. EVs are not necessarily compatible with all available charging technologies and a partial charging is allowed. Intermittent charging at the depot is also allowed provided that constraints related to the electricity grid are satisfied. The objective is to minimize the number of employed vehicles and then minimize the total travel and charging costs. In this study, we present a Mixed Integer Programming Model and develop a Charging Routing Heuristic and a Local Search Heuristic based on the Inject-Eject routine with three different insertion strategies. All heuristics are tested on real data instances. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=charging%20problem" title="charging problem">charging problem</a>, <a href="https://publications.waset.org/abstracts/search?q=electric%20vehicle" title=" electric vehicle"> electric vehicle</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristics" title=" heuristics"> heuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20search" title=" local search"> local search</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=routing%20problem" title=" routing problem"> routing problem</a> </p> <a href="https://publications.waset.org/abstracts/19969/vehicle-routing-problem-with-mixed-fleet-of-conventional-and-heterogenous-electric-vehicles-and-time-dependent-charging-costs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19969.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">463</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9717</span> Vehicle Routing Problem Considering Alternative Roads under Triple Bottom Line Accounting</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Onur%20Kaya">Onur Kaya</a>, <a href="https://publications.waset.org/abstracts/search?q=Ilknur%20Tukenmez"> Ilknur Tukenmez</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, we consider vehicle routing problems on networks with alternative direct links between nodes, and we analyze a multi-objective problem considering the financial, environmental and social objectives in this context. In real life, there might exist several alternative direct roads between two nodes, and these roads might have differences in terms of their lengths and durations. For example, a road might be shorter than another but might require longer time due to traffic and speed limits. Similarly, some toll roads might be shorter or faster but require additional payment, leading to higher costs. We consider such alternative links in our problem and develop a mixed integer linear programming model that determines which alternative link to use between two nodes, in addition to determining the optimal routes for different vehicles, depending on the model objectives and constraints. We consider the minimum cost routing as the financial objective for the company, minimizing the CO2 emissions and gas usage as the environmental objectives, and optimizing the driver working conditions/working hours, and minimizing the risks of accidents as the social objectives. With these objective functions, we aim to determine which routes, and which alternative links should be used in addition to the speed choices on each link. We discuss the results of the developed vehicle routing models and compare their results depending on the system parameters. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=vehicle%20routing" title="vehicle routing">vehicle routing</a>, <a href="https://publications.waset.org/abstracts/search?q=alternative%20links%20between%20nodes" title=" alternative links between nodes"> alternative links between nodes</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20linear%20programming" title=" mixed integer linear programming"> mixed integer linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=triple%20bottom%20line%20accounting" title=" triple bottom line accounting"> triple bottom line accounting</a> </p> <a href="https://publications.waset.org/abstracts/64786/vehicle-routing-problem-considering-alternative-roads-under-triple-bottom-line-accounting" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/64786.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">407</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9716</span> A Heuristic Approach for the General Flowshop Scheduling Problem to Minimize the Makespan</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohsen%20Ziaee">Mohsen Ziaee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Almost all existing researches on the flowshop scheduling problems focus on the permutation schedules and there is insufficient study dedicated to the general flowshop scheduling problems in the literature, since the modeling and solving of the general flowshop scheduling problems are more difficult than the permutation ones, especially for the large-size problem instances. This paper considers the general flowshop scheduling problem with the objective function of the makespan (F//Cmax). We first find the optimal solution of the problem by solving a mixed integer linear programming model. An efficient heuristic method is then presented to solve the problem. An ant colony optimization algorithm is also proposed for the problem. In order to evaluate the performance of the methods, computational experiments are designed and performed. Numerical results show that the heuristic algorithm can result in reasonable solutions with low computational effort and even achieve optimal solutions in some cases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=scheduling" title="scheduling">scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=general%20flow%20shop%20scheduling%20problem" title=" general flow shop scheduling problem"> general flow shop scheduling problem</a>, <a href="https://publications.waset.org/abstracts/search?q=makespan" title=" makespan"> makespan</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic" title=" heuristic"> heuristic</a> </p> <a href="https://publications.waset.org/abstracts/92277/a-heuristic-approach-for-the-general-flowshop-scheduling-problem-to-minimize-the-makespan" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92277.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">207</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9715</span> Integrated Vegetable Production Planning Considering Crop Rotation Rules Using a Mathematical Mixed Integer Programming Model </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammadali%20Abedini%20Sanigy">Mohammadali Abedini Sanigy</a>, <a href="https://publications.waset.org/abstracts/search?q=Jiangang%20Fei"> Jiangang Fei</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a mathematical optimization model was developed to maximize the profit in a vegetable production planning problem. It serves as a decision support system that assists farmers in land allocation to crops and harvest scheduling decisions. The developed model can handle different rotation rules in two consecutive cycles of production, which is a common practice in organic production system. Moreover, different production methods of the same crop were considered in the model formulation. The main strength of the model is that it is not restricted to predetermined production periods, which makes the planning more flexible. The model is classified as a mixed integer programming (MIP) model and formulated in PYOMO -a Python package to formulate optimization models- and solved via Gurobi and CPLEX optimizer packages. The model was tested with secondary data from 'Australian vegetable growing farms', and the results were obtained and discussed with the computational test runs. The results show that the model can successfully provide reliable solutions for real size problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=crop%20rotation" title="crop rotation">crop rotation</a>, <a href="https://publications.waset.org/abstracts/search?q=harvesting" title=" harvesting"> harvesting</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematical%20model%20formulation" title=" mathematical model formulation"> mathematical model formulation</a>, <a href="https://publications.waset.org/abstracts/search?q=vegetable%20production" title=" vegetable production"> vegetable production</a> </p> <a href="https://publications.waset.org/abstracts/109624/integrated-vegetable-production-planning-considering-crop-rotation-rules-using-a-mathematical-mixed-integer-programming-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/109624.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">190</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9714</span> Cars Redistribution Optimization Problem in the Free-Float Car-Sharing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amine%20Ait-Ouahmed">Amine Ait-Ouahmed</a>, <a href="https://publications.waset.org/abstracts/search?q=Didier%20Josselin"> Didier Josselin</a>, <a href="https://publications.waset.org/abstracts/search?q=Fen%20Zhou"> Fen Zhou</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Free-Float car-sharing is an one-way car-sharing service where cars are available anytime and anywhere in the streets such that no dedicated stations are needed. This means that after driving a car you can park it anywhere. This car-sharing system creates an imbalance car distribution in the cites which can be regulated by staff agents through the redistribution of cars. In this paper, we aim to solve the car-reservation and agents traveling problem so that the number of successful cars’ reservations could be maximized. Beside, we also tend to minimize the distance traveled by agents for cars redistribution. To this end, we present a mixed integer linear programming formulation for the car-sharing problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=one-way%20car-sharing" title="one-way car-sharing">one-way car-sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=vehicle%20redistribution" title=" vehicle redistribution"> vehicle redistribution</a>, <a href="https://publications.waset.org/abstracts/search?q=car%20reservation" title=" car reservation"> car reservation</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20programming" title=" linear programming"> linear programming</a> </p> <a href="https://publications.waset.org/abstracts/67501/cars-redistribution-optimization-problem-in-the-free-float-car-sharing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67501.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">348</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9713</span> Optimizing Microgrid Operations: A Framework of Adaptive Model Predictive Control</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ruben%20Lopez-Rodriguez">Ruben Lopez-Rodriguez</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In a microgrid, diverse energy sources (both renewable and non-renewable) are combined with energy storage units to form a localized power system. Microgrids function as independent entities, capable of meeting the energy needs of specific areas or communities. This paper introduces a Model Predictive Control (MPC) approach tailored for grid-connected microgrids, aiming to optimize their operation. The formulation employs Mixed-Integer Programming (MIP) to find optimal trajectories. This entails the fulfillment of continuous and binary constraints, all while accounting for commutations between various operating conditions such as storage unit charge/discharge, import/export from/towards the main grid, as well as asset connection/disconnection. To validate the proposed approach, a microgrid case study is conducted, and the simulation results are compared with those obtained using a rule-based strategy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=microgrids" title="microgrids">microgrids</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20logical%20dynamical%20systems" title=" mixed logical dynamical systems"> mixed logical dynamical systems</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed-integer%20optimization" title=" mixed-integer optimization"> mixed-integer optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=model%20predictive%20control" title=" model predictive control"> model predictive control</a> </p> <a href="https://publications.waset.org/abstracts/185228/optimizing-microgrid-operations-a-framework-of-adaptive-model-predictive-control" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/185228.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">54</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20problem&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20problem&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20problem&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20problem&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20problem&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20problem&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20problem&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20problem&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20problem&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20problem&page=324">324</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20problem&page=325">325</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20problem&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>