An exact solution algorithm for maximizing the fleet availability of a unit of aircraft subject to flight and maintenance requirements

2015 ◽  
Vol 242 (2) ◽  
pp. 631-643 ◽  
Author(s):  
Andreas Gavranis ◽  
George Kozanidis
Keyword(s):  
Exact Solution ◽  
Solution Algorithm ◽  
Maintenance Requirements

Vehicle Sequencing at Transshipment Terminals with Handover Relations

2020 ◽  
Author(s):  
Dirk Briskorn ◽  
Malte Fliedner ◽  
Martin Tschöke
Keyword(s):  
Exact Solution ◽  
Computational Study ◽  
Solution Algorithm ◽  
Comprehensive Analysis ◽  
Container Terminals ◽  
Decision Problems ◽  
Operational Planning ◽  
Vast Number ◽  
Synchronization Problem ◽  
Structural Connections

Operational planning at transshipment nodes is a wide and challenging field of research that covers a vast number of distinct relevant applications, spanning from seaport container terminals to rail terminals to cross-docks. In this work, we study the feasibility version of a fundamental synchronization problem that assigns incoming vehicles to docking resources subject to handover relations. We carry out a comprehensive analysis of computational complexity of various problem variants and establish structural connections to famous decision problems in graph theory. We further propose an exact solution algorithm for finding feasible dock assignments, if vehicles can visit the node only once and evaluate its performance in a comprehensive computational study.

MULTI-SOURCE SPANNING TREE PROBLEMS

2000 ◽  
Vol 01 (01) ◽  
pp. 61-71 ◽  
Author(s):  
ARTHUR M. FARLEY ◽  
PARASKEVI FRAGOPOULOU ◽  
DAVID KRUMME ◽  
ANDRZEJ PROSKUROWSKI ◽  
DANA RICHARDS
Keyword(s):  
Exact Solution ◽  
Spanning Tree ◽  
Polynomial Solution ◽  
Solution Algorithm ◽  
Efficient Algorithms ◽  
Strong Sense ◽  
Alternative Measure ◽  
Multicast Communication ◽  
Multiple Sources ◽  
Sum Of Distances

We consider a model of multicast communication in a network whereby multiple sources have messages to disseminate among all sites of a network. We propose that the messages from all sources are disseminated along the same spanning tree of the network and consider the problem of constructing an optimal such tree. One measure for suitability of the construction is the sum of distances from all sources to all other vertices. We show that finding the exact solution in this case in [Formula: see text]-hard (in the strong sense). We then investigate solutions for some restricted classes of graphs and give efficient algorithms for those. We also consider an alternative measure of goodness for the spanning tree, being the maximum eccentricity of a source. We show that the problem of finding such a minimum eccentricity spanning tree is somewhat easier to solve and give a pseudo-polynomial solution algorithm.

scholarly journals A novel exact solution algorithm for a robust product portfolio problem under return uncertainty

2021 ◽  
Vol 0 (0) ◽  
pp. 0-0
Author(s):  
Alireza Goli ◽  
Hassan Khademi Zare ◽  
Reza Tavakkoli-Moghaddam ◽  
Ahmad Sadeghieh
Keyword(s):  
Exact Solution ◽  
Solution Algorithm ◽  
Product Portfolio ◽  
Portfolio Problem

A Rule-Based Recourse for the Vehicle Routing Problem with Stochastic Demands

2019 ◽  
Vol 53 (5) ◽  
pp. 1334-1353
Author(s):  
Majid Salavati-Khoshghalb ◽  
Michel Gendreau ◽  
Ola Jabali ◽  
Walter Rei
Keyword(s):  
Exact Solution ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Computational Study ◽  
Solution Algorithm ◽  
Routing Problem ◽  
Rule Based ◽  
Stochastic Demands ◽  
Dynamic Setting ◽  
Residual Capacity

In this paper we consider the vehicle routing problem with stochastic demands (VRPSD). We consider that customer demands are only revealed when a vehicle arrives at customer locations. Failures occur whenever the residual capacity of the vehicle is insufficient to serve the observed demand of a customer. Such failures entail that recourse actions be taken to recover route feasibility. These recourse actions usually take the form of return trips to the depot, which can be either done in a reactive or proactive fashion. Over the years, there have been various policies defined to perform these recourse actions in either a static or a dynamic setting. In the present paper, we propose policies that better reflect the fixed operational rules that can be observed in practice and that also enable implementing preventive recourse actions. We define the considered operational rules and show how, for a planned route, these operational rules can be implemented using a fixed threshold-based policy to govern the recourse actions. An exact solution algorithm is developed to solve the VRPSD under the considered policies. Finally, we conduct an extensive computational study, which shows that significantly better solutions can be obtained when using the proposed policies compared with solving the problem under the classic recourse definition.

Exact solution of a four-site crystal model for an intermediate-valence system

1986 ◽  
Vol 47 (6) ◽  
pp. 1029-1034 ◽  
Author(s):  
J.C. Parlebas ◽  
R.H. Victora ◽  
L.M. Falicov
Keyword(s):  
Exact Solution ◽  
Intermediate Valence ◽  
Crystal Model
Sign in / Sign up

Export Citation Format

Share Document