All Issues

Volume 18, 2022

Volume 17, 2021

Volume 16, 2020

Volume 15, 2019

Volume 14, 2018

Volume 13, 2017

Volume 12, 2016

Volume 11, 2015

Volume 10, 2014

Volume 9, 2013

Volume 8, 2012

Volume 7, 2011

Volume 6, 2010

Volume 5, 2009

Volume 4, 2008

Volume 3, 2007

Volume 2, 2006

Volume 1, 2005

Journal of Industrial and Management Optimization

Open Access Articles

Location and capacity planning for preventive healthcare facilities with congestion effects
Hongzhi Lin, Min Xu and Chi Xie
2022 doi: 10.3934/jimo.2022076 +[Abstract](116) +[HTML](53) +[PDF](429.2KB)

A painful lesson got from pandemic COVID-19 is that preventive healthcare service is of utmost importance to governments since it can make massive savings on healthcare expenditure and promote the welfare of the society. Recognizing the importance of preventive healthcare, this research aims to present a methodology for designing a network of preventive healthcare facilities in order to prevent diseases early. The problem is formulated as a bilevel non-linear integer programming model. The upper level is a facility location and capacity planning problem under a limited budget, while the lower level is a user choice problem that determines the allocation of clients to facilities. A genetic algorithm (GA) is developed to solve the upper level problem and a method of successive averages (MSA) is adopted to solve the lower level problem. The model and algorithm is applied to analyze an illustrative case in the Sioux Falls transport network and a number of interesting results and managerial insights are provided. It shows that solutions to medium-scale instances can be obtained in a reasonable time and the marginal benefit of investment is decreasing.

Optimal control of fish-feeding in a three-dimensional calm freshwater pond considering environmental concern
H. W. J. Lee, Kar Hung Wong and Y. C. E. Lee
2021 doi: 10.3934/jimo.2021213 +[Abstract](396) +[HTML](230) +[PDF](774.28KB)

This paper describes the optimal fish-feeding in a three-dimensional calm freshwater pond based on the concentrations of seven water quality variables. A certain number of baby fishes are inserted into the pond simultaneously. They are then taken out of the pond simultaneously for harvest after having gone through a feeding program. This feeding program creates additional loads of water quality variables in the pond, which becomes pollutants. Thus, an optimal fish-feeding problem is formulated to maximize the final weight of the fishes, subject to the restrictions that the fishes are not under-fed and over-fed and the concentrations of the pollutants created by the fish-feeding program are not too large. A computational scheme using the finite element Galerkin scheme for the three-dimensional cubic domain and the control parameterization method is developed for solving the problem. Finally, a numerical example is solved.

Open-loop solvability for mean-field stochastic linear quadratic optimal control problems of Markov regime-switching system
Kehan Si, Zhenda Xu, Ka Fai Cedric Yiu and Xun Li
2022, 18(4): 2415-2433 doi: 10.3934/jimo.2021074 +[Abstract](1127) +[HTML](516) +[PDF](521.35KB)

This paper investigates the mean-field stochastic linear quadratic optimal control problem of Markov regime switching system (M-MF-SLQ, for short). The representation of the cost functional for the M-MF-SLQ is derived using the technique of operators. It is shown that the convexity of the cost functional is necessary for the finiteness of the M-MF-SLQ problem, whereas uniform convexity of the cost functional is sufficient for the open-loop solvability of the problem. By considering a family of uniformly convex cost functionals, a characterization of the finiteness of the problem is derived and a minimizing sequence, whose convergence is equivalent to the open-loop solvability of the problem, is constructed. We demonstrate with a few examples that our results can be employed for tackling some financial problems such as mean-variance portfolio selection problem.

Free boundary problem for an optimal investment problem with a borrowing constraint
Chonghu Guan, Xun Li, Rui Zhou and Wenxin Zhou
2022, 18(3): 1915-1934 doi: 10.3934/jimo.2021049 +[Abstract](1239) +[HTML](425) +[PDF](442.24KB)

This paper considers an optimal investment problem under CRRA utility with a borrowing constraint. We formulate it into a free boundary problem consisting of a fully nonlinear equation and a linear equation. We prove the existence and uniqueness of the classical solution and present the condition for the existence of the free boundary under a linear constraint on a borrowing rate. Furthermore, we prove that the free boundary is continuous and smooth when the relative risk aversion coefficient is sufficiently small.

Spectral norm and nuclear norm of a third order tensor
Liqun Qi, Shenglong Hu and Yanwei Xu
2022, 18(2): 1101-1113 doi: 10.3934/jimo.2021010 +[Abstract](1220) +[HTML](513) +[PDF](307.74KB)

The spectral norm and the nuclear norm of a third order tensor play an important role in the tensor completion and recovery problem. We show that the spectral norm of a third order tensor is equal to the square root of the spectral norm of three positive semi-definite biquadratic tensors, and the square roots of the nuclear norms of those three positive semi-definite biquadratic tensors are lower bounds of the nuclear norm of that third order tensor. This provides a way to estimate and to evaluate the spectral norm and the nuclear norm of that third order tensor. Some upper and lower bounds for the spectral norm and nuclear norm of a third order tensor, by spectral radii and nuclear norms of some symmetric matrices, are presented.

Two-agent integrated scheduling of production and distribution operations with fixed departure times
Yunqing Zou, Zhengkui Lin, Dongya Han, T. C. Edwin Cheng and Chin-Chia Wu
2022, 18(2): 985-1007 doi: 10.3934/jimo.2021005 +[Abstract](1256) +[HTML](506) +[PDF](408.83KB)

We consider integrated scheduling of production and distribution operations associated with two customers (agents). Each customer has a set of orders to be processed on the single production line at a supplier on a competitive basis. The finished orders of the same customer are then packed and delivered to the customer by a third-party logistics (3PL) provider with a limited number of delivery transporters. The number of orders carried in a delivery transporter cannot exceed its delivery capacity. Each transporter incurs a fixed delivery cost regardless of the number of orders it carries, and departs from the 3PL provider to a customer at fixed times. Each customer desires to minimise a certain optimality criterion involving simultaneously the customer service level and the total delivery cost for its orders only. The customer service level for a customer is related to the times when its orders are delivered to it. The problem is to determine a joint schedule of production and distribution to minimise the objective of one customer, while keeping the objective of the other customer at or below a predefined level. Using several optimality criteria to measure the customer service level, we obtain different scenarios that depend on optimality criterion of each customer. For each scenario, we either devise an efficient solution procedure to solve it or demonstrate that such a solution procedure is impossible to exist.

Solution method for discrete double obstacle problems based on a power penalty approach
Kai Zhang, Xiaoqi Yang and Song Wang
2022, 18(2): 1261-1274 doi: 10.3934/jimo.2021018 +[Abstract](1198) +[HTML](497) +[PDF](741.73KB)

We develop a power penalty approach to a finite-dimensional double obstacle problem. This problem is first approximated by a system of nonlinear equations containing two penalty terms. We show that the solution to this penalized equation converges to that of the original obstacle problem at an exponential rate when the coefficient matrices are \begin{document}$ M $\end{document}-matrices. Numerical examples are presented to confirm the theoretical findings and illustrate the efficiency and effectiveness of the new method.

Research on the parallel–batch scheduling with linearly lookahead model
Chengwen Jiao and Qi Feng
2021, 17(6): 3551-3558 doi: 10.3934/jimo.2020132 +[Abstract](1394) +[HTML](615) +[PDF](315.67KB)

In this paper, we consider the new online scheduling model with linear lookahead intervals, which has the character that at any time \begin{document}$ t $\end{document}, one can foresee the jobs that will coming in the time interval \begin{document}$ (t, \lambda t+\beta ] $\end{document} with \begin{document}$ \lambda\geq1, \beta\geq 0 $\end{document}. We consider online scheduling of unit length jobs on \begin{document}$ m $\end{document} identical parallel-batch machines under this new lookahead model to minimize the maximum flowtime and the makespan, respectively. We give some lower bounds for these problems with the batch capacity \begin{document}$ b = \infty $\end{document} and \begin{document}$ b<\infty $\end{document}, respectively. And for the bounded model to minimize makespan, we give an online algorithm with competitive ratio \begin{document}$ 1+\alpha $\end{document} for \begin{document}$ 1\leq \lambda <4/3, 0\leq \beta\leq \frac{4-3\lambda}{6} $\end{document} and \begin{document}$ \frac{3}{2} $\end{document} for \begin{document}$ \lambda\geq1, 0\leq\beta<1 $\end{document}, where \begin{document}$ \alpha $\end{document} is the positive root of \begin{document}$ \lambda\alpha^2+(\lambda+\beta)\alpha+\beta-1 = 0 $\end{document}. The online algorithm is best possible when \begin{document}$ 1\leq \lambda <4/3, 0\leq \beta\leq \frac{4-3\lambda}{6} $\end{document}.

Tabu search guided by reinforcement learning for the max-mean dispersion problem
Dieudonné Nijimbere, Songzheng Zhao, Xunhao Gu, Moses Olabhele Esangbedo and Nyiribakwe Dominique
2021, 17(6): 3223-3246 doi: 10.3934/jimo.2020115 +[Abstract](1857) +[HTML](729) +[PDF](508.17KB)

We present an effective hybrid metaheuristic of integrating reinforcement learning with a tabu-search (RLTS) algorithm for solving the max–mean dispersion problem. The innovative element is to design using a knowledge strategy from the \begin{document}$ Q $\end{document}-learning mechanism to locate promising regions when the tabu search is stuck in a local optimum. Computational experiments on extensive benchmarks show that the RLTS performs much better than state-of-the-art algorithms in the literature. From a total of 100 benchmark instances, in 60 of them, which ranged from 500 to 1, 000, our proposed algorithm matched the currently best lower bounds for all instances. For the remaining 40 instances, the algorithm matched or outperformed. Furthermore, additional support was applied to present the effectiveness of the combined RL technique. The analysis sheds light on the effectiveness of the proposed RLTS algorithm.

Air-Conditioner Group Power Control Optimization for PV integrated Micro-grid Peak-shaving
Mohammed Al-Azba, Zhaohui Cen, Yves Remond and Said Ahzi
2021, 17(6): 3165-3181 doi: 10.3934/jimo.2020112 +[Abstract](1829) +[HTML](734) +[PDF](1138.12KB)

Heating, Ventilation, and Air-Condition (HVAC) systems are considered to be one of the essential applications for modern human life comfort. Due to global warming and population growth, the demand for such HVAC applications will continue to increase, especially in arid areas countries like the Arabian Gulf region. HVAC systems' energy consumption is very high and accounts for up to 70% of the total load consumption in some rapidly growing GCC countries such as Qatar. Additionally, the local extremely hot weather conditions usually lead to typical power demand peak issues that require adequate mitigation measures to ensure grid stability. In this paper, a novel control scheme for a combined group of Air-Conditioners is proposed as a peak-shaving strategy to address high power demand issues for Photo-Voltaic(PV)-integrated micro-grid applications. Using the local daily ambient temperature as input, the AC group control optimization is formulated as a Mixed-Integer Quadratic Programming (MIQP) problem. Under an acceptable range of indoor temperatures, the units in the same AC group are coordinately controlled to generate desired power consumption performance that is capable of shaving load peaks for both power consumption and PV generation. Finally, various simulations are performed that demonstrate the effectiveness of the proposed control strategy.

Design of LPV fault-tolerant controller for hypersonic vehicle based on state observer
Guangbin CAI, Yang Zhao, Wanzhen Quan and Xiusheng Zhang
2021, 17(1): 447-465 doi: 10.3934/jimo.2019120 +[Abstract](1823) +[HTML](793) +[PDF](1015.28KB)

Considering the parameter uncertainty and actuator failure of hypersonic vehicle during maneuvering, this paper proposes a state observer-based hypersonic vehicle fault-tolerant control (FTC) system design method. Because hypersonic vehicles are prone to failure during maneuvering, the state quantity cannot be measured. First, a state observer-based FTC control method is designed for the linear parameter-varying (LPV) model with parameter uncertainty and partial failure of the actuator. Then, the Lyapunov function is used to demonstrate the asymptotic stability of the closed-loop system. The performance index function proved that the system has robust stability under the disturbance condition. Subsequently, the linear matrix inequality (LMI) was used to solve the observer parameters and the corresponding gain matrix in the control system. The simulation results indicated that the designed controller can track the flight command signal stably and has strong robustness, which verified the effectiveness of the design controller.

Partially shared buffers with full or mixed priority
Thomas Demoor, Dieter Fiems, Joris Walraevens and Herwig Bruneel
2011, 7(3): 735-751 doi: 10.3934/jimo.2011.7.735 +[Abstract](2752) +[PDF](544.2KB)
This paper studies a finite-sized discrete-time two-class priority queue. Packets of both classes arrive according to a two-class discrete batch Markovian arrival process (2-DBMAP), taking into account the correlated nature of arrivals in heterogeneous telecommunication networks. The model incorporates time and space priority to provide different types of service to each class. One of both classes receives absolute time priority in order to minimize its delay. Space priority is implemented by the partial buffer sharing acceptance policy and can be provided to the class receiving time priority or to the other class. This choice gives rise to two different queueing models and this paper analyses both these models in a unified manner. Furthermore, the buffer finiteness and the use of space priority raise some issues on the order of arrivals in a slot. This paper does not assume that all arrivals from one class enter the queue before those of the other class. Instead, a string representation for sequences of arriving packets and a probability measure on the set of such strings are introduced. This naturally gives rise to the notion of intra-slot space priority. Performance of these queueing systems is then determined using matrix-analytic techniques. The numerical examples explore the range of service differentiation covered by both models.
Frame-bound priority scheduling in discrete-time queueing systems
Sofian De Clercq, Koen De Turck, Bart Steyaert and Herwig Bruneel
2011, 7(3): 767-788 doi: 10.3934/jimo.2011.7.767 +[Abstract](3020) +[PDF](432.2KB)
A well-known problem with priority policies is starvation of delay-tolerant traffic. Additionally, insufficient control over delay differentiation (which is needed for modern network applications) has incited the development of sophisticated scheduling disciplines. The priority policy we present here has the benefit of being open to rigorous analysis. We study a discrete-time queueing system with a single server and single queue, in which $N$ types of customers enter pertaining to different priorities. A general i.i.d. arrival process is assumed and service times are generally distributed. We divide the time axis into 'frames' of fixed size (counted as a number of time-slots), and reorder the customers that enter the system during the same frame such that the high-priority customers are served first. This paper gives an analytic approach to studying such a system, and in particular focuses on the system content (meaning the customers of each type in the system at random slotmarks) in stationary regime, and the delay distribution of a random customer. Clearly, in such a system the frame's size is the key factor in the delay differentiation between the $N$ priority classes. The numerical results at the end of this paper illustrate this observation.
Wuyi Yue, Yutaka Takahashi and Hideaki Takagi
2009, 5(3): i-iii doi: 10.3934/jimo.2009.5.3i +[Abstract](2605) +[PDF](41.5KB)
This special issue is a collection of papers selected from the revised and expanded versions of papers presented at the Third Asia-Pacific Symposium on Queueing Theory and Network Applications (QTNA2008), July 30-August 2, 2008, Taipei, Taiwan.
    Included are 10 papers of high quality which were selected from among those contributed papers in QTNA2008. They have all been peer-reviewed by two or more referees according to the normal standard of the journal.
    The special issue aims at publishing high quality papers dealing with performance analysis and system management of communication networks and related systems.

For more information please click the “Full Text” above.
Héctor Cancela, Alfredo Garcia, Irene Loiseau and Andrés L. Medaglia
2009, 5(2): i-ii doi: 10.3934/jimo.2009.5.2i +[Abstract](2703) +[PDF](35.7KB)
This special issue is devoted to showcase selected papers from the XIII CLAIO (Conferencia Latino-Ibero-Americana de Investigación Operativa, the Latin-Ibero- American Conference on Operations Research). This event is the flagship conference of ALIO, the Latin-Ibero-American Operations Research Association. The CLAIO, which is held biennially, is the main meeting point of the Latin-American Operations Research academic community. The event also fosters and features the participation of researchers from all over the world.
   The papers presented in this special issue cover part of the large diversity of subjects covered at CLAIO, ranging from theoretical to applied viewpoints. Over 350 extended abstracts were accepted to the conference, providing novel methodological contributions, models, and algorithms, as well as case studies that illustrate the application of optimization in real-life settings. We are pleased to introduce here a representative set of papers, arising from our selection and the refereeing process.

For more information please click the “Full Text” above.
Xiaoling Sun and Song Wang
2009, 5(1): i-ii doi: 10.3934/jimo.2009.5.1i +[Abstract](2870) +[PDF](38.6KB)
This special issue is a collection of selected papers presented at the 7th International Conference on Optimization: Techniques and Applications (ICOTA 7), which took place from December 12-15, 2007 in Kobe, Japan. ICOTA is an official conference series of POP (The Pacific Optimization Research Activity Group) and ICOTA 7 was organized by the Institute of Intelligent Information and Communications Technology (IICT) of Konan University. The purpose of this tri-annual conference is to provide a forum for international researchers and practitioners to highlight their major advances in optimization techniques and applications since ICOTA 6 held in December, 2004 in Ballarat, Australia.
Over two hundred papers were presented at ICOTA 7. The thirteen papers published in this special issue cover a wide range of topics in optimization techniques and their applications, as outlined below.

For more information please click the "Full Text" above.
Duan Li
2008, 4(3): i-iv doi: 10.3934/jimo.2008.4.3i +[Abstract](2438) +[PDF](76.3KB)
We are very pleased to dedicate this Special Issue of the Journal of Industrial and Management Optimization to Professor Yacov Y. Haimes for his pioneering and significant contributions over forty years to various aspects of systems engineering and risk management including planning, design, management and operation of water resources, transportation and other interdependent infrastructure systems, multiple objective optimization and hierarchical analysis of large-scale systems, as a scholar and educator.
Cheng-Chew Lim and Song Wang
2008, 4(1): i-ii doi: 10.3934/jimo.2008.4.1i +[Abstract](3006) +[PDF](43.1KB)
Optimization and optimal control problems arise in diverse areas such as traditional engineering, natural resource utilization, financial engineering, vehicle route selection and supply chain planning. This special issue contains eight full-length papers reflecting the recent advances in the numerical solution of some complex optimization and optimal control problems. Most of these results were orally presented in the special session entitled 'Optimization and Optimal Control with Applications' of the AIMS' 6th International Conference on Dynamical Systems, Differential Equations and Applications held at University of Poitiers, France from June 25th - 28th, 2006.
Yiju Wang, Xinmin Yang and Yuzhong Zhang
2007, 3(4): i-iv doi: 10.3934/jimo.2007.3.4i +[Abstract](2635) +[PDF](32.6KB)
This special issue is dedicated to Professor Changyu Wang on the occasion of his 70th birthday in recognition of his contributions to Operations Research and its applications and his lasting impact as an educator.
Adil Bagirov
2007, 3(2): i-ii doi: 10.3934/jimo.2007.3.2i +[Abstract](2523) +[PDF](36.2KB)
This special issue of ''Journal of Industrial and Management Optimization'' is dedicated to the memory of Professor Alexander Rubinov.

2021 Impact Factor: 1.411
5 Year Impact Factor: 1.441
2021 CiteScore: 2.1




Email Alert

[Back to Top]