Search results for "Information"
showing 10 items of 14916 documents
New exact methods for the time-invariant berth allocation and quay crane assignment problem
2019
Abstract Efficient management of operations in seaport container terminals has become a critical issue, due to the increase in maritime traffic and the strong competition between ports. In this paper we focus on two seaside operational problems: the Berth Allocation Problem and the Quay Crane Assignment Problem, which are considered in an integrated way. For the continuous BACAP problem with time-invariant crane assignment we propose a new mixed integer linear model in which the vessels can be moored at any position on the quay, not requiring any quay discretization. The model is enhanced by adding several families of valid inequalities. The resulting model is able to solve instances with u…
The berth allocation problem in terminals with irregular layouts
2019
As international trade thrives, terminals attempt to obtain higher revenue while coping with an increased complexity with regard to terminal management operations. One of the most prevalent problems such terminals face is the Berth Allocation Problem (BAP), which concerns allocating vessels to a set of berths and time slots while simultaneously minimizing objectives such as total stay time or total assignment cost. Complex layouts of real terminals introduce spatial constraints which limit the mooring and departure of vessels. Although significant research has been conducted regarding the BAP, these real-world restrictions have not been taken into account in a general way. The present work …
Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
2017
Abstract With their paper “Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints” [Discrete Optimization 3, 2006, pp. 255–273] Righini and Salani introduced bounded bidirectional dynamic programming (DP) as an acceleration technique for solving variants of the shortest path problem with resource constraints (SPPRC). SPPRCs must be solved iteratively when vehicle routing and scheduling problems are tackled via Lagrangian relaxation or column-generation techniques. Righini and Salani and several subsequent works have shown that bounded bidirectional DP algorithms are often superior to their monodirectional counterparts, s…
Irregular packing problems: a review of mathematical models
2020
Abstract Irregular packing problems (also known as nesting problems) belong to the more general class of cutting and packing problems and consist of allocating a set of irregular and regular pieces to larger rectangular or irregular containers, while minimizing the waste of material or space. These problems combine the combinatorial hardness of cutting and packing problems with the computational difficulty of enforcing the geometric non-overlap and containment constraints. Unsurprisingly, nesting problems have been addressed, both in the scientific literature and in real-world applications, by means of heuristic and metaheuristic techniques. However, more recently a variety of mathematical …
Improved polyhedral descriptions and exact procedures for a broad class of uncapacitated p-hub median problems
2019
Abstract This work focuses on a broad class of uncapacitated p-hub median problems that includes non-stop services and setup costs for the network structures. In order to capture both the single and the multiple allocation patterns as well as any intermediate case of interest, we consider the so-called r-allocation pattern with r denoting the maximum number of hubs a terminal can be allocated to. We start by revisiting an optimization model recently proposed for the problem. For that model, we introduce several families of valid inequalities as well as optimality cuts. Moreover, we consider a relaxation of the model that contains several sets of set packing constraints. This motivates a pol…
Gap-accepteance parameters for roundabouts: a systematic review
2015
Purpose The critical and follow-up headways are the two gap-acceptance parameters which explain the traffic interaction of a minor street vehicle when enters the roundabout, merging into or crossing one or more circulating (major) streams.Severalstudiesandresearchesprovidemeasurements of critical and follow-up headways from real data at roundabouts. The objective of our research is to synthesize the data from the series of selected studies to interpret variation across the studies. Methods In order to match the research goal, a systematic literaturereviewonestimationsofcriticalandfollow-upheadways at roundabouts was undertaken. Since several studies andresearchesdevelopedworldwidewereexamin…
Competition for long-haul connecting traffic among airports in Europe and the Middle East
2017
Abstract This paper analyzes the competitive position of major hub airports in Europe and the Middle East for long-haul connecting traffic. We apply a connection builder to construct competitive flight connections. A stand out feature of the proposed connection builder is the calibration of the model parameters using booking data, composed of actual passenger demand between a given origin and destination (O&D) market. The methodology is applied to measure competition between hubs using flight schedule data to calculate connectivity measures like the number of city-pairs connected via a hub airport. Our results show that the Middle Eastern hubs have improved their competitive position, while…
System Dynamics in the Predictive Analytics of Container Freight Rates
2021
This study proposes a two-tier cross-validation and backtesting procedure, including expanding and rolling-window test metrics in predictive analytics of container freight rates by utilizing the system dynamics approach. The study utilized system dynamics to represent the nonlinear complex structure of container freight rates for predictive analytics and performed univariate and multivariate time-series analysis as benchmarks of the conventional approach. In particular, the China containerized freight index (CCFI) has been investigated through various parametric methodologies (both conventional time-series and system dynamics approaches). This study follows a strict validation process cons…
Applying particle swarm optimization to the motion-cueing-algorithm tuning problem
2017
The MCA tuning problem consists in finding the best values for the parameters/coefficients of Motion Cueing Algorithms (MCA). MCA are used to control the movements of robotic motion platforms employed to generate inertial cues in vehicle simulators. This problem is traditionally approached with a manual pilot-in-the-loop subjective tuning, based on the opinion of several pilots/drivers. Instead, this paper proposes applying Particle Swarm Optimization (PSO) to solve this problem, using simulated motion platforms and objective indicators rather than subjective opinions. Results show that PSO-based tuning can provide a suitable solution for this complex optimization problem.
Using a hazard-independent approach to understand road-network robustness to multiple disruption scenarios
2021
Abstract A range of predictable and unpredictable events can cause road perturbations, disrupting traffic flows and more generally the functioning of society. To manage this threat, stakeholders need to understand the potential impact of a multitude of predictable and unpredictable events. The present paper adopts a hazard-independent approach to assess the robustness (ability to maintain functionality despite disturbances) of the Sioux Falls network to all possible disruptions. This approach allows understanding the impact of a wide range of disruptive events, including random, localised, and targeted link failures. The paper also investigates the predictability of the link combinations wh…