for Journals by Title or ISSN for Articles by Keywords help
 Subjects -> BUSINESS AND ECONOMICS (Total: 3107 journals)     - ACCOUNTING (88 journals)    - BANKING AND FINANCE (264 journals)    - BUSINESS AND ECONOMICS (1150 journals)    - CONSUMER EDUCATION AND PROTECTION (24 journals)    - COOPERATIVES (4 journals)    - ECONOMIC SCIENCES: GENERAL (166 journals)    - ECONOMIC SYSTEMS, THEORIES AND HISTORY (179 journals)    - FASHION AND CONSUMER TRENDS (13 journals)    - HUMAN RESOURCES (93 journals)    - INSURANCE (23 journals)    - INTERNATIONAL COMMERCE (126 journals)    - INTERNATIONAL DEVELOPMENT AND AID (83 journals)    - INVESTMENTS (27 journals)    - LABOR AND INDUSTRIAL RELATIONS (43 journals)    - MACROECONOMICS (15 journals)    - MANAGEMENT (523 journals)    - MARKETING AND PURCHASING (88 journals)    - MICROECONOMICS (24 journals)    - PRODUCTION OF GOODS AND SERVICES (138 journals)    - PUBLIC FINANCE, TAXATION (34 journals)    - TRADE AND INDUSTRIAL DIRECTORIES (2 journals) BUSINESS AND ECONOMICS (1150 journals)                  1 2 3 4 5 6 | Last
 4OR: A Quarterly Journal of Operations Research   [SJR: 1.073]   [H-I: 25]   [9 followers]  Follow         Hybrid journal (It can contain Open Access articles)    ISSN (Print) 1619-4500 - ISSN (Online) 1614-2411    Published by Springer-Verlag  [2353 journals]
• An $$\ell _{2}$$ ℓ 2 -neighborhood infeasible interior-point algorithm
for linear complementarity problems
• Authors: M. Pirhaji; M. Zangiabadi; H. Mansouri
Pages: 111 - 131
Abstract: Abstract In this paper, we propose an infeasible interior-point algorithm for linear complementarity problems. In every iteration, the algorithm constructs an ellipse and searches an $$\varepsilon$$ -approximate solution of the problem along the ellipsoidal approximation of the central path. The theoretical iteration-complexity of the algorithm is derived and the algorithm is proved to be polynomial with the complexity bound $$O\left(n\log \varepsilon ^{-1}\right)$$ which coincides with the best known iteration bound for infeasible interior-point methods.
PubDate: 2017-06-01
DOI: 10.1007/s10288-016-0325-z
Issue No: Vol. 15, No. 2 (2017)

• Coordinating a supply chain with green innovation in a dynamic setting
• Authors: Qiao Zhang; Jianxiong Zhang; Wansheng Tang
Pages: 133 - 162
Abstract: Abstract This paper addresses the channel coordination problem in a green supply chain consisting of a manufacturer and a retailer, in which the manufacturer controls green innovation and wholes price, while the retailer controls sales price. Pricing and green innovation strategies in integrated and decentralized channels are computed and compared, and a two-part tariff contract is designed to coordinate the decentralized supply chain. A Nash bargaining model is further developed to distribute the extra-profit between channel members. A numerical example is conducted to explore the impacts of green effectiveness and operational inefficiency effect on optimal/equilibrium solutions and coordination. The main results show that the green innovation investment, energy efficiency level and channel profit of integrated channel are larger than those of decentralized one, but the relationship of sales prices under two channel structures depends on system parameters. Green effectiveness exerts a positive effect on optimal/equilibrium solutions. The coordinator’s coordination capability is improved by green effectiveness, but weakened by operational inefficiency effect.
PubDate: 2017-06-01
DOI: 10.1007/s10288-016-0327-x
Issue No: Vol. 15, No. 2 (2017)

• On-off scheduling schemes for power-constrained electric vehicle charging
• Authors: Xavier Fernandes; Joana Rebelo; João Gouveia; Rodrigo Maia; Nuno Bustorff Silva
Pages: 163 - 181
Abstract: Abstract In this paper, we study the problem of establishing a dynamic charging schedule of electric vehicles (EVs) at a charging station, assuming that limited power implies that only a limited number of EVs can charge simultaneously. The only control we assume to be available to the charging station is the ability to (at any given time) turn on or off the power supply to any EV, with this tool we want to develop a charging schedule that will satisfy the energy demands of the EVs in their intended deadlines. We propose two distinct approaches to this problem: a discretized time version, based on a greedy-like algorithm, and a continuous time version, based on linear programming. We compare these two approaches and numerically study the improvement they yield in the efficiency of the charging procedure, when applied to simulated data based on real parking data. Finally, we illustrate the flexibility of the models by sketching several possible extensions.
PubDate: 2017-06-01
DOI: 10.1007/s10288-016-0328-9
Issue No: Vol. 15, No. 2 (2017)

• Improved lower bounds for the online bin stretching problem
Pages: 183 - 199
Abstract: Abstract We use game theory techniques to automatically compute improved lower bounds on the competitive ratio for the bin stretching problem. Using these techniques, we improve the best lower bound for this problem to 19/14. We explain the technique and show that it can be generalized to compute lower bounds for any online or semi-online packing or scheduling problem.
PubDate: 2017-06-01
DOI: 10.1007/s10288-016-0330-2
Issue No: Vol. 15, No. 2 (2017)

• Single-machine time-dependent scheduling problems with fixed
rate-modifying activities and resumable jobs
• Authors: Anna Arigliano; Gianpaolo Ghiani; Antonio Grieco; Emanuela Guerriero
Pages: 201 - 215
Abstract: Abstract In this paper, we deal with single machine scheduling problems subject to time dependent effects. The main point in our models is that we do not assume a constant processing rate during job processing time. Rather, processing rate changes according to a fixed schedule of activities, such as replacing a human operator by a less skilled operator. The contribution of this paper is threefold. First, we devise a time-dependent piecewise constant processing rate model and show how to compute processing time for a resumable job. Second, we prove that any time-dependent continuous piecewise linear processing time model can be generated by the proposed rate model. Finally, we propose polynomial-time algorithms for some single machine problems with job independent rate function. In these procedures the job-independent rate effect does not imply any restriction on the number of breakpoints for the corresponding continuous piecewise linear processing time model. This is a clear element of novelty with respect to the polynomial-time algorithms proposed in previous contributions for time-dependent scheduling problems.
PubDate: 2017-06-01
DOI: 10.1007/s10288-016-0333-z
Issue No: Vol. 15, No. 2 (2017)

• Intelligent management of seaside logistic operations at maritime
container terminals
• Authors: Eduardo Lalla-Ruiz
Pages: 217 - 218
PubDate: 2017-06-01
DOI: 10.1007/s10288-016-0331-1
Issue No: Vol. 15, No. 2 (2017)

• Balancing two-sided U-type assembly lines using modified particle swarm
optimization algorithm
• Authors: Yılmaz Delice; Emel Kızılkaya Aydoğan; Uğur Özcan; Mehmet Sıtkı İlkay
Pages: 37 - 66
Abstract: Abstract In this paper, a new two-sided U-type assembly line balancing (TUALB) procedure and a new algorithm based on the particle swarm optimization algorithm to solve the TUALB problem are proposed. The proposed approach minimizes the number of stations for a given cycle time as the primary objective and it minimizes the number of positions as a secondary objective. The proposed approach is illustrated with an example problem. In order to evaluate the efficiency of the proposed algorithm, the test problems available in the literature are used. The experimental results show that the proposed approach performs well.
PubDate: 2017-03-01
DOI: 10.1007/s10288-016-0320-4
Issue No: Vol. 15, No. 1 (2017)

• Finite approximation for finite-horizon continuous-time Markov decision
processes
• Authors: Qingda Wei
Pages: 67 - 84
Abstract: Abstract In this paper we study the continuous-time Markov decision processes with a denumerable state space, a Borel action space, and unbounded transition and cost rates. The optimality criterion to be considered is the finite-horizon expected total cost criterion. Under the suitable conditions, we propose a finite approximation for the approximate computations of an optimal policy and the value function, and obtain the corresponding error estimations. Furthermore, our main results are illustrated with a controlled birth and death system.
PubDate: 2017-03-01
DOI: 10.1007/s10288-016-0321-3
Issue No: Vol. 15, No. 1 (2017)

• A class of adaptive Dai–Liao conjugate gradient methods based on the
scaled memoryless BFGS update
• Authors: Saman Babaie-Kafaki; Reza Ghanbari
Pages: 85 - 92
Abstract: Abstract Minimizing the distance between search direction matrix of the Dai–Liao method and the scaled memoryless BFGS update in the Frobenius norm, and using Powell’s nonnegative restriction of the conjugate gradient parameters, a one-parameter class of nonlinear conjugate gradient methods is proposed. Then, a brief global convergence analysis is made with and without convexity assumption on the objective function. Preliminary numerical results are reported; they demonstrate a proper choice for the parameter of the proposed class of conjugate gradient methods may lead to promising numerical performance.
PubDate: 2017-03-01
DOI: 10.1007/s10288-016-0323-1
Issue No: Vol. 15, No. 1 (2017)

• Third order duality in nonlinear programming problems
• Authors: S. K. Padhan; C. Nahak
Pages: 93 - 105
Abstract: Abstract Third order dual of a primal nonlinear programming problem is established which involves the third order derivatives of the functions constituting the primal problem. Desired duality theorems are provided for the pair of primal and the corresponding third order dual problem. Numerical examples are illustrated to justify the efficiency of the proposed method. It is also observed that some of the existing results are obtained as special cases.
PubDate: 2017-03-01
DOI: 10.1007/s10288-016-0326-y
Issue No: Vol. 15, No. 1 (2017)

• Authors: Virginie Lurkin
Pages: 107 - 108
PubDate: 2017-03-01
DOI: 10.1007/s10288-016-0322-2
Issue No: Vol. 15, No. 1 (2017)

• Optimizing practical orienteering problems with stochastic time-dependent
travel times: towards congestion free routes
• Authors: Cédric Verbeeck
Pages: 109 - 110
PubDate: 2017-03-01
DOI: 10.1007/s10288-016-0324-0
Issue No: Vol. 15, No. 1 (2017)

• Technology lock-in with horizontal and vertical innovations through
limited R&amp;D spending
• Authors: Anton Bondarev; Alfred Greiner
Abstract: Abstract In this paper we analyze an inter-temporal optimization problem of a representative firm that invests in horizontal and vertical innovations and that faces a constraint with respect to total R&D spending. We find that there can exist two different steady-states of the economy when the amount of research spending falls short of an endogenously determined threshold: one with higher productivities and less new technologies being developed, and the other with more technologies being created and lower productivities. But, for a higher amount of R&D spending the steady-state becomes unique and the firm produces the whole spectrum of available technologies. Thus, a lock-in effect may arise that, however, can be overcome by raising R&D spending sufficiently.
PubDate: 2017-07-29
DOI: 10.1007/s10288-017-0348-0

• The three-dimensional rectangular Multiple Bin Size Bin Packing Problem
with transportation constraints
• Authors: Célia Paquay
PubDate: 2017-07-05
DOI: 10.1007/s10288-017-0347-1

• Erratum to: Approximating the length of Chinese postman tours
• Authors: Nathalie Bostel; Philippe Castagliola; Pierre Dejax; André Langevin
PubDate: 2017-05-27
DOI: 10.1007/s10288-017-0346-2

• Random projections for high-dimensional optimization problems
• Authors: Ky Vu
PubDate: 2017-04-26
DOI: 10.1007/s10288-017-0345-3

• Optimization in liner shipping
• Authors: Berit Dangaard Brouer; Christian Vad Karsten; David Pisinger
Abstract: Abstract Seaborne trade is the lynchpin in almost every international supply chain, and about 90% of non-bulk cargo worldwide is transported by container. In this survey we give an overview of data-driven optimization problems in liner shipping. Research in liner shipping is motivated by a need for handling still more complex decision problems, based on big data sets and going across several organizational entities. Moreover, liner shipping optimization problems are pushing the limits of optimization methods, creating a new breeding ground for advanced modelling and solution methods. Starting from liner shipping network design, we consider the problem of container routing and speed optimization. Next, we consider empty container repositioning and stowage planning as well as disruption management. In addition, the problem of bunker purchasing is considered in depth. In each section we give a clear problem description, bring an overview of the existing literature, and go in depth with a specific model that somehow is essential for the problem. We conclude the survey by giving an introduction to the public benchmark instances LINER-LIB. Finally, we discuss future challenges and give directions for further research.
PubDate: 2017-03-03
DOI: 10.1007/s10288-017-0342-6

• Block rearranging elements within matrix columns to minimize the
variability of the row sums
• Authors: Kris Boudt; Edgars Jakobsons; Steven Vanduffel
Abstract: Abstract Several problems in operations research, such as the assembly line crew scheduling problem and the k-partitioning problem can be cast as the problem of finding the intra-column rearrangement (permutation) of a matrix such that the row sums show minimum variability. A necessary condition for optimality of the rearranged matrix is that for every block containing one or more columns it must hold that its row sums are oppositely ordered to the row sums of the remaining columns. We propose the block rearrangement algorithm with variance equalization (BRAVE) as a suitable method to achieve this situation. It uses a carefully motivated heuristic—based on an idea of variance equalization—to find optimal blocks of columns and rearranges them. When applied to the number partitioning problem, we show that BRAVE outperforms the well-known greedy algorithm and the Karmarkar–Karp differencing algorithm.
PubDate: 2017-03-02
DOI: 10.1007/s10288-017-0344-4

• Heuristics and lower bounds for minimizing fuel consumption in
hybrid-electrical vehicles
• Authors: Sandra Ulrich Ngueveu; Stéphane Caux; Frédéric Messine; Mouloud Guemri
Abstract: Abstract In hybrid electric vehicles, the electrical powertrain system has multiple energy sources that it can gather power from to satisfy the propulsion power requested by the vehicle at each instant. This paper focusses on the minimization of the fuel consumption of such a vehicle, taking advantage of the different energy sources. Based on global optimization approaches, the proposed heuristics find solutions that best split the power requested between the multi-electrical sources available. A lower bounding procedure is introduced to validate the quality of the solutions. Computational results show a significant improvement over previous results from the literature in both the computing time and the quality of the solutions.
PubDate: 2017-03-01
DOI: 10.1007/s10288-017-0343-5

• Models and algorithms for extended network design
• Authors: Alessandro Hill
PubDate: 2016-12-07
DOI: 10.1007/s10288-016-0335-x

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