for Journals by Title or ISSN for Articles by Keywords help
 Subjects -> BUSINESS AND ECONOMICS (Total: 3283 journals)     - ACCOUNTING (102 journals)    - BANKING AND FINANCE (279 journals)    - BUSINESS AND ECONOMICS (1210 journals)    - CONSUMER EDUCATION AND PROTECTION (23 journals)    - COOPERATIVES (4 journals)    - ECONOMIC SCIENCES: GENERAL (184 journals)    - ECONOMIC SYSTEMS, THEORIES AND HISTORY (199 journals)    - FASHION AND CONSUMER TRENDS (13 journals)    - HUMAN RESOURCES (97 journals)    - INSURANCE (26 journals)    - INTERNATIONAL COMMERCE (135 journals)    - INTERNATIONAL DEVELOPMENT AND AID (90 journals)    - INVESTMENTS (22 journals)    - LABOR AND INDUSTRIAL RELATIONS (46 journals)    - MACROECONOMICS (17 journals)    - MANAGEMENT (542 journals)    - MARKETING AND PURCHASING (95 journals)    - MICROECONOMICS (23 journals)    - PRODUCTION OF GOODS AND SERVICES (138 journals)    - PUBLIC FINANCE, TAXATION (36 journals)    - TRADE AND INDUSTRIAL DIRECTORIES (2 journals) BUSINESS AND ECONOMICS (1210 journals)                  1 2 3 4 5 6 7 | Last
 Annals of Operations ResearchJournal Prestige (SJR): 0.943 Citation Impact (citeScore): 2Number of Followers: 10      Hybrid journal (It can contain Open Access articles) ISSN (Print) 1572-9338 - ISSN (Online) 0254-5330 Published by Springer-Verlag  [2350 journals]
• Recent advances in optimization theory and applications (RAOTA-2016)
• Authors: Pankaj Gupta; Riccardo Cambini; S. S. Appadoo
Pages: 1 - 2
PubDate: 2018-10-01
DOI: 10.1007/s10479-018-2984-y
Issue No: Vol. 269, No. 1-2 (2018)

• A reduced formulation for pseudoinvex vector functions
• Authors: Manuel Arana-Jiménez; Riccardo Cambini; Laura Carosi
Pages: 21 - 27
Abstract: Abstract Vector pseudoinvexity is characterized in the current literature by means of a suitable functional which depends on two variables. In this paper, vector pseudoinvexity is characterized by means of a functional which depends on one variable only. For this very reason, the new characterizing conditions are easier to be verified.
PubDate: 2018-10-01
DOI: 10.1007/s10479-016-2372-4
Issue No: Vol. 269, No. 1-2 (2018)

• Worm optimization for the multiple level warehouse layout problem
• Authors: Jean-Paul Arnaout
Pages: 29 - 51
Abstract: Abstract In this paper, the NP-complete multiple level warehouse layout problem is addressed. The problem consists of assigning items to cells and levels with the objective of minimizing transportation costs. A worm optimization algorithm (WO) is introduced, based on the foraging behaviors of Caenorhabditis elegans (Worms), and its performance was assessed by comparing with a genetic algorithm (GA), ant colony optimization (ACO), and an exact solution (B&B) for small problems. The computational results reflected the superiority of WO in large problems, with a marginally better performance than ACO and GA in smaller ones, while solving the tested problems within a reasonable computational time. Furthermore, WO was able to attain most of the known optimal solutions.
PubDate: 2018-10-01
DOI: 10.1007/s10479-017-2683-0
Issue No: Vol. 269, No. 1-2 (2018)

• Variational principles, completeness and the existence of traps in
behavioral sciences
• Authors: T. Q. Bao; S. Cobzaş; A. Soubeyran
Pages: 53 - 79
Abstract: Abstract In this paper, driven by Behavioral applications to human dynamics, we consider the characterization of completeness in pseudo-quasimetric spaces in term of a generalization of Ekeland’s variational principle in such spaces, and provide examples illustrating significant improvements to some previously obtained results, even in complete metric spaces. At the behavioral level, we show that the completeness of a space is equivalent to the existence of traps, rather easy to reach (in a worthwhile way), but difficult (not worthwhile to) to leave. We first establish new forward and backward versions of Ekeland’s variational principle for the class of strict-decreasingly forward (resp. backward)-lsc functions in pseudo-quasimetric spaces. We do not require that the space under consideration either be complete or to enjoy the limit uniqueness property since, in a pseudo-quasimetric space, the collections of forward-limits and backward ones of a sequence, in general, are not singletons.
PubDate: 2018-10-01
DOI: 10.1007/s10479-016-2368-0
Issue No: Vol. 269, No. 1-2 (2018)

• Satisficing data envelopment analysis: a Bayesian approach for peer mining
in the banking sector
• Authors: Vincent Charles; Ioannis E. Tsolas; Tatiana Gherman
Pages: 81 - 102
Abstract: Abstract Over the past few decades, the banking sectors in Latin America have undergone rapid structural changes to improve the efficiency and resilience of their financial systems. The up-to-date literature shows that all the research studies conducted to analyze the above-mentioned efficiency are based on a deterministic data envelopment analysis (DEA) model or econometric frontier approach. Nevertheless, the deterministic DEA model suffers from a possible lack of statistical power, especially in a small sample. As such, the current research paper develops the technique of satisficing DEA to examine the still less explored case of Peru. We propose a Satisficing DEA model applied to 14 banks operating in Peru to evaluate the bank-level efficiency under a stochastic environment, which is free from any theoretical distributional assumption. The proposed model does not only report the bank efficiency, but also proposes a new framework for peer mining based on the Bayesian analysis and potential improvements with the bias-corrected and accelerated confidence interval. Our study is the first of its kind in the literature to perform a peer analysis based on a probabilistic approach.
PubDate: 2018-10-01
DOI: 10.1007/s10479-017-2552-x
Issue No: Vol. 269, No. 1-2 (2018)

• A hybrid FA–SA algorithm for fuzzy portfolio selection with
transaction costs
• Authors: Wei Chen; Yun Wang; Mukesh Kumar Mehlawat
Pages: 129 - 147
Abstract: Abstract Based on possibility theory, this paper deals with the portfolio adjusting problem for an existing portfolio under the assumption that the returns of risky assets are fuzzy numbers and there exists transaction costs in portfolio adjusting process. We propose a possibilistic mean-semi-absolute deviation portfolio model with V-shaped transaction costs, which are associated with a shift from the current portfolio to an adjusted one. In the proposed model, we take the possibilistic mean of the return as the investment return and possibilistic semi-absolute deviation of the return as the investment risk. To solve the proposed portfolio problem, a hybrid technique named as FA–SA algorithm combining firefly algorithm (FA) and simulated annealing algorithm (SA) is developed by taking the advantage of both FA and SA. In this algorithm, FA operates in the direction of enhancing the exploitation ability while SA improves the exploration using the lévy flight. Finally, a numerical example is given to demonstrate the effectiveness of the proposed model and the hybrid algorithm.
PubDate: 2018-10-01
DOI: 10.1007/s10479-016-2365-3
Issue No: Vol. 269, No. 1-2 (2018)

• Pointwise and global well-posedness in set optimization: a direct approach
• Authors: Giovanni P. Crespi; Mansi Dhingra; C. S. Lalitha
Pages: 149 - 166
Abstract: Abstract The aim of this paper is to characterize some of the pointwise and global well-posedness notions available in literature for a set optimization problem completely by compactness or upper continuity of an appropriate minimal solution set maps. The characterizations of compactness of set-valued maps, lead directly to many characterizations for well-posedness. Sufficient conditions are also given for global well-posedness.
PubDate: 2018-10-01
DOI: 10.1007/s10479-017-2709-7
Issue No: Vol. 269, No. 1-2 (2018)

• The multiple lot sizing problem of a serial production system with
interrupted geometric yields, rigid demand and Pentico’s heuristic
• Authors: Sy-Ming Guu; Chun-Yi Lin
Pages: 167 - 183
Abstract: Abstract We consider the optimal lot sizing decision problem for a serial production system with the interrupted geometric yields and rigid demand. Such decisions are well-known for analytical difficulty due to often complicated cost expressions and necessity of deciding optimal lotsizes to stages/machines in the system. Pentico proposed a simple and effective heuristic that all usable items exiting a stage will be processed at the next stage till the end of the system. Pentico’s heuristic requires only the decision on the initial lot size. Based on Pentico’s heuristic, Bez-Zvi and Grosfeld-Nir considered the optimal “P-policies” to yield an optimal initial lot size so as to minimize the expected cost of the system while fulfilling the order. They showed the optimal initial lot size is always smaller than or equal to the outstanding demand. In this paper, we provide a finite upper bound and narrow searching range for the optimal initial lot sizes. It is well known that the worst case for minimizing the expected cost is to have an optimal initial lotsize equal to 1 for any outstanding demand. We characterize conditions in terms of the average expected costs for the worst case of the production system. An efficient algorithm for finding the optimal initial lot size is given which utilizes the recursive feature among the expected cost elements. For intellectual curiosity, we study a two-stage serial production system with a uniform yield in stage 1 and an interrupted geometric yield in stage 2. We propose an algorithm to derive an optimal initial lot size to enter this two-stage problem under Pentico’s heuristic. We show that for small outstanding demands (equal to 1 or 2) the optimal initial lot sizes are often greater than the outstanding demands. We prove that for large outstanding demands the optimal initial lot sizes are smaller than or equal to the outstanding demands. We also prove the existence of a finite upper bound for all optimal initial lot sizes. Our numerical example illustrates the existence of a threshold such that if the demand is smaller (greater) than it then the optimal lot size is larger (smaller) than the demand. Our analysis and numerical observation are very interesting to contrast with the most commonly seen binomial or uniform yield settings that the optimal lot size is always larger than the outstanding demand while for interrupted geometric yield the optimal lot size is always smaller than the outstanding demand.
PubDate: 2018-10-01
DOI: 10.1007/s10479-017-2558-4
Issue No: Vol. 269, No. 1-2 (2018)

• An emergency logistics distribution routing model for unexpected events
• Authors: Xiaoxia Huang; Liying Song
Pages: 223 - 239
Abstract: Abstract Though there are many specialities of logistics distribution in unexpected events, the greatest uniqueness of the problem should be the feature that no historical data about some parameters are available. The paper defines the emergency logistics as the one of which the parameters have no historical data due to the occurrence of the unexpected events, and discusses an emergency logistics distribution routing problem in which demands of the affected areas and road travel times lack historical data and are given by experts’ estimations. Uncertain variables are used to describe the experts’ estimates of the parameters and the use of them is justified. An emergency logistics distribution routing model is developed based on uncertainty theory. To solve the problem, the equivalent model is provided and a cellular genetic algorithm is designed. In addition, an example is presented to illustrate the application of the proposed model and the effectiveness of the proposed algorithm.
PubDate: 2018-10-01
DOI: 10.1007/s10479-016-2300-7
Issue No: Vol. 269, No. 1-2 (2018)

• How to assess sustainability of suppliers in the presence of volume
discount and negative data in data envelopment analysis'
Pages: 241 - 267
Abstract: Abstract Supplier selection is an important decision-making problem in supply chain management. Selecting appropriate suppliers based on sustainability criteria including economic, environmental, and social criteria can help companies move toward sustainable development. Data envelopment analysis (DEA) is applied to recognize the most sustainable supplier. However, conventional DEA models can be applied only to performance measurement systems characterized by positive input–output data. However, in real world, data can be negative. We propose a new DEA model for evaluating sustainability of suppliers in presence of negative data and volume discounts. Also, we present a super-efficiency model for ranking suppliers. In addition, we prove some main properties of our proposed method. Finally, we present a case study to demonstrate applicability of proposed model.
PubDate: 2018-10-01
DOI: 10.1007/s10479-018-2790-6
Issue No: Vol. 269, No. 1-2 (2018)

• Characterization of weakly sharp solutions of a variational-type
inequality with convex functional
• Authors: Anurag Jayswal; Shipra Singh
Pages: 297 - 315
Abstract: Abstract In this paper, we consider a variational-type inequality and study its weak sharp solutions in terms of a dual gap function, under certain assumptions and convex notion of a functional. Moreover, we aim to constitute the relationship between the minimum principle sufficiency property and weak sharp solutions of the considered variational-type inequality. A numerical result is also constructed to give a better insight for the main derived result.
PubDate: 2018-10-01
DOI: 10.1007/s10479-017-2700-3
Issue No: Vol. 269, No. 1-2 (2018)

• Multi-period media planning for multi-products incorporating segment
specific and mass media
• Authors: Arshia Kaul; Sugandha Aggarwal; Mohan Krishnamoorthy; P. C. Jha
Pages: 317 - 359
Abstract: Abstract Efficient budget allocation between different communication channels is one of the fundamental activities of any media planner. In this paper, we attempt to develop a multi-objective integer linear programming model to determine the optimal schedule of advertisements for a set of multiple products of a firm in a segmented market (influenced by both mass and segment-specific media) over a planning horizon. The objectives are to maximize the gross impressions of advertisements and simultaneously minimize the advertising expenditure. To incorporate continuous changes that occur in the market, the total planning horizon is divided into shorter time periods and decisions for each of the subsequent time periods are taken, bearing in mind the changes that have occurred in the preceding time periods. Based on the gap that exists in the extant literature, we also jointly consider, in our model, the notions of (a) carry-over effect of gross impressions, (b) spectrum effect of mass media on segments, and (c) cross-product effect. The model is solved through a goal programming approach to achieve the best trade-off between the conflicting objectives. Further, the model could be adapted to provide solutions in a wide variety of real-life situations. This is substantiated via a numerical analysis for a firm that advertises products in the Indian market through mass and segment-specific media.
PubDate: 2018-10-01
DOI: 10.1007/s10479-018-2771-9
Issue No: Vol. 269, No. 1-2 (2018)

• Angle-based twin support vector machine
• Authors: Reshma Khemchandani; Pooja Saigal; Suresh Chandra
Pages: 387 - 417
Abstract: Abstract In this paper, a novel nonparallel hyperplane based classifier termed as “angle-based twin support vector machine” (ATWSVM) has been proposed which is motivated by the concept of twin support vector machine (TWSVM). TWSVM obtains two nonparallel hyperplanes by solving a pair of quadratic programming problems (QPPs). ATWSVM presents a generic classification model, where the first problem can be formulated using a TWSVM-based classifier and the second problem is an unconstrained minimization problem (UMP) which is reduced to solving a system of linear equations. The second hyperplane is determined so that it is proximal to its own class and the angle between the normals to the two hyperplanes is maximized. The notion of angle has been introduced to have maximum separation between the two hyperplanes. In this work, we have presented two versions of ATWSVM: one that solves a QPP and a UMP; second which formulates both the problems as UMPs. The training time of ATWSVM is much less than that of TWSVM because ATWSVM solves the second problem as UMP instead of QPP. To test the efficacy of the proposed classifier, experiments have been conducted on synthetic and benchmark datasets and it is observed that the proposed classifier achieves classification accuracy comparable or better than that of TWSVM. This work also proposes application of ATWSVM for color image segmentation.
PubDate: 2018-10-01
DOI: 10.1007/s10479-017-2604-2
Issue No: Vol. 269, No. 1-2 (2018)

• On optimality conditions and duality theorems for robust semi-infinite
multiobjective optimization problems
• Authors: Jae Hyoung Lee; Gue Myung Lee
Pages: 419 - 438
Abstract: Abstract In this paper, we consider a semi-infinite multiobjective optimization problem with more than two differentiable objective functions and uncertain constraint functions, which is called a robust semi-infinite multiobjective optimization problem and give its robust counterpart $${\mathrm{(RSIMP)}}$$ of the problem, which is regarded as the worst case of the uncertain semi-infinite multiobjective optimization problem. We prove a necessary optimality theorem for a weakly robust efficient solution of $${\mathrm{(RSIMP)}}$$ , and then give a sufficient optimality theorem for a weakly robust efficient solution of $${\mathrm{(RSIMP)}}$$ . We formulate a Wolfe type dual problem of $${\mathrm{(RSIMP)}}$$ and give duality results which hold between $${\mathrm{(RSIMP)}}$$ and its dual problem.
PubDate: 2018-10-01
DOI: 10.1007/s10479-016-2363-5
Issue No: Vol. 269, No. 1-2 (2018)

• Developing a new stochastic model considering bi-directional relations in
a natural disaster: a possible earthquake in Tehran (the Capital of
Islamic Republic of Iran)
Pages: 439 - 473
Abstract: Abstract Timely, effective delivery of relief resources to the sufferers in a natural disaster is quite crucial. All governments especially those having high risk of natural disasters must have a comprehensive and implementable plan to suitably manage humanitarian issues after a natural disaster occurs. They should construct sufficient facilities and prepare and store enough relief items (e.g., tents, medical packages, and meals) to be able to quickly respond to necessary needs of injured and homeless people; otherwise, it might lead to humanitarian crises with high numbers of casualties. In this study, we extend the mathematical two-stage stochastic optimization model proposed by Mete and Zabinsky (Int J Prod Econ 126:76–84, 2010) simultaneously considering two phases: pre- and post-disaster. All decisions pertinent to the pre-disaster phase, such as the locations of warehouse and pre-positioned relief items, should be taken in the first stage; however, other decisions pertinent to the post-disaster phase, such as the allocations of warehouses to the demanding points are taken in the second stage. In this study, we consider bi-directional relations between warehouses, which can increase the flexibility of the constructed network to handle the needs of injured people in a shorter time interval. Furthermore, whereas the relief process should be implemented within a specific time interval (e.g., 3 days), our extended optimization model is constructed for a multi-period and multi-product situation. We construct the extended model based on a professional report prepared by the Japanese International Cooperation Agency in a study of the seismic micro zoning of Tehran on April 13, 1999. The respective data in this report has also been updated based on the reports of Tehran Municipality to be matched with the current situation of Tehran. The results of our extended multi-period model for the respective real case study in this paper verify suitable responses and better services to the affected areas compared to what are provided through the respective single-period optimization model.
PubDate: 2018-10-01
DOI: 10.1007/s10479-017-2596-y
Issue No: Vol. 269, No. 1-2 (2018)

• Optimality conditions and duality for semi-infinite mathematical
programming problems with equilibrium constraints, using convexificators
• Authors: Yogendra Pandey; S. K. Mishra
Pages: 549 - 564
Abstract: Abstract In this paper, we consider semi-infinite mathematical programming problems with equilibrium constraints (SIMPEC). We establish necessary and sufficient optimality conditions for the SIMPEC, using convexificators. We study the Wolfe type dual problem for the SIMPEC under the $$\partial ^{*}$$ -convexity assumption. A Mond–Weir type dual problem is also formulated and studied for the SIMPEC under the $$\partial ^{*}$$ -convexity, $$\partial ^{*}$$ -pseudoconvexity and $$\partial ^{*}$$ -quasiconvexity assumptions. Weak duality theorems are established to relate the SIMPEC and two dual programs in the framework of convexificators. Further, strong duality theorems are obtained under generalized standard Abadie constraint qualification.
PubDate: 2018-10-01
DOI: 10.1007/s10479-017-2422-6
Issue No: Vol. 269, No. 1-2 (2018)

• Efficiency analysis of non-homogeneous parallel sub-unit systems for the
performance measurement of higher education
• Authors: Sanjeet Singh; Prabhat Ranjan
Pages: 641 - 666
Abstract: Abstract Conventional Data Envelopment Analysis (DEA) models focus only on initial inputs and final outputs for efficiency evaluation. Thus, these models treat the production process as a ‘black box’, i.e., they do not take into account how exactly inputs are related to outputs. Various models that came later take care of internal processes of DMU. The existing models of internal processes for parallel sub-units consist of three stages: the first stage calculates the relative weights of sub-units, the second stage calculates the efficiencies of sub-units, and in the third stage efficiencies of sub-units are aggregated as the efficiency of DMU. It is observed that when existing models of internal processes are applied to non-homogeneous parallel sub-units, in the first stage, the weight assigned to the maximum efficient sub-unit is one and to other sub-units is zero. This implies that the efficiency of a DMU is equal to the maximum of efficiencies of its sub-units indicating that the efficiency of a DMU is not sensitive to the efficiencies of sub-units other than the sub-unit with maximum efficiency. This paper proposes a single stage DEA approach where the efficiency of a DMU and its sub-units can be measured simultaneously. The advantage of the proposed approach is that the efficiency of a DMU is sensitive to the changes in the efficiency of its sub-units, and weights of sub-units can be assigned a priori by the decision maker. The development of the proposed approach is inspired from the growing interest in evaluating efficiency of higher education system in India. In the proposed application, states are considered as DMUs and universities, colleges and stand-alone institutions are taken as three non-homogeneous parallel sub-units of DMUs.
PubDate: 2018-10-01
DOI: 10.1007/s10479-017-2586-0
Issue No: Vol. 269, No. 1-2 (2018)

• Directionally generalized differentiation for multifunctions and
applications to set-valued programming problems
• Authors: Vo Duc Thinh; Thai Doan Chuong
Pages: 727 - 751
Abstract: Abstract The aim of this work is twofold. First, we establish sum rules for the directionally coderivatives of multifunctions and intersection rules for the directionally limiting normal cones. Then, we apply the provided formulas to derive directionally necessary conditions for a set-valued optimization problem with equilibrium constraints.
PubDate: 2018-10-01
DOI: 10.1007/s10479-017-2400-z
Issue No: Vol. 269, No. 1-2 (2018)

• A meta-heuristic for capacitated green vehicle routing problem
• Authors: Shuai Zhang; Yuvraj Gajpal; S. S. Appadoo
Pages: 753 - 771
Abstract: Abstract The capacitated green vehicle routing problem is considered in this paper as a new variant of the vehicle routing problem. In this problem, alternative fuel-powered vehicles (AFVs) are used for distributing products. AFVs are assumed to have low fuel tank capacity. Therefore, during their distribution process, AFVs are required to visit alternative fuel stations (AFSs) for refueling. The design of the vehicle routes for AFVs becomes difficult due to the limited loading capacity, the low fuel tank capacity and the scarce availability of AFSs. Two solution methods, the two-phase heuristic algorithm and the meta-heuristic based on ant colony system, are proposed to solve the problem. The numerical experiment is performed on the randomly generated problem instances to evaluate the performance of the proposed algorithms.
PubDate: 2018-10-01
DOI: 10.1007/s10479-017-2567-3
Issue No: Vol. 269, No. 1-2 (2018)

• A multi-release software reliability modeling for open source software
incorporating dependent fault detection process
• Authors: Mengmeng Zhu; Hoang Pham
Pages: 773 - 790
Abstract: Abstract The increasing dependence of our modern society on software systems has driven the development of software products become even more competitive and time-consuming. Single release software product no longer meets the increasing market requirements. Thereby it is important to release multiple version software products in order to add new features in the next release and fix remaining faults from previous release. In this paper, we develop a multi-release software reliability model with consideration of the remaining software faults from previous release and the new introduced-faults (from newly added features). Additionally, dependent fault detection process is taken into account in this research. In particular, the detection of a new fault for developing the next release depends on the detection of the remaining faults from previous release and the detection of the new introduced-faults. The proposed model is validated on the open source software project datasets with multiple releases.
PubDate: 2018-10-01
DOI: 10.1007/s10479-017-2556-6
Issue No: Vol. 269, No. 1-2 (2018)

JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327

Home (Search)
Subjects A-Z
Publishers A-Z
Customise
APIs