Search results for " Opera"

showing 10 items of 3606 documents

‘Tool port’ to ‘landlord port’: a game theory approach to analyse gains from governance model transformation

2018

This study investigates potential port users’ surplus and terminal operators’ profits due to transforming port governance from the ‘tool port’ model to the ‘landlord port’ model. Although the landl...

050210 logistics & transportation021103 operations researchModel transformationCorporate governance05 social sciencesGeography Planning and Development0211 other engineering and technologiesOcean EngineeringTransportation02 engineering and technologyManagement Monitoring Policy and LawPort (computer networking)Terminal (electronics)0502 economics and businessBertrand competitionLandlordBusinesscomputerGame theoryIndustrial organizationcomputer.programming_languageMaritime Policy & Management
researchProduct

Micro and Macro Resilience Measures of an Economic Crisis

2020

Using Italian Households Budget Survey data over the period 1997-2013, a Cragg model in a life-cycle context is specified to compare the consumption behaviour in the pre- and post-crisis time and develop different micro and macro measures of resilience against crisis shocks. Cohort profiles for participation in and for consumption of tourism services in the pre- and post-crisis time are determined so as to explore the households’ resilience by generations. Next, the households’ resilience according to socio-demographic characteristics is addressed. As for the macro-resilience, combining individual expenditure elasticity, we examine whether and how Italian regions have responded to the recen…

050210 logistics & transportation021103 operations researchPublic economicsResilienceEconomic crisisComputer Networks and CommunicationsLife-CycleExpenditure elasticity05 social sciences0211 other engineering and technologies02 engineering and technologyResilience . Economic crisis . Tourism expenditure .Life-Cycle . Cragg model . Expenditure elasticityCragg modelArtificial Intelligence0502 economics and businessSettore SECS-S/03 - Statistica EconomicaEconomicsSurvey data collectionMacroTourism expenditureEconomic crisiSoftwareTourism
researchProduct

Operational and financial performance of Italian airport companies: A dynamic graphical model

2016

Abstract This paper provides evidence on the relationship within a set of financial and operational indicators for Italian airports over 2008–2014. The limited sample size of national and regional airports suggests to apply the penalised RCON ( V , E ) model, which falls within the class of Gaussian graphical models. It provides both estimate and easy way to visualise conditional independence structures of the variables. Moreover, it is particularly suitable for handling longitudinal data where small number of units and huge number of variables have been collected. Findings highlight that a qualified concept of size matters in determining good financial performance. Specifically, increasing…

050210 logistics & transportation05 social sciencesGeography Planning and DevelopmentTransportationSample (statistics)Economic surplus01 natural sciencesFinancial indicators Operational indicators Italy Gaussian graphical modelMicroeconomics010104 statistics & probabilityOrder (business)Low-cost carrier0502 economics and businessEconometricsFinancial analysisEconomicsRevenueProfitability indexGraphical model0101 mathematicsSettore SECS-S/01 - Statistica
researchProduct

From bus to tramway: Is there an economic impact of substituting a rapid mass transit system? An empirical investigation accounting for anticipation …

2018

Abstract Hedonic pricing models and price equations have been extensively used to retrieve the implicit prices of urban externalities through real estate markets. Many applications have been devoted to investigating the impact of new mass transit systems, such as rail infrastructures. However, the implementation of such infrastructures usually takes some time and markets can react with an anticipation effect that can vary according to the different development phases. Moreover, the impact may be different if it acts as a substitute to existing rapid transit services. This paper focuses on the impact of substituting bus rapid transit (BRT) for light rail transit (LRT) services, taking into a…

050210 logistics & transportationApartmentbusiness.industryTransit system05 social sciencesAerospace EngineeringTransportationReal estateManagement Science and Operations ResearchEnvironmental economicsAnticipation (artificial intelligence)Public transport0502 economics and businessBusiness Management and Accounting (miscellaneous)Economic impact analysis050207 economicsbusinessExternalityBus rapid transitCivil and Structural EngineeringTransportation Research Part A: Policy and Practice
researchProduct

Relative Reachability Analysis as a Tool for Urban Mobility Planning

2019

There is a plethora of user-oriented route planning applications and systems that enable the computation of the fastest journey between two locations using different transportation modes, e.g., car, public transport, walking, bicycle. While useful for individuals, they are of limited interest to a class of users that may be interested in a more global and comparative view of transportation systems in general. In this context, we adopt the view of an urban planner. Urban planners may be interested in queries such as "if a new transit stop was to be introduced in a given location, would that bring the travel time to a given point-of-interest (POI) or area-of-interest (AOI) by bus closer to th…

050210 logistics & transportationClass (computer programming)021103 operations researchOperations researchbusiness.industryComputer science05 social sciences0211 other engineering and technologiesContext (language use)02 engineering and technologyPlannerTraffic congestionUrban planningReachabilityPublic transport0502 economics and businessbusinesscomputerSpatial analysiscomputer.programming_languageProceedings of the 12th ACM SIGSPATIAL International Workshop on Computational Transportation Science
researchProduct

Does higher technical efficiency induce a higher service level? A paradox association in the context of port operations

2020

Abstract Researchers and practitioners are benchmarking technical efficiency of ports and exploring the drivers of high efficiency. Paradoxically, this study argues that high technical efficiency (TE = 1) is not always essential, but an optimal level needs to be achieved while balancing the port service level. This study applies data envelopment analysis (DEA) and free disposal hull (FDH) methods to perform efficiency rankings of 38 container terminals from 17 different ports in 12 Asian countries. Four terminals are technically efficient (TE = 1) in all frontier approaches, thereof one Bangladeshi, one Chinese, one Indian and one Vietnamese. Furthermore, this study presents a case study co…

050210 logistics & transportationComputer science05 social sciencesTransportationContext (language use)BenchmarkingManagement Science and Operations ResearchEnvironmental economicsPort (computer networking)VDP::Teknologi: 500Management of Technology and InnovationService level0502 economics and businessQuantitative researchContainer (abstract data type)Data envelopment analysisBusiness and International ManagementThroughput (business)050203 business & managementThe Asian Journal of Shipping and Logistics
researchProduct

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…

050210 logistics & transportationFocus (computing)021103 operations researchOperations researchComputer science330 Wirtschaft05 social sciences0211 other engineering and technologiesRework02 engineering and technologyManagement Science and Operations ResearchDelivery cost330 Economics650 ManagementService level0502 economics and businessVehicle routing problemBenchmark (computing)Business Management and Accounting (miscellaneous)Roaming650 Management and auxiliary servicesSet (psychology)OR Spectrum
researchProduct

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

050210 logistics & transportationMathematical optimization021103 operations research05 social sciences0211 other engineering and technologiesTransportation02 engineering and technologyTravelling salesman problemClose-enough arc routing problemBranch-and-cut0502 economics and businessGeneralized rural postman problemRouting (electronic design automation)MATEMATICA APLICADABranch and cutArc routingAlgorithmAutomatic meter readingCivil and Structural EngineeringMathematics
researchProduct

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…

050210 logistics & transportationMathematical optimization021103 operations researchControl and OptimizationCloning (programming)Alternative fuel vehicles; Fueling pump reservation; Mixed integer linear programming; Vehicle routing problemComputer science05 social sciences0211 other engineering and technologiesComputational intelligence02 engineering and technologyGreen vehicle routingSet (abstract data type)Alternative fuel vehiclesalternative fuels benchmarking clone cells cloning integer programming pumps sensitivity analysis vehicles fueling pump reservation mixed integer linear programming vehicle routing problemMixed integer linear programmingVehicle routing problem0502 economics and businessPath (graph theory)Benchmark (computing)Sensitivity (control systems)Settore MAT/09 - Ricerca OperativaCutting-plane methodFueling pump reservation
researchProduct

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…

050210 logistics & transportationMathematical optimization021103 operations researchDelivery vehicle05 social sciences0211 other engineering and technologiesCombinatorial optimization problemTransportation02 engineering and technologyComputer Science::RoboticsTime windows0502 economics and businessVehicle routing problemComputer Science::Networking and Internet ArchitectureRouting (electronic design automation)Branch and cutAlgorithmCivil and Structural EngineeringMathematicsTransportation Science
researchProduct