Container Terminals (CT) operate as central nodes in worldwide hub-and-spoke networks and link ocean-going vessels with smaller feeder vessels as well as with inbound and outbound hinterland transportation systems usi...
ISBN:
(数字)9781441984081
ISBN:
(纸本)9781441984074
Container Terminals (CT) operate as central nodes in worldwide hub-and-spoke networks and link ocean-going vessels with smaller feeder vessels as well as with inbound and outbound hinterland transportation systems using road, rail, or inland waterways. The volume of transcontinental container flows has gained appreciably over the last five decades -- throughput figures of CT reached new records, frequently with double-digit annual growth rates. Stimulated by throughput requirements and stronger competition between terminals settled in the same region or serving a similar hinterland, respectively, cost efficiency and throughput capabilities become more and more important. Nowadays, both terminal capacity and costs have to be regarded as key indicators for CT competitiveness. In respect of this steady growth, this handbook focuses on planning activities being aimed at order of magnitude improvements in terminal performance and economic viability. On the one hand the book is intended to provide readership with technological and organizational CT basics for strategic planning. On the other hand this book offers methodical assistance for fundamental dimensioning of CT in terms of 'technique', 'organization' or 'man'. The former primarily considers comprehensive information about container handling technologies representing the state of the art for present terminal operations, while the latter refers to methodological support comprising in particular quantitative solutions and modeling techniques for strategic terminal decisions as well as straightforward design guidelines. The handbook includes an introductory contribution which gives an overview of strategic planning problems at CT and introduces the contributions of the volume with regard to their relationship in this field. Moreover, each paper contains a section or paragraph that describes the impact of findings investigated by the author(s) for problem-solving in long-term planning of CT (as an application domain).
The availability of todays online information systems rapidly increases the relevance of dynamic decision making within a large number of operational contexts. Whenever a sequence of interdependent decisions occurs, m...
ISBN:
(数字)9781461405054
ISBN:
(纸本)9781461405047
The availability of todays online information systems rapidly increases the relevance of dynamic decision making within a large number of operational contexts. Whenever a sequence of interdependent decisions occurs, making a single decision raises the need for anticipation of its future impact on the entire decision process. Anticipatory support is needed for a broad variety of dynamic and stochastic decision problems from different operational contexts such as finance, energy management, manufacturing and transportation. Example problems include asset allocation, feed-in of electricity produced by wind power as well as scheduling and routing. All these problems entail a sequence of decisions contributing to an overall goal and taking place in the course of a certain period of time. Each of the decisions is derived by solution of an optimization problem. As a consequence a stochastic and dynamic decision problem resolves into a series of optimization problems to be formulated and solved by anticipation of the remaining decision ***, actually solving a dynamic decision problem by means of approximate dynamic programming still is a major scientific challenge. Most of the work done so far is devoted to problems allowing for formulation of the underlying optimization problems as linear programs. Problem domains like scheduling and routing, where linear programming typically does not produce a significant benefit for problem solving, have not been considered so far. Therefore, the industry demand for dynamic scheduling and routing is still predominantly satisfied by purely heuristic approaches to anticipatory decision making. Although this may work well for certain dynamic decision problems, these approaches lack transferability of findings to other, related *** book has serves two major purposes: It provides a comprehensive and unique view of anticipatory optimization for dynamic decision making. It fully integrates Markov decision processes, dynam
operationsresearch and Cyber-Infrastructure is the companion volume to the Eleventh INFORMS Computing Society Conference (ICS 2009), held in Charleston, South Carolina, from January 11 to 13, 2009. It includes 24 hig...
ISBN:
(数字)9780387888439
ISBN:
(纸本)9780387888422
operationsresearch and Cyber-Infrastructure is the companion volume to the Eleventh INFORMS Computing Society Conference (ICS 2009), held in Charleston, South Carolina, from January 11 to 13, 2009. It includes 24 high-quality refereed research papers. As always, the focus of interest for ICS is the interface between operationsresearch and computerscience, and the papers in this volume reflect that interest. This is naturally an evolving area as computational power increases rapidly while decreasing in cost even more quickly. The papers included here illustrate the wide range of topics at this interface. For convenience, they are grouped in broad categories and subcategories. There are three papers on modeling, reflecting the impact of recent development in computing on that area. Eight papers are on optimization (three on integer programming, two on heuristics, and three on general topics, of which two involve stochastic/probabilistic processes). Finally, there are thirteen papers on applications (three on the conference theme of cyber-infrastructure, four on routing, and six on other interesting topics). Several of the papers could be classified in more than one way, reflecting the interactions between these topic areas.
The origins of Graph Theory date back to Euler (1736) with the solution of the celebrated 'Koenigsberg Bridges Problem'; and to Hamilton with the famous 'Trip around the World' game (1859), stating for...
ISBN:
(数字)9780387754505
ISBN:
(纸本)9780387754499
The origins of Graph Theory date back to Euler (1736) with the solution of the celebrated 'Koenigsberg Bridges Problem'; and to Hamilton with the famous 'Trip around the World' game (1859), stating for the first time a problem which, in its most recent version the 'Traveling Salesman Problem' -, is still the subject of active research. Yet, it has been during the last fifty years or sowith the rise of the electronic computersthat Graph theory has become an indispensable discipline in terms of the number and importance of its applications across the Applied sciences. Graph theory has been especially central to Theoretical and Algorithmic computerscience, and Automatic Control, Systems Optimization, Economy and operationsresearch, Data Analysis in the Engineering sciences. Close connections between graphs and algebraic structures have been widely used in the analysis and implementation of efficient algorithms for many problems, for example: transportation network optimization, telecommunication network optimization and planning, optimization in scheduling and production systems, etc. The primary objectives of GRAPHS, DIODS AND SEMIRINGS: New Models and Algorithms are to emphasize the deep relations existing between the semiring and diod structures with graphs and their combinatorial properties, while demonstrating the modeling and problem-solving capability and flexibility of these structures. In addition the book provides an extensive overview of the mathematical properties employed by "nonclassical" algebraic structures, which either extend usual algebra (i.e., semirings), or correspond to a new branch of algebra (i.e., diods), apart from the classical structures of groups, rings, and fields.
暂无评论