ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (602)
  • Latest Papers from Table of Contents or Articles in Press  (602)
  • Articles: DFG German National Licenses
  • Springer  (602)
  • American Chemical Society (ACS)
  • 2020-2024
  • 2015-2019  (369)
  • 1980-1984  (233)
  • 1970-1974
  • 1965-1969
  • 1935-1939
  • OR Spectrum  (188)
  • 3463
  • Economics  (602)
  • Philosophy
Collection
  • Articles  (602)
Source
  • Latest Papers from Table of Contents or Articles in Press  (602)
  • Articles: DFG German National Licenses
Publisher
  • Springer  (602)
  • American Chemical Society (ACS)
Years
Year
Journal
Topic
  • 1
    facet.materialart.
    Unknown
    Constructive and blocking power in collaborative transportation (2015)
    Springer
    Details
    Publication Date: 2015-08-04
    Description: We empirically investigate constructive and blocking power concepts in transportation planning. Our main question is what do these concepts represent in collaborative transportation. We address it by studying cost allocation and coalition structure problems in a real-world case on forest transportation involving eight companies. The potential savings of collaboration in this case account for about 9 %. We find that players more centrally located tend to benefit from the nucleolus allocation, which takes into account only the constructive power. Other methods, which take into account the blocking power, namely the modiclus and the SM-nucleolus, correct the relative importance of the central players with respect to those in more peripheral areas. The blocking power acknowledges that the more peripheral companies, as a block, are still crucial to the collaboration, despite among themselves they have little opportunities for collaboration. Our main conclusion is that incorporating the blocking power as a criterion in a cost sharing rule for collaborative planning in transportation is important specially in the case where the coalition consists of one or few centrally located companies and several peripheral companies. A method based merely on the constructive power might extremely benefit the central companies, hurting the possibilities of sustaining the coalition.
    Print ISSN: 0171-6468
    Electronic ISSN: 1436-6304
    Topics: Mathematics , Economics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 2
    facet.materialart.
    Unknown
    Quadratic scalarization for decomposed multiobjective optimization (2016)
    Springer
    Details
    Publication Date: 2016-07-10
    Description: Practical applications in multidisciplinary engineering design, business management, and military planning require distributed solution approaches for solving nonconvex, multiobjective optimization problems (MOPs). Under this motivation, a quadratic scalarization method (QSM) is developed with the goal to preserve decomposable structures of the MOP while addressing nonconvexity in a manner that avoids a high degree of nonlinearity and the introduction of additional nonsmoothness. Under certain assumptions, necessary and sufficient conditions for QSM-generated solutions to be weakly and properly efficient for an MOP are developed, with any form of efficiency being understood in a local sense. QSM is shown to correspond with the relaxed, reformulated weighted-Chebyshev method as a special case. An example is provided for demonstrating the application of QSM to a nonconvex MOP.
    Print ISSN: 0171-6468
    Electronic ISSN: 1436-6304
    Topics: Mathematics , Economics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 3
    facet.materialart.
    Unknown
    Scheduling the replenishment of just-in-time supermarkets in assembly plants (2016)
    Springer
    Details
    Publication Date: 2016-07-17
    Description: In recent years, many OEMs, especially in the automotive industry, have installed so-called supermarkets on their shopfloors to feed parts to assembly lines in a flexible and just-in-time manner. Supermarkets are small logistics areas within the factory where parts are intermediately stored to be transferred, often in the form of presorted kits, to nearby workstations frequently and in small lots. While this greatly alleviates inventory concerns at the assembly line, care must be taken that the supermarket itself always be adequately stocked. In this paper, we tackle the problem of determining when which part types should be taken from central receiving storage to the supermarket in what quantities, such that, on the one hand, shopfloor traffic remains manageable, while, on the other hand, inventory costs are not excessive. We formalize the problem, investigate the computational complexity, and develop a bounding procedure as well as a heuristic decomposition approach. Computational tests show that our procedures work very well on instances of realistic size. Moreover, we study the tradeoff inherent in the problem between delivery frequency and in-process inventory.
    Print ISSN: 0171-6468
    Electronic ISSN: 1436-6304
    Topics: Mathematics , Economics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 4
    facet.materialart.
    Unknown
    A metaheuristic solution approach for the time-constrained project scheduling problem (2016)
    Springer
    Details
    Publication Date: 2016-08-05
    Description: In this paper, a metaheuristic solution procedure for the Time-Constrained Project Scheduling Problem is proposed, in which additional resources can be temporarily allocated to meet a given deadline. The problem consists of determining a schedule such that the project is completed on time and that the total additional cost for the resources is minimized. For this problem, an artificial immune system is proposed, in which each solution is represented by a vector of activity start times. A local search procedure, which tries to shift cost causing activities, is applied to each population schedule. Computational experiments are applied to modified resource-constrained project scheduling problem benchmark instances and reveal promising results.
    Print ISSN: 0171-6468
    Electronic ISSN: 1436-6304
    Topics: Mathematics , Economics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 5
    facet.materialart.
    Unknown
    Revenue management approach to due date quoting and scheduling in an assemble-to-order production system (2015)
    Springer
    Details
    Publication Date: 2015-05-09
    Description: In this paper, we consider demand management decisions for an assemble-to-order production system in which both the availability of intermediate material and assembly capacity are limited. For each incoming order, the manufacturer must decide whether to accept it and what due date to quote for an accepted order. The actual assembly dates are still subject to change after these decisions, and a production schedule must be maintained to guarantee that the quoted due dates are met. Therefore, the decisions on accepting orders and quoting due dates must be made with incomplete knowledge of the actual resources used to fulfill the orders. To address these factors, we model this situation and develop a novel revenue management approach using bid prices. An extensive numerical study demonstrates the good performance of the proposed approach in comparison with benchmark algorithms and an ex-post optimal solution applied over a wide range of different supply and demand scenarios. Our results suggest that the consideration of assembly capacity constraints is more vital than the consideration of intermediate material constraints in our test cases.
    Print ISSN: 0171-6468
    Electronic ISSN: 1436-6304
    Topics: Mathematics , Economics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 6
    facet.materialart.
    Unknown
    Approximating multivariate Markov chains for bootstrapping through contiguous partitions (2015)
    Springer
    Details
    Publication Date: 2015-04-26
    Description: This paper extends Markov chain bootstrapping to the case of multivariate continuous-valued stochastic processes. To this purpose, we follow the approach of searching an optimal partition of the state space of an observed (multivariate) time series. The optimization problem is based on a distance indicator calculated on the transition probabilities of the Markov chain. Such criterion aims at grouping those states exhibiting similar transition probabilities. A second methodological contribution is represented by the addition of a contiguity constraint, which is introduced to force the states to group only if they have “near” values (in the state space). This requirement meets two important aspects: first, it allows a more intuitive interpretation of the results; second, it contributes to control the complexity of the problem, which explodes with the cardinality of the states. The computational complexity of the optimization problem is also addressed through the introduction of a novel Tabu Search algorithm, which improves both the quality of the solution found and the computing times with respect to a similar heuristic previously advanced in the literature. The bootstrap method is applied to two empirical cases: the bivariate process of prices and volumes of electricity in the Spanish market; the trivariate process composed of prices and volumes of a US company stock (McDonald’s) and prices of the Dow Jones Industrial Average index. In addition, the method is compared with two other well-established bootstrap methods. The results show the good distributional properties of the present proposal, as well as a clear superiority in reproducing the dependence among the data.
    Print ISSN: 0171-6468
    Electronic ISSN: 1436-6304
    Topics: Mathematics , Economics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 7
    facet.materialart.
    Unknown
    Pricing strategies for the site-dependent vehicle routing problem (2015)
    Springer
    Details
    Publication Date: 2015-04-28
    Description: The vehicle pricing game (VPG) which addresses the vehicles’ viewpoints within a vehicle routing problem (VRP) is introduced. Each vehicle acts as a player who demands a price per kilometer. That is, vehicles represent decentralized actors in transport systems, e.g., carriers under subcontracts. Based on these prices, a VRP is solved and profits are generated. Which price should a vehicle choose to maximize its own profit, considering the competition among vehicles? To answer this question, site dependencies leading to inhomogeneous vehicles are included. More detailed, skill-levels, e.g., relating to the size of a vehicle, are used to indicate a vehicle’s ability to carry out particular services. Moreover, penalty options are added. The VPG serves as an element of a vertical collaboration in a transport scenario and thus provides decision support for cooperative models. Theoretical results for the VPG are provided for a particular case of a two-player ring network game, for which the full set of equilibria is described and their uniqueness is discussed. It is shown that the uniqueness of the higher-skilled vehicle’s payoff is guaranteed even for multiple equilibria. The competition ratio is defined; it restricts a vehicle’s price to keep its competitiveness. Moreover, the acceptance ratio gives a lower bound on prices such that a loss of market share is still accepted. Experimental results are provided for general networks including the analysis of penalty options. It is demonstrated that strict site dependencies by tendency lead to monopolistic structures. In addition, particular penalty types show a positive effect regarding load imbalances caused by universally skilled vehicles.
    Print ISSN: 0171-6468
    Electronic ISSN: 1436-6304
    Topics: Mathematics , Economics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 8
    facet.materialart.
    Unknown
    Sell or store? An ADP approach to marketing renewable energy (2016)
    Springer
    Details
    Publication Date: 2016-04-07
    Description: In deregulated markets, electricity is usually traded in advance, and the advance commitments have a time lag of several periods. For example, in the German intraday market, the seller commits to providing electricity 45 min before the 15-min interval in which delivery has to be made. We consider the problem of a producer that generates energy from stochastic, renewable sources, such as solar or wind and uses a storage device with conversion losses. We model the problem as a Markov Decision Process and consider lagged commitments for the first time in the literature. The problem is solved using an innovative approximate dynamic programming approach. Its key elements are the analytical derivation of the optimal action based on the value function approximation and a new combination of approximate policy iteration with classical backward induction. The new approach is quite general with regard to the stochastic processes describing the energy production and price evolution. We demonstrate the application of our approach by considering a wind farm/storage combination. A numerical study using real-world data shows the applicability and performance of the new approach and investigates how the storage device’s parameters influence profit.
    Print ISSN: 0171-6468
    Electronic ISSN: 1436-6304
    Topics: Mathematics , Economics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 9
    facet.materialart.
    Unknown
    Combining stochastic programming and optimal control to decompose multistage stochastic optimization problems (2016)
    Springer
    Details
    Publication Date: 2016-01-08
    Description: The paper suggests a possible cooperation between stochastic programming and optimal control for the solution of multistage stochastic optimization problems. We propose a decomposition approach for a class of multistage stochastic programming problems in arborescent form (i.e. formulated with implicit non-anticipativity constraints on a scenario tree). The objective function of the problem can be either linear or nonlinear, while we require that the constraints are linear and involve only variables from two adjacent periods (current and lag 1). The approach is built on the following steps. First, reformulate the stochastic programming problem into an optimal control one. Second, apply a discrete version of Pontryagin maximum principle to obtain optimality conditions. Third, discuss and rearrange these conditions to obtain a decomposition that acts both at a time stage level and at a nodal level. To obtain the solution of the original problem we aggregate the solutions of subproblems through an enhanced mean valued fixed point iterative scheme.
    Print ISSN: 0171-6468
    Electronic ISSN: 1436-6304
    Topics: Mathematics , Economics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
  • 10
    facet.materialart.
    Unknown
    Editorial “Project Management and Scheduling” (2016)
    Springer
    Details
    Publication Date: 2016-03-05
    Print ISSN: 0171-6468
    Electronic ISSN: 1436-6304
    Topics: Mathematics , Economics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...