The current decade sees a considerable growth in worldwide container transportation and with it an indispensable need for optimization. Also the interest in and availability of academic literatures as well as case reports are almost exploding. With this paper an earlier survey which proved to be of utmost importance for the community is updated and extended to provide the current state of the art in container terminal operations and operations research.

Operations research at container terminals: a literature update

The objective of this paper is to review the current status of ship routing and scheduling. We focus on literature published during the last decade. Because routing and scheduling problems are closely related to many other fleet planning problems, we have divided this review into several parts. We start at the strategic fleet planning level and discuss the design of fleets and sea transport systems. We continue with the tactical and operational fleet planning level and consider problems that comprise various ship routing and scheduling aspects. Here, we separately discuss the different modes of operations: industrial, tramp, and liner shipping. Finally, we take a glimpse at naval applications and other related problems that do not naturally fall into these categories. The paper also presents some perspectives regarding future developments and use of optimization-based decision-support systems for ship routing and scheduling. Several of the trends indicate both accelerating needs for and benefits from such systems and, hopefully, this paper will stimulate further research in this area.

https://www.jstor.org/stable/pdfplus/25769174.pdf

Ship Routing and Scheduling: Status and Perspectives

This paper is the second part of a comprehensive survey on pickup and delivery models. Basically, two problem classes can be distinguished. The first part dealt with the transportation of goods from the depot to linehaul customers and from backhaul customers to the depot. In this class four subtypes were considered, namely the Vehicle Routing Problem with Clustered Backhauls (VRPCB all linehauls before backhauls), the Vehicle Routing Problem with Mixed linehauls and Backhauls (VRPMB any sequence of linehauls and backhauls permitted), the Vehicle Routing Problem with Divisible Delivery and Pickup (VRPDDP customers demanding delivery and pickup service can be visited twice), and the Vehicle Routing Problem with Simultaneous Delivery and Pickup (VRPSDP customers demanding both services have to be visited exactly once). The second part now considers all those problems where goods are transported between pickup and delivery locations, denoted as Vehicle Routing Problems with Pickups and Deliveries (VRPPD). These are the Pickup and Delivery VRP (PDVRP unpaired pickup and delivery points), the classical Pickup and Delivery Problem (PDP paired pickup and delivery points), and the Dial-A-Ride Problem (DARP paired pickup and delivery points and user inconvenience taken into consideration). A single as well as a multi vehicle mathematical problem formulation for all three VRPPD types is given, and the respective exact, heuristic, and metaheuristic solution methods are discussed.

/pdf/a-survey-on-pickup-and-delivery-problems-part-ii-s8djcjjy1t.pdf

A survey on pickup and delivery problems: Part II: Transportation between pickup and delivery locations

Pickup and delivery problems constitute an important class of vehicle routing problems in which objects or people have to be collected and distributed. This paper introduces a general framework to model a large collection of pickup and delivery problems, as well as a three-field classification scheme for these problems. It surveys the methods used for solving them.

Static pickup and delivery problems: a classification scheme and survey

This paper is the first part of a comprehensive survey on pickup and delivery problems. Basically, two problem classes can be distinguished. The first class, discussed in this paper, deals with the transportation of goods from the depot to linehaul customers and from backhaul customers to the depot. This class is denoted as Vehicle Routing Problems with Backhauls (VRPB). Four subtypes can be considered, namely the Vehicle Routing Problem with Clustered Backhauls (VRPCB – all linehauls before backhauls), the Vehicle Routing Problem with Mixed linehauls and Backhauls (VRPMB – any sequence of linehauls and backhauls permitted), the Vehicle Routing Problem with Divisible Delivery and Pickup (VRPDDP – customers demanding delivery and pickup service can be visited twice), and the Vehicle Routing Problem with Simultaneous Delivery and Pickup (VRPSDP – customers demanding both services have to be visited exactly once). The second class, dealt with in the second part of this survey, refers to all those problems where goods are transported between pickup and delivery locations. These are the Pickup and Delivery Vehicle Routing Problem (PDVRP – unpaired pickup and delivery points), the classical Pickup and Delivery Problem (PDP – paired pickup and delivery points), and the Dial-A-Ride Problem (DARP – passenger transportation between paired pickup and delivery points and user inconvenience taken into consideration). Single as well as multi vehicle versions of the mathematical problem formulations are given for all four VRPB types, the corresponding exact, heuristic, and metaheuristic solution methods are discussed.

/pdf/a-survey-on-pickup-and-delivery-problems-4jg10ds2xx.pdf

A survey on pickup and delivery problems

Oil production optimization solved by piecewise linearization in a Branch & Price framework

Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds

This paper illustrates how operations research can be applied to large-scale maritime crude oil transportation. The more the industry strives to improve the efficiency of their supply chains the mo...

Crude Oil Tanker Routing and Scheduling

In the traditional organisation of the power market, the generation Unit Commitment and Dispatch problem was solved as a cost minimisation problem After deregulation of the electricity sector, the problem must be solved as a profit maximising problem It is necessary to find feasible market prices This is difficult, because simple marginal cost based prices not always cover startup and operation-independent costs, with the result that the generator would choose not to run with such prices In this paper a market structure is proposed with a central market operator computing the market equilibrium for both energy and reserves, based on generator offers and consumer bids It is shown that it is possible to find feasible market prices Using a simple test system, it is shown that demand elasticity can have a profound impact on prices and generator revenues and profits during peaking hours

Market Price Calculations in Restructured Electricity Markets

http://www.nt.ntnu.no/users/skoge/prost/proceedings/adchem09/cd/abstract/88.pdf

Bjørn Nygreen

Papers

Oil production optimization solved by piecewise linearization in a Branch & Price framework

Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds

Crude Oil Tanker Routing and Scheduling

Market Price Calculations in Restructured Electricity Markets

Dantzig-Wolfe decomposition for real-time optimization - applied to the Troll west oil rim