100 research outputs found

    Optimizing and Reoptimizing: tackling static and dynamic combinatorial problems

    Get PDF
    As suggested by the title, in this thesis both static and dynamic problems of Operations Research will be addressed by either designing new procedures or adapting well-known algorithmic schemes. Specifically, the first part of the thesis is devoted to the discussion of three variants of the widely studied Shortest Path Problem, one of which is defined on dynamic graphs. Namely, first the Reoptimization of Shortest Paths in case of multiple and generic cost changes is dealt with an exact algorithm whose performance is compared with Dijkstra's label setting procedure in order to detect which approach has to be preferred. Secondly, the k-Color Shortest Path Problem is tackled. It is a recent problem, defined on an edge-constrained graph, for which a Dynamic Programming algorithm is proposed here; its performance is compared with the state of the art solution approach, namely a Branch & Bound procedure. Finally, the Resource Constrained Clustered Shortest Path Tree Problem is presented. It is a newly defined problem for which both a mathematical model and a Branch & Price procedure are detailed here. Moreover, the performance of this solution approach is compared with that of CPLEX solver. Furthermore, in the first part of the thesis, also the Path Planning in Urban Air Mobility, is discussed by considering both the definition of the Free-Space Maps and the computation of the trajectories. For the former purpose, three different but correlated discretization methods are described; as for the latter, a two steps resolution, offline and online, of the resulting shortest path problems is performed. In addition, it is checked whether the reoptimization algorithm can be used in the online step. In the second part of this thesis, the recently studied Additive Manufacturing Machine Scheduling Problem with not identical machines is presented. Specifically, a Reinforcement Learning Iterated Local Search meta-heuristic featuring a Q-learning Variable Neighbourhood Search is described to solve this problem and its performance is compared with the one of CPLEX solver. It is worthwhile mentioning that, for each of the proposed approaches, a thorough experimentation is performed and each Chapter is equipped with a detailed analysis of the results in order to appraise the performance of the method and to detect its limits

    AIRO 2016. 46th Annual Conference of the Italian Operational Research Society. Emerging Advances in Logistics Systems Trieste, September 6-9, 2016 - Abstracts Book

    Get PDF
    The AIRO 2016 book of abstract collects the contributions from the conference participants. The AIRO 2016 Conference is a special occasion for the Italian Operations Research community, as AIRO annual conferences turn 46th edition in 2016. To reflect this special occasion, the Programme and Organizing Committee, chaired by Walter Ukovich, prepared a high quality Scientific Programme including the first initiative of AIRO Young, the new AIRO poster section that aims to promote the work of students, PhD students, and Postdocs with an interest in Operations Research. The Scientific Programme of the Conference offers a broad spectrum of contributions covering the variety of OR topics and research areas with an emphasis on “Emerging Advances in Logistics Systems”. The event aims at stimulating integration of existing methods and systems, fostering communication amongst different research groups, and laying the foundations for OR integrated research projects in the next decade. Distinct thematic sections follow the AIRO 2016 days starting by initial presentation of the objectives and features of the Conference. In addition three invited internationally known speakers will present Plenary Lectures, by Gianni Di Pillo, FrĂ©dĂ©ric Semet e Stefan Nickel, gathering AIRO 2016 participants together to offer key presentations on the latest advances and developments in OR’s research

    Journal of Telecommunications and Information Technology, 2005, nr 3

    Get PDF

    LIPIcs, Volume 251, ITCS 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 251, ITCS 2023, Complete Volum

    27th Annual European Symposium on Algorithms: ESA 2019, September 9-11, 2019, Munich/Garching, Germany

    Get PDF

    LIPIcs, Volume 261, ICALP 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 261, ICALP 2023, Complete Volum
    • 

    corecore