Search results for "OPERATION"
showing 10 items of 2969 documents
Decision support system to design feasible high-frequency Motorways of the Sea: A new perspective for public commitment
2016
ABSTRACTThe implementation of Motorways of the Sea (MoS) within the framework of European Union aid programs experiences a period of relative stagnation. This article analyzes the suitability of current short-term nonrepayable subsidy policy and develops a decision support system (DSS) that allows a medium- and long-term feasibility analysis of MoS proposals. One significant conclusion drawn from the application of the proposed DSS to a prototypical high-frequency MoS provides that the period of initial losses prior to achievement of both modal shift and accounting profits might last 10 years. Moreover, the entire duration of the period that includes prior objectives as well as the recoveri…
Expert In-depth Interview on Development and Efficiency of “RIGA International Airport” Reflecting Factors
2016
Abstract The aim of the paper is to identify development ways and effectiveness of RIGA International Airport. Theoretical evidence was examined and expert in-depth interview was carried out to explore the main circumstances affecting RIGA International Airport functioning. Findings of the study show that there are positive tendencies in the field of airport efficiency and development, but improvement is needed primarily for coordinating visions and resources managed by both state and airport administration bodies.
The last-mile vehicle routing problem with delivery options
2021
AbstractThe ongoing rise in e-commerce comes along with an increasing number of first-time delivery failures due to the absence of the customer at the delivery location. Failed deliveries result in rework which in turn has a large impact on the carriers’ delivery cost. In the classical vehicle routing problem (VRP) with time windows, each customer request has only one location and one time window describing where and when shipments need to be delivered. In contrast, we introduce and analyze the vehicle routing problem with delivery options (VRPDO), in which some requests can be shipped to alternative locations with possibly different time windows. Furthermore, customers may prefer some deli…
Assessment of the Total Factor Productivity Change in the Spanish Ports: Hicks–Moorsteen Productivity Index Approach
2016
AbstractThe assessment of the productivity growth of ports is essential to improve their performance and competitiveness. Although there are several nonparametric methodologies to compute the productivity change, the Hicks–Moorsteen productivity index is the only multiplicatively completed index that can be computed without price data. For the first time, the total factor productivity (TFP) change of a sample of ports is evaluated. The analysis covers the 28 ports comprising the Spanish port system, using data over the period 2005–2012. The drivers of TFP—technical change, technical efficiency, mix efficiency, and residual scale efficiency—are also investigated. The results indicate that fr…
A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem
2016
The generalized directed rural postman problem, also known as the close-enough arc routing problem, is an arc routing problem with some interesting real-life applications, such as routing for meter reading. In this article we introduce two new formulations for this problem as well as various families of new valid inequalities that are used to design and implement a branch-and-cut algorithm. The computational results obtained on test bed instances from the literature show that this algorithm outperforms the existing exact methods
A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations
2021
AbstractThe Green Vehicle Routing Problem with Capacitated Alternative Fuel Stations assumes that, at each station, the number of vehicles simultaneously refueling cannot exceed the number of available pumps. The state-of-the-art solution method, based on the generation of all feasible non-dominated paths, performs well only with up to 2 pumps. In fact, it needs cloning the paths between every pair of pumps. To overcome this issue, in this paper, we propose new path-based MILP models without cloning paths, for both the scenario with private stations (i.e., owned by the fleet manager) and that with public stations. Then, a more efficient cutting plane approach is designed for addressing both…
Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows
2019
The split delivery vehicle routing problem with time windows (SDVRPTW) is a notoriously hard combinatorial optimization problem. First, it is hard to find a useful compact mixed-integer programming (MIP) formulation for the SDVRPTW. Standard modeling approaches either suffer from inherent symmetries (mixed-integer programs with a vehicle index) or cannot exactly capture all aspects of feasibility. Because of the possibility to visit customers more than once, the standard mechanisms to propagate load and time along the routes fail. Second, the lack of useful formulations has rendered any direct MIP-based approach impossible. Up to now, the most effective exact algorithms for the SDVRPTW hav…
Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem
2019
In the dial-a-ride problem, user-specified transport requests from origin to destination points have to be served by a fleet of homogeneous vehicles. The problem variant we consider aims at finding a set of minimum-cost routes satisfying constraints on vehicle capacity, time windows, maximum route duration, and maximum user ride times. We propose an adaptive large neighborhood search (ALNS) for its solution. The key novelty of the approach is an exact amortized constant-time algorithm for evaluating the feasibility of request insertions in the repair steps of the ALNS. In addition, we use two optional improvement techniques: a local-search-based intraroute improvement of routes of promisin…
Heuristics for the capacitated modular hub location problem
2017
Abstract In this paper we study the hub location problem, where the goal is to identify an optimal subset of facilities (hubs) to minimize the transportation cost while satisfying certain capacity constraints. In particular, we target the single assignment version, in which each node in the transportation network is assigned to only one hub to route its traffic. We consider here a realistic variant introduced previously, in which the capacity of edges between hubs is increased in a modular way. This reflects the practical situation in air traffic where the number of flights between two locations implies a capacity in terms of number of passengers. Then, the capacity can be increased in a mo…
Exact solution of the soft-clustered vehicle-routing problem
2020
Abstract The soft-clustered vehicle-routing problem (SoftCluVRP) extends the classical capacitated vehicle-routing problem by one additional constraint: The customers are partitioned into clusters and feasible routes must respect the soft-cluster constraint, that is, all customers of the same cluster must be served by the same vehicle. In this article, we design and analyze different branch-and-price algorithms for the exact solution of the SoftCluVRP. The algorithms differ in the way the column-generation subproblem, a variant of the shortest-path problem with resource constraints (SPPRC), is solved. The standard approach for SPPRCs is based on dynamic-programming labeling algorithms. We s…