Konstantinos N. Androutsopoulos

Konstantinos N. Androutsopoulos

Auto-generated profile, based on publicly available information

Konstantinos N. Androutsopoulos

Department of Management Science and Technology, School of Business, Athens University of Economics and Business, Athens, Greece

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 September 2016 in Journal of Scheduling
Verified
Journal Article
Open access
PDF file
KZKonstantinos G. Zografos
Konstantinos G. Zografos
Michael MadasMichael Madas
Michael Madas
KAKonstantinos N. Androutsopoulos
Konstantinos N. Androutsopoulos
Most of the busiest airports worldwide experience serious congestion and delay problems which call for some immediate capacity and demand management action. Solutions aiming to manage congestion through better slot scheduling have lately received a great deal of consideration due to their potential for delivering quick and substantial capacity utilisation improvements. A slot scheduling approach brings promises to cope better with congestion problems in the short to medium run and in a more sustainable way based on existing resources. This paper aims to provide a critical review of current research in declared capacity modelling and strategic slot scheduling. Furthermore, it goes beyond the critical review of current research developments by identifying future research issues and gaps and developing concrete directions towards modelling and solving advanced single airport and network-based slot scheduling problems. Our research findings suggest that the next generation of slot scheduling models should explore variations of currently used objectives (e.g., alternative expressions of schedule delay) and most importantly enrich them with fairness and equity, resource utilisation and environmental considerations. Future modelling efforts should also aim to further investigate airlines’ utility of alternative slot allocation outcomes, including various acceptability measures and levels of tolerance against schedule displacements. Last but not least, future research should intensively focus on the development and validation of computationally viable and robust slot scheduling models being able to capture the complexity, dynamic nature and weather-induced uncertainty of airport operations, along with hybrid solution approaches being able to deal with the size and complexity of slot allocation at network level.

1 February 2002 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Closed access
KZKonstantinos G Zografos
Konstantinos G Zografos
KAKonstantinos N Androutsopoulos
Konstantinos N Androutsopoulos
GVGeorge M Vasilakis
George M Vasilakis

1 June 2012 in EURO Journal on Transportation and Logistics
Verified
Journal Article
Open access
PDF file
KAKonstantinos N. Androutsopoulos
Konstantinos N. Androutsopoulos
KZKonstantinos G. Zografos
Konstantinos G. Zografos
Planning hazardous materials distribution routes for servicing a given set of orders within specified time windows is a problem frequently surfacing in a city logistics environment which is characterized by dynamic travel times. The hazardous materials distribution problem involves the determination of the sequence of deliveries and the corresponding paths assigned to each truck. This paper presents the formulation of the hazardous materials distribution problem as a bi-objective time-dependent vehicle routing problem with time windows. The paper presents the mathematical formulation of the problem as an integer network flow model with multiple objectives. The weighted-sum method is applied decomposing the bi-objective vehicle routing and scheduling problem to a series of single-objective instances of the problem, where the objective function is expressed by the weighted sum of the criteria under consideration. A route-building heuristic algorithm is presented for addressing each of the constituent single-objective problems, where stops are inserted iteratively in the front part of the unfinished route. A label-setting algorithm is integrated in the heuristic algorithm for solving the time-dependent shortest path problem with multiple intermediate stops arising after the insertion of any stop in the route. The proposed solution approach has been applied to a set of solvable test problems to assess the accuracy of the heuristic solutions. The results indicate a tolerable deviation of the heuristic solutions from the actual non-dominated solutions. In addition, the proposed algorithm was applied to a set of test problems resembling real-life problem cases. The average computational time needed for solving this type of test problems is not prohibitive.

26 December 2023 in Annals of Operations Research
Verified
Journal Article
Open access
PDF file
KAKonstantinos N. Androutsopoulos
Konstantinos N. Androutsopoulos
KZKonstantinos G. Zografos
Konstantinos G. Zografos
This paper presents a real-world liquid fuel distribution problem involving a heterogeneous fleet of multi-compartment vehicles servicing a set of orders of different fuels. Two new features are introduced that affect significantly the performance of the fuel distribution process in terms of safety and efficiency: (i) loading trucks so that the payload remains balanced throughout each phase of a delivery route, and (ii) sequencing the requests for loading trucks at the depot loading facilities. A Mixed Integer Programming formulation is presented and an Adaptive Large Neighbourhood Search algorithm with various novel features is developed and benchmarked. A new loading model is formed and solved for allocating the ordered items (fuel) to vehicle compartments, as part of constructing/repairing delivery routes. The computational performance of the proposed solution approach has been tested on a series of benchmark problems. Moreover, a series of experiments were performed in order to assess the effect of the balanced loading constraints on the traveled distance. The results indicate that the effect of this type of constraint on the total traveled distance is kept at a reasonable level, reaching a maximum increase of 4.37%. The computational tools presented in this work may accommodate the dispatchers’ work in producing efficient and safe delivery routes while managing efficiently any potential bottleneck in the truck loading facilities.

2 September 2022 in Operational Research
Verified
Journal Article
Closed access
PDF file
KAKonstantinos N. Androutsopoulos
Konstantinos N. Androutsopoulos
EKEleni Karouti
Eleni Karouti