The multi-objective Steiner pollution-routing problem on congested urban road networks

This paper introduces the Steiner Pollution-Routing Problem (SPRP) as a realistic variant of the PRP that can take into account the real operating conditions of urban freight distribution. The SPRP is a multi-objective, time and load dependent, fleet size and mix PRP, with time windows, flexible departure times, and multi-trips on congested urban road networks, that aims at minimising three objective functions pertaining to (i) vehicle hiring cost, (ii) total amount of fuel consumed, and (iii) total makespan (duration) of the routes. The paper focuses on a key complication arising from emissions minimisation in a time and load dependent setting, corresponding to the identification of the full set of the eligible road-paths between consecutive truck visits a priori, and to tackle the issue proposes new combinatorial results leading to the development of an exact Path Elimination Procedure (PEP). A PEP-based Mixed Integer Programming model is further developed for the SPRP and embedded within an efficient mathematical programming technique to generate the full set of the non-dominated points on the Pareto frontier of the SPRP. The proposed model considers truck instantaneous Acceleration/Deceleration (A/D) rates in the fuel consumption estimation, and to address the possible lack of such data at the planning stage, a new model for the construction of reliable synthetic spatiotemporal driving cycles from available macroscopic traffic speed data is introduced. Several analyses are conducted to: (i) demonstrate the added value of the proposed approach, (ii) exhibit the trade-off between the business and environmental objectives on the Pareto front of the SPRP, (iii) show the benefits of using multiple trips, and (iv) verify the reliability of the proposed model for the generation of driving cycles. A real road network based on the Chicago's arterial streets is also used for further experimentation with the proposed PEP algorithm. © 2019 Elsevier Lt

Applications of stochastic modeling in air traffic management : Methods, challenges and opportunities for solving air traffic problems under uncertainty

In this paper we provide a wide-ranging review of the literature on stochastic modeling applications within aviation, with a particular focus on problems involving demand and capacity management and the mitigation of air traffic congestion. From an operations research perspective, the main techniques of interest include analytical queueing theory, stochastic optimal control, robust optimization and stochastic integer programming. Applications of these techniques include the prediction of operational delays at airports, pre-tactical control of aircraft departure times, dynamic control and allocation of scarce airport resources and various others. We provide a critical review of recent developments in the literature and identify promising research opportunities for stochastic modelers within air traffic management

An Optimisation Framework for Airline Fleet Maintenance Scheduling with Tail Assignment Considerations

Fierce competition between airlines has led to the need of minimising the operating costs while also ensuring quality of service. Given the large proportion of operating costs dedicated to aircraft maintenance, cooperation between airlines and their respective maintenance provider is paramount. In this research, we propose a framework to develop commercially viable and maintenance feasible flight and maintenance schedules. Such framework involves two multi-objective mixed integer linear programming (MMILP) formulations and an iterative algorithm. The first formulation, the airline fleet maintenance scheduling (AMS) with violations, minimises the number of maintenance regulation violations and the number of not airworthy aircraft; subject to limited workshop resources and current maintenance regulations on individual aircraft flying hours. The second formulation, the AMS with tail assignment (TA) allows aircraft to be assigned to different flights. In this case, subject to similar constraints as the first formulation, six lexicographically ordered objective functions are minimised. Namely, the number of violations, maximum resource level, number of tail reassignments, number of maintenance interventions, overall resource usage, and the amount of maintenance required by each aircraft at the end of the planning horizon. The iterative algorithm ensures fast computational times while providing good quality solutions. Additionally, by tracking aircraft and using precise flying hours between maintenance opportunities, we ensure that the aircraft are airworthy at all times. Computational tests on real flight schedules over a 30-day planning horizon show that even with multiple airlines and workshops (16000 flights, 529 aircraft, 8 maintenance workshops) our solution approach can construct near-optimal maintenance schedules within minutes

Proton Therapy for Uveal Melanoma in 43 Juvenile Patients: Long-Term Results.

PURPOSE: To examine the metastatic and survival rates, eye retention probability, and the visual outcomes of juvenile patients after proton beam radiotherapy (PBRT) for uveal melanoma (UM). DESIGN: Retrospective case-factor matched control study. PARTICIPANTS AND CONTROLS: Forty-three patients younger than 21 years treated with PBRT for UM were compared with 129 matched adult control patients. METHODS: Information on patient demographics and clinical characteristics were recorded before and after treatment from patients' files. The control group was composed of adult patients (>21 years) matched for tumor size (largest tumor diameter, ±2 mm; height, ±2 mm) and anterior margin location (iris, ciliary body, pre-equatorial or postequatorial choroid). For each juvenile patient, 3 adults were selected. MAIN OUTCOME MEASURES: Comparing outcomes of juvenile and adult patients in terms of metastatic and eye retention rates using the log-rank statistic, relative survival using the Hakulinen method, as well as their visual outcomes. RESULTS: Forty-three juvenile and 129 control cases were reviewed. The metastatic rate at 10 years was significantly lower in juvenile UM patients than in adult controls (11% vs. 34%; P <0.01), with an associated relative survival rate of 93% versus 65% (P = 0.02). Six juvenile patients (14%) demonstrated metastases. One patient underwent enucleation because of a presumed local tumor recurrence and 4 additional patients underwent enucleation because of complications (9.3%). In the adult control group, 27% (n = 35) of matched patients demonstrated metastases, there were 2 cases of local recurrence, and 16% (n = 21) underwent enucleation because of complications. A visual acuity of more than 0.10 was maintained in most cases, without any significant differences before or after treatment observed between both groups. CONCLUSIONS: After PBRT, metastatic and survival rates are significantly better for juvenile than for adult patients with UM. Clinically, juvenile and adult eyes react similarly to PBRT, with patients having a comparable eye retention probability and maintaining a useful level of vision in most cases. This is the largest case-control study of proton therapy in juvenile eyes to date and further validates PBRT as an appropriate conservative treatment for UM in patients younger than 21 years

Chronic Pancreatitis and Neoplasia: Correlation or Coincidence

Any link between pancreatic carcinoma and chronic pancreatitis could reflect the malignant potential of a chronic inflammatory process. Four patients with ductal adenocarcinomas had a long history of pancreatic pain (median duration 5 years) and showed clearcut evidence of chronic pancreatitis “downstream” of the tumour. Four were alcoholics and two heavy smokers. These four cases arose within a surgical series of approximately 250 patients with chronic pancreatitis, giving an incidence of 1.6 per cent. The incidence and anatomical distribution of carcinoma and chronic pancreatitis could possibly be consistent with a casual relationship

Considering spatial and temporal flexibility in optimizing one-way electric carsharing systems

Carsharing is a shared-use vehicle model that allows users to rent cars for short periods of times. There are different types of systems according to their operational properties. In round-trip carsharing systems users are expected to return vehicles to their pickup locations. One-way systems relax this restriction and allows users to return cars to different drop-off locations. In station-based systems, there are designated parking locations to which vehicles should be returned. Free-floating systems relax this restriction and allow users to park vehicles to any legal parking locations within a designated area. In this research we are dealing with operational planning decisions in station-based one-way electric carsharing systems with dynamic relocations. Different than the previous work in literature, we introduce spatial and temporal flexibility to the system by considering multiple pick-up and drop-off times and locations at different prices to increase total profit of the system

Modelling and solving the combined inventory routing problem with risk consideration

This work proposes a multi-objective extension of a real-world inventory routing problem (IRP), a generalisation of the classical vehicle routing problem (VRP) with vendor managed inventory (VMI) replenishment. While many mathematical formulations and solution models already exist, this study incorporates business related and risk considerations that makes it unique. It is known that a significant volume of hazardous materials travels every day. Consideration of risks arising from the transportation of hazardous materials as a criterion for selecting distribution routes could potentially reduce the likelihood of accidents and/or the expected consequences of accident