top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Combinatorial Models for Scheduling Sports Tournaments / / Celso C. Ribeiro, Sebastián Urrutia, and Dominique de Werra
Combinatorial Models for Scheduling Sports Tournaments / / Celso C. Ribeiro, Sebastián Urrutia, and Dominique de Werra
Autore Ribeiro Celso C.
Edizione [First edition.]
Pubbl/distr/stampa Cham, Switzerland : , : Springer Nature Switzerland AG, , [2023]
Descrizione fisica 1 online resource (xxv, 175 pages) : illustrations (some color)
Disciplina 511.6
Collana EURO Advanced Tutorials on Operational Research Series
Soggetto topico Combinatorial analysis
Scheduling - Mathematical models
Sports tournaments - Management
Sports tournaments - Mathematical models
ISBN 3-031-37283-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Foreword -- Preface -- Acknowledgments -- Contents -- List of Abbreviations and Acronyms -- List of Algorithms -- List of Figures -- List of Tables -- 1 Leagues, Tournaments, and Schedules -- 1.1 Tournament Characteristics -- 1.1.1 Compactness -- 1.1.2 Scheduling Timing -- 1.1.3 Design -- 1.1.3.1 Round-Robin Tournaments -- 1.1.3.2 Knockout or Single-Elimination Tournaments -- 1.1.3.3 Swiss-System Tournaments -- 1.2 Professional Versus Amateur Leagues -- 1.3 Typical Problems -- 1.3.1 Break Minimization -- 1.3.2 Distance Minimization -- 1.3.3 Traveling Tournament Problem -- 1.3.4 Cost Minimization -- 1.3.5 Carry-Over Effects -- 1.3.6 Referee Assignment and Umpire Scheduling -- 1.3.7 Multileague Scheduling -- 1.3.8 International Timetabling Competition -- 1.4 Book Organization -- 1.5 Related Literature -- References -- 2 Combinatorial Structures -- 2.1 Elements of Graph Theory -- 2.2 Basic Graph Model for Single Round-Robin Tournaments -- 2.3 From Timetables to Schedules: Home and Away Games -- 2.4 Another Type of 1-Factorization -- 2.5 Multi-Round-Robin Tournaments -- 2.6 On the Structure of HAPs with a Minimum Number of Breaks -- 2.7 Constructing Schedules from HAPs or from Timetables -- 2.8 Minimizing the Number of Rounds with Breaks -- 2.9 Fairness of Schedules -- 2.10 Travel Minimization and Break Maximization -- 2.11 Balanced Tournaments -- 2.12 Tournaments with Referees -- 2.13 Carry-Over Effects -- 2.14 List-Edge Coloring -- 2.15 Exploring the Landscape of Edge Colorings -- 2.16 How to Find General 1-Factorizations? -- 2.17 Concluding Remarks -- 2.18 Related Literature -- References -- 3 Metaheuristics and Local Search -- 3.1 Exact and Approximate Optimization Methods -- 3.2 Greedy and Semi-Greedy Algorithms -- 3.3 Local Search -- 3.3.1 Solution Representation, Neighborhoods, and Search Space -- 3.3.2 Local Search Strategies.
3.3.3 Variable Neighborhood Descent -- 3.4 Metaheuristics and Templates -- 3.4.1 Simulated Annealing -- 3.4.2 Tabu Search -- 3.4.3 Greedy Randomized Adaptive Search Procedures -- 3.4.4 Variable Neighborhood Search -- 3.4.5 Iterated Local Search -- 3.4.6 Genetic Algorithms -- 3.5 Neighborhoods for Round-Robin Tournaments -- 3.5.1 Neighborhood ``Home-Away Swap'' (HAS) -- 3.5.2 Neighborhood ``Team Swap'' (TS) -- 3.5.3 Neighborhood ``Round Swap'' (RS) -- 3.5.4 Neighborhood ``Partial Round Swap'' (PRS) -- 3.5.5 Neighborhood ``Partial Team Swap'' (PTS) -- 3.5.6 Neighborhood ``Generalized Partial Team Swap'' (GPTS) -- 3.5.7 Ejection and Repair Chains -- 3.6 Connectivity of the Tournament Space -- 3.7 Related Literature -- References -- 4 Integer Programming Approaches -- 4.1 Motivation -- 4.2 The Traveling Tournament Problem with Predefined Venues -- 4.3 Preliminaries -- 4.4 Integer Programming Formulations -- 4.4.1 Formulation with O(n3) Variables -- 4.4.2 Formulation with O(n4) Variables -- 4.4.3 Formulation with O(n5) Variables -- 4.4.4 Linear Relaxation Bounds and Computational Results -- 4.5 Related Literature -- References -- 5 Case Studies -- 5.1 Minimizing Weighted Carry-Over Effects in Round-Robin Tournaments -- 5.1.1 Motivation -- 5.1.2 Formulation of the Weighted Problem -- 5.1.3 Hybrid Heuristic for Weighted Minimization -- 5.1.3.1 Construction Method for Building New Schedules -- 5.1.3.2 Local Search -- 5.1.3.3 Iterated Local Search -- 5.1.3.4 Iterated Local Search with Destructive Perturbations -- 5.1.4 Computational Results -- 5.1.4.1 Weighted Instances -- 5.1.4.2 Validation: Unweighted Instances -- 5.1.4.3 Destructive Neighboorhoods -- 5.2 Scheduling the Annual Brazilian Football Tournament -- 5.2.1 Tournament Structure -- 5.2.2 Schedule Requirements -- 5.2.2.1 Round-Robin Constraints -- 5.2.2.2 Home-Away Profiles of Game Playing.
5.2.2.3 Classic and Regional Games -- 5.2.2.4 Geographical and G12 Constraints -- 5.2.2.5 Perfect Matching of Paired Teams -- 5.2.3 Integer Programming Formulation -- 5.2.4 Solution Approach -- 5.2.4.1 Phase 1: Profile Generation -- 5.2.4.2 Phase 2: Profile Assignment -- 5.2.4.3 Phase 3: Schedule Creation -- 5.2.5 Development and Practical Experience -- 5.3 Dynamic Scheduling of E-Sports Tournaments -- 5.3.1 Rating Teams with Opponents of Different Strengths -- 5.3.2 Dynamic Scheduling: Team Pairing and Game Scheduling -- 5.3.3 Numerical Results -- 5.3.3.1 Simulated Results for Dynamic Scheduling from Realistic Data -- 5.3.3.2 Results for Randomly Generated Larger Tournaments -- 5.3.4 Concluding Remarks -- 5.4 Related Literature -- References -- Epilogue.
Record Nr. UNINA-9910746950603321
Ribeiro Celso C.  
Cham, Switzerland : , : Springer Nature Switzerland AG, , [2023]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Operations Research and Enterprise Systems : 4th International Conference, ICORES 2015, Lisbon, Portugal, January 10-12, 2015, Revised Selected Papers / / edited by Dominique De Werra, Greg H. Parlier, Begoña Vitoriano
Operations Research and Enterprise Systems : 4th International Conference, ICORES 2015, Lisbon, Portugal, January 10-12, 2015, Revised Selected Papers / / edited by Dominique De Werra, Greg H. Parlier, Begoña Vitoriano
Edizione [1st ed. 2015.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Descrizione fisica 1 online resource (XII, 249 p. 64 illus. in color.)
Disciplina 658.4034
Collana Communications in Computer and Information Science
Soggetto topico Computer science—Mathematics
Application software
Production management
Operations research
Management science
Information technology
Business—Data processing
Mathematics of Computing
Information Systems Applications (incl. Internet)
Computer Applications
Operations Management
Operations Research, Management Science
IT in Business
ISBN 3-319-27680-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- Organization -- Contents -- Methodologies and Technologies -- Distributionally Robust Optimization for Scheduling Problem in Call Centers with Uncertain Forecasts -- 1 Introduction -- 2 Problem Formulation -- 2.1 Staffing Model -- 2.2 Computation of Staffing Requirements -- 2.3 Distributionally Robust Model -- 3 Deterministic Equivalent Problem -- 3.1 Dealing with the Constraints -- 3.2 Linear Approximations -- 4 Numerical Experiments -- 4.1 Instance -- 4.2 Results -- 5 Stochastic Approach with a Wrong Assumption vs Distributionally Robust Approach -- 5.1 Stochastic Program with Normal Distribution -- 5.2 Comparison on Instances -- 6 Conclusion -- References -- A Comparison of a Global Approach and a Decomposition Method for Frequency Assignment in Multibeam Satellite Systems -- 1 Introduction -- 2 The Problem Constraints -- 2.1 Frequency Related Constraints -- 2.2 Amplification of the Signals Constraints -- 3 Models -- 3.1 Global Constraint Programming Model -- 3.2 Multiprocessor Scheduling Part -- 3.3 Path Covering Part -- 4 Experimental Results -- 5 Conclusion -- References -- Selection-Based Approach to Cooperative Interval Games -- 1 Introduction -- 2 Preliminaries -- 2.1 Classical Cooperative Game Theory -- 2.2 Interval Analysis -- 2.3 Cooperative Interval Games -- 3 Selection-Based Classes of Interval Games -- 4 Core Coincidence -- 5 Strong Imputation and Core -- 6 Concluding Remarks -- References -- Re-aggregation Heuristic for Large P-median Problems -- 1 Introduction -- 2 Materials and Methods -- 2.1 The P-median Problem -- 2.2 Data Model -- 2.3 Aggregation Errors -- 2.4 The Row-Column Aggregation Method -- 2.5 The Re-aggregation Heuristic -- 2.6 Evaluation of Performance -- 3 Numerical Results -- 3.1 Benchmarks Partizánske and Košice -- 3.2 Benchmarks Žilina and Slovakia -- 4 Conclusions -- References.
Meeting Locations in Real-Time Ridesharing Problem: A Buckets Approach -- 1 Introduction -- 2 Background -- 3 Problem Description and Notation -- 3.1 Matching Constraints -- 3.2 Objective Function -- 4 Solution Approach -- 4.1 Search Space of Potential Meeting Locations -- 4.2 Intermediate Meeting Locations Selection -- 5 Best Offer Considerations -- 5.1 Adding an Offer -- 5.2 Removing Outdated Offers -- 5.3 Exact Offer Selection -- 5.4 Heuristic Offer Selection -- 6 Minimum Cost-Savings Rate -- 7 Computational Experiments and Discussion -- 8 Conclusion -- References -- Stochastic Semidefinite Optimization Using Sampling Methods -- 1 Introduction -- 2 Chance Constrained Semidefinite Program -- 3 Simulation-Based Approximation -- 3.1 Scenario Approach -- 3.2 Big-M Semidefinite Sampling Approach -- 3.3 Combination of Big-M and Constraints Discarding -- 4 Numerical Experiments -- 4.1 Control System Problem -- 4.2 Sampling Procedure -- 4.3 Numerical Experiments -- 4.4 Numerical Results -- 5 Conclusion -- References -- Evaluation of Partner Companies Based on Fuzzy Inference System for Establishing Virtual Enterprise Consortium -- 1 Introduction -- 2 Fuzzy Inference System -- 3 Partner Selection Model -- 3.1 Input Variables of Fuzzy Inference System -- 3.2 Output Variable of Fuzzy Inference System -- 3.3 Fuzzy Rules -- 4 Illustrative Example -- 5 Conclusions -- References -- Applications -- Gasoline Shipper's Problem in Rail Transportation Contract in Thailand -- 1 Introduction -- 2 Formulation -- 3 Analysis -- 4 Numerical Example -- 5 Conclusion -- References -- An Optimization Model for Planning Operations in a Meat Packing Plant -- 1 Introduction -- 2 Problem Statement -- 3 Mathematical Formulation -- 3.1 Sets and Indexes -- 3.2 Decision Variables -- 3.3 Objective Function -- 3.4 Constraints -- 4 Computational Results.
5 Conclusions and Future Research -- References -- The Non-Emergency Patient Transport Modelled as a Team Orienteering Problem -- Abstract -- 1 Introduction -- 2 Transport Problem -- 2.1 Nept Definition -- 2.2 Transport Prescription -- 2.3 Transport Organization -- 2.4 Literature Review -- 3 The Model -- 3.1 Mathematical Model -- 3.2 NEOS Server Experiments -- 4 Heuristic Procedure -- 5 Conclusions -- Acknowledgements -- References -- A Simulation Study of Evaluation Heuristics for Tug Fleet Optimisation Algorithms -- 1 Introduction -- 2 Method -- 2.1 Background and Motivation -- 2.2 A 1D Model of the Tug Fleet Optimisation Problem -- 2.3 The Receding Horizon Genetic Algorithm -- 2.4 Cost Functions -- 2.5 Evaluating Algorithm Performance -- 2.6 Simulator Framework -- 3 Computational Simulation Study -- 3.1 Basic Parameters -- 3.2 Simulation Scenarios -- 3.3 Tug Fleet Optimisation Using the Receding Horizon Genetic Algorithm -- 3.4 Settings of the Genetic Algorithm -- 3.5 Configurations of the Receding Horizon Genetic Algorithm -- 4 Results -- 4.1 Evaluation Heuristic h1 -- 4.2 Evaluation Heuristic h2 -- 5 Discussion -- 5.1 Assessment of the Evaluation Heuristics -- 5.2 The Problem of Parallel Randomness -- 5.3 Future Work -- 5.4 Final Remarks -- References -- Extended Decomposition for Mixed Integer Programming to Solve a Workforce Scheduling and Routing Problem -- 1 Introduction -- 2 Literature Review -- 3 Problem Description and Formulation -- 4 Decomposition Approach and Study -- 4.1 Test Instances -- 4.2 Geographical Decomposition with Conflict Avoidance -- 4.3 Experimental Study of the Decomposition Method -- 4.4 Geographical Decomposition with Neighbour Workforce -- 4.5 Comparing to a Genetic Algorithm -- 5 Conclusion and Future Work -- References -- Local Search Based Metaheuristics for Two-Echelon Distribution Network with Perishable Products.
1 Introduction -- 2 Literature Review -- 3 Problem Description -- 4 Mathematical Model -- 4.1 Notations -- 4.2 Stock Cost Formulation -- 4.3 MILP Formulation -- 5 Methods -- 5.1 Variable Neighborhood Descent -- 5.2 Neighborhood Space Reduction -- 5.3 Iterated Local Search -- 5.4 Multi-start Iterated Local Search -- 6 Computational Evaluation -- 6.1 Instances -- 6.2 Results -- 7 Conclusion -- References -- Critical Activity Analysis in Precedence Diagram Method Scheduling Network -- Abstract -- 1 Introduction -- 2 Scheduling Techniques Overview -- 2.1 Critical Path Method -- 2.2 Precedence Diagram Method -- 3 Problem Describtion -- 4 Previous Researches -- 5 Network Formulation and Basic Assumption -- 6 Classification of Critical Activities -- 6.1 Critical Activity on Single Path -- 6.2 Critical Activity on Multi-path -- 7 Determining Float for Critical Activity -- 7.1 Float for Non-critical Activity -- 7.2 Float for Critical Activity -- 8 Case Study -- 9 Conclusions -- References -- Author Index.
Record Nr. UNINA-9910298962003321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui