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  (172)
  • Latest Papers from Table of Contents or Articles in Press  (172)
  • Articles: DFG German National Licenses
  • Springer  (172)
  • American Chemical Society (ACS)
  • Blackwell Publishing Ltd
  • Periodicals Archive Online (PAO)
  • Wiley
  • 2020-2024
  • 2015-2019  (72)
  • 1980-1984  (100)
  • 1970-1974
  • 1965-1969
  • 1935-1939
  • 2020
  • 2018  (72)
  • 1984  (54)
  • 1981  (46)
  • 1965
  • OR Spectrum  (31)
  • 3463
  • Economics  (172)
  • Political Science
  • Sociology
Collection
  • Articles  (172)
Source
  • Latest Papers from Table of Contents or Articles in Press  (172)
  • Articles: DFG German National Licenses
Publisher
  • Springer  (172)
  • American Chemical Society (ACS)
  • Blackwell Publishing Ltd
  • Periodicals Archive Online (PAO)
  • Wiley
Years
  • 2020-2024
  • 2015-2019  (72)
  • 1980-1984  (100)
  • 1970-1974
  • 1965-1969
    • +
Year
Journal
Topic
  • Economics  (172)
  • Political Science
  • Sociology
  • Mathematics  (172)
  • 1
    facet.materialart.
    Unknown
    Bi-criteria path problem with minimum length and maximum survival probability (2018)
    Springer
    Details
    Publication Date: 2018
    Description: 〈h3〉Abstract〈/h3〉 〈p〉We study a bi-criteria path problem on a directed multigraph with cycles, where each arc is associated with two parameters. The first is the survival probability of moving along the arc, and the second is the length of the arc. We evaluate the quality of a path by two independent criteria. The first is to maximize the survival probability along the entire path, which is the product of the arc probabilities, and the second is to minimize the total path length, which is the sum of the arc lengths. We prove that the problem of finding a path which satisfies two bounds, one for each criterion, is NP-complete, even in the acyclic case. We further develop approximation algorithms for the optimization versions of the studied problem. One algorithm is based on approximate computing of logarithms of arc probabilities, and the other two are fully polynomial time approximation schemes (FPTASes). One FPTAS is based on scaling and rounding of the input, while the other FPTAS is derived via the method of 〈em〉K〈/em〉-approximation sets and functions, introduced by Halman et al. (Math Oper Res 34:674–685, 〈span〉2009〈/span〉).〈/p〉
    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
    A hybrid algorithm for the vehicle routing problem with backhauls, time windows and three-dimensional loading constraints (2018)
    Springer
    Details
    Publication Date: 2018
    Description: 〈h3〉Abstract〈/h3〉 〈p〉This paper deals with a special vehicle routing problem with backhauls where customers may want to receive items from a depot and, at the same time, return items back to the depot. Moreover, time windows are assumed and three-dimensional loading constraints are to be observed, i.e. the items are three-dimensional boxes and packing constraints, e.g. regarding load stability, are to be met. The resulting problem is the vehicle routing problem with simultaneous delivery and pickup (VRPSDP), time windows and three-dimensional loading constraints (3L-VRPSDPTW). This problem occurs, for example, if retail stores are supplied by a central warehouse and wish to return packaging material. A particular challenge of the problem consists of transporting delivery and pickup items simultaneously on the same vehicle. In order to avoid any reloading effort during a tour, we consider two different approaches for loading the vehicles: (i) loading from the back with separation of the loading space into a delivery section and a pickup section and (ii) loading from the (long) side. A hybrid algorithm is proposed for the 3L-VRPSDPTW consisting of an adaptive large neighbourhood search for the routing and different packing heuristics for the loading part of the problem. Extensive numerical experiments are conducted with VRPSDP instances from the literature and newly generated instances for the 3L-VRPSDPTW.〈/p〉
    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
    Production Control with Price, Cost, and Demand Uncertainty (2018)
    Springer
    Details
    Publication Date: 2018
    Description: 〈h3〉Abstract〈/h3〉 〈p〉An optimal production flow control problem of a make-to-stock manufacturing firm with price, cost, and demand uncertainty is studied. The objective of the flow rate control problem is maximizing the average profit that is the difference between the expected revenue and the expected production, inventory holding, and backlog costs. The uncertainties in the system are captured jointly in discrete environment states. In each environment state, the price, cost, and demand take different levels. The transitions between different environment states evolve according to a time-homogenous Markov chain. By using a continuous flow model, the optimal production policy is stated as a state-dependent hedging policy. The performance of the system where the production cost alternates between a high and a low cost level and the demand is either constant or also alternates between a high and a low level is analyzed under the double-hedging policy. According to this policy, the producer produces only when the cost is low and the surplus is between the two hedging levels. However when the backlog is below the lower hedging level, the producer produces with the maximum capacity regardless of the cost. The effects of production cost, production capacity, demand variability, and the dependence of the demand and the cost on the performance of the system are analyzed analytically and numerically. It is shown that controlling the production rate optimally allows producers respond to the fluctuations in price, cost, and demand in an effective way and maximize their profits.〈/p〉
    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
    Capacitated ring arborescence problems with profits (2018)
    Springer
    Details
    Publication Date: 2018
    Description: 〈h3〉Abstract〈/h3〉 〈p〉In this work, we introduce profit-oriented capacitated ring arborescence problems and present exact and heuristic algorithms. These combinatorial network design problems ask for optimized bi-level networks taking into account arc costs and node profits. Solutions combine circuits on the inner level with arborescences on the outer level of the networks. We consider the prize-collecting, the budget-constrained and the target-profit models and develop corresponding exact branch-and-cut algorithms based on mixed-integer formulations and valid inequalities. Iterated local search heuristics based on the exploration of problem-specific neighborhoods are elaborated to strengthen the upper bounds. For a set of hard literature derived instances with up to 51 nodes, we provide computational results which give evidence for the efficiency of the proposed approaches. Furthermore, we extensively analyze the performance of our methods, the obtained solution networks and the impact of the cutting planes on the obtained lower bounds.〈/p〉
    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
    Organ transplantation logistics: a case for Turkey (2018)
    Springer
    Details
    Publication Date: 2018
    Description: 〈h3〉Abstract〈/h3〉 〈p〉Logistics is one of the key elements of organ transplantation operations. In this study, maximizing the potential compatible donor–recipient matches within the cold ischemia time bounds (duration that an organ can survive without blood supply) is the main problem that is addressed. While addressing this problem, the effects of clustering structures on the potential organ matches are investigated. We analyze Turkey’s organ transplantation logistics structure based on its dynamics and provide new mathematical models for maximizing potential-weighted intra-regional organ transplantation flow via evaluating different types of transportation modes while meeting the specified time bounds. This approach considers only maximizing the potential flow within a single time bound, so that it may not perform effectively for every organ type. To remedy this situation, another mathematical model that maximizes the potential flow of multiple organ types has also been developed. Additionally, in order to evaluate the performance of our results, using the outputs of the deterministic mathematical models, we developed a simulation model to mimic the uncertain environment realistically while being able to model the components of hierarchical systems. Extensive computational analysis using a variety of performance measures has revealed that Turkey’s organ transplantation network can be improved by re-clustering.〈/p〉
    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
    Route feasibility testing and forward time slack for the Synchronized Pickup and Delivery Problem (2018)
    Springer
    Details
    Publication Date: 2018
    Description: 〈h3〉Abstract〈/h3〉 〈p〉The Synchronized Pickup and Delivery Problem (SPDP) consists of finding a set of minimum-cost routes servicing user-specified transportation requests from pickup to delivery locations subject to pairing and precedence, capacity, time-window, and minimum and maximum time-lag constraints. The temporal constraints of the SPDP impose a complex scheduling problem for the service times at the customer locations which makes the efficient feasibility checking of routes intricate. We present different route feasibility tests for the SPDP and compare their practical runtime on a huge number of randomly generated routes. Furthermore, we generalize to the SPDP the concept of forward time slack, which has proven a versatile tool for feasibility testing of customer or request insertions into a given (feasible) route for many VRP variants.〈/p〉
    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
    Time-constrained maximal covering routing problem (2018)
    Springer
    Details
    Publication Date: 2018
    Description: 〈h3〉Abstract〈/h3〉 〈p〉 We introduce the time-constrained maximal covering routing problem (TCMCRP), as a generalization of the covering salesman problem. In this problem, we are given a central depot, a set of facilities and several customers which are located within a pre-determined coverage distance of available facilities. Each facility can supply the demand of some customers which are within its coverage radius. Starting from the depot, the goal is to maximize the total number of covered customers, by constructing a set of 〈em〉p〈/em〉 length constraint Hamiltonian cycles. We have proposed a mixed integer linear programming model and three heuristic algorithms, namely iterated local search (ILS), tabu search (TS) and variable neighborhood search (VNS), to solve the problem. Extensive computational tests on this problem and some of its variants clearly indicate the effectiveness of the developed solution methods.〈/p〉
    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
    Decision making in multiobjective optimization problems under uncertainty: balancing between robustness and quality (2018)
    Springer
    Details
    Publication Date: 2018
    Description: 〈h3〉Abstract〈/h3〉 〈p〉As an emerging research field, multiobjective robust optimization employs minmax robustness as the most commonly used concept. Light robustness is a concept in which a parameter, tolerable degradations, can be used to control the loss in the objective function values in the most typical scenario for gaining in robustness. In this paper, we develop a lightly robust interactive multiobjective optimization method, LiRoMo, to support a decision maker to find a most preferred lightly robust efficient solution with a good balance between robustness and the objective function values in the most typical scenario. In LiRoMo, we formulate a lightly robust subproblem utilizing an achievement scalarizing function which involves a reference point specified by the decision maker. With this subproblem, we compute lightly robust efficient solutions with respect to the decision maker’s preferences. With LiRoMo, we support the decision maker in understanding the lightly robust efficient solutions with an augmented value path visualization. We use two measures ‘price to be paid for robustness’ and ‘gain in robustness’ to support the decision maker in considering the trade-offs between robustness and quality. As an example to illustrate the advantages of the method, we formulate and solve a simple investment portfolio optimization problem.〈/p〉
    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
    Retail operations (2018)
    Springer
    Details
    Publication Date: 2018
    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
    Deep-lane storage of time-critical items: one-sided versus two-sided access (2018)
    Springer
    Details
    Publication Date: 2018
    Description: 〈h3〉Abstract〈/h3〉 〈p〉Plenty retailers handling fresh produce face the following operational problem in their distribution centers: Pallets of food assembled during the day according to the demands of supermarkets are to be intermediately stored overnight. To save cooling costs, deep-lane storage in some compact storage system is applied, from which the pallets are to be retrieved the next morning when the trucks servicing the supermarkets are to be loaded under great time pressure. To enable an efficient retrieval process, we seek storage assignments defining the put-away of pallets in the deep-lane storage system, such that blockings, i.e., a pallet with later retrieval time is placed in front of another pallet with higher priority in the same lane, are avoided. Most deep-lane storage systems allow only a front access, whereas novel systems can be loaded and unloaded from two sides. We formalize both resulting storage assignment problems, investigate computational complexity, introduce solution procedures, and quantify the increase in flexibility promised by a two-sided access. Our computational results reveal that especially if truck arrivals are hard to anticipate due to a considerable amount of uncertainty, two-sided systems greatly reduce blockings.〈/p〉
    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...