Operations Research and Enterprise Systems : 5th International Conference, ICORES 2016, Rome, Italy, February 23-25, 2016, Revised Selected Papers / / edited by Begoña Vitoriano, Greg H. Parlier |
Edizione | [1st ed. 2017.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
Descrizione fisica | 1 online resource (XII, 261 p. 77 illus.) |
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-53982-5 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910254839003321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
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 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Operations Research and Enterprise Systems : Third International Conference, ICORES 2014, Angers, France, March 6-8, 2014, Revised Selected Papers / / edited by Eric Pinson, Fernando Valente, Begoña Vitoriano |
Edizione | [1st ed. 2015.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
Descrizione fisica | 1 online resource (XII, 301 p. 61 illus.) |
Disciplina | 658.4034 |
Collana | Communications in Computer and Information Science |
Soggetto topico |
Computer science—Mathematics
Application software Information technology Business—Data processing Production management Mathematics of Computing Information Systems Applications (incl. Internet) Computer Applications IT in Business Operations Management |
ISBN | 3-319-17509-2 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Invited Paper -- Learning Tabu Search for Combinatorial Optimization -- 1 Introduction -- 2 Learning Tabu Search (LTS) -- 3 LTS for a Refueling Problem in a Railway Network -- 4 Conclusion -- References -- Methodologies and Technologies -- Four Serious Problems and New Facts of the Discriminant Analysis -- Abstract -- 1 Introduction -- 2 Discriminant Functions -- 2.1 Statistical Discriminant Functions -- 2.2 Before and After SVM -- 2.3 IP-OLDF and Revised IP-OLDF -- 3 The Unresolved Problem (Problem 1) -- 3.1 Perception Gap of This Problem -- 3.2 The Student Data -- 4 The Discrimination of Linear Separable Data (Problem 2) -- 4.1 The Importance of This Problem -- 4.2 Pass/Fail Determination -- 4.3 Discrimination by Four Testlets -- 5 Problem 3 (Discrimination of 44 Japanese Cars) -- 6 K-fold Cross Validation (Problem 4) -- 6.1 Hundred-Fold Cross Validation -- 6.2 LOO and K--Fold Cross Validation -- 7 Conclusions -- References -- Simulated Annealing Algorithm for Job Shop Scheduling on Reliable Real-Time Systems -- Abstract -- 1 Introduction -- 2 Problem Formulation -- 3 Proposed Problem Solution -- 3.1 Selecting the Method -- 3.2 Simulated Annealing Algorithm Description -- 4 Experiments -- 5 Conclusions -- References -- Nash Equilibria for Multi-agent Network Flow with Controllable Capacities -- 1 Introduction -- 2 Problem Statement and Notations -- 2.1 Problem Definition -- 2.2 Mathematical Formulation -- 3 Efficiency vs. Stability -- 4 Case Analysis -- 4.1 The Single-Agent Case -- 4.2 The Multi-agent Case -- 4.3 The Special Case |Eu|=1, Au -- 5 Problem Complexity -- 5.1 Finding a Feasible Solution -- 5.2 Finding a Nash Equilibrium with Bounded Flow -- 6 Conclusions -- References -- A Fuzzy Model for Selecting Safeguards to Reduce Risks in Information Systems -- 1 Introduction.
2 Selection of Preventive Safeguards -- 3 An Illustrative Example -- 4 Conclusions -- References -- A Performance Improvement and Management Model for Small and Medium Sized Enterprises -- Abstract -- 1 Introduction -- 2 Performance Measurement Systems in SME -- 3 SME and the Challenges -- 4 Analytical Hierarchy Process (AHP) -- 5 SCOR Performance Levels and Attributes -- 6 The Approach -- 7 Case Study -- 8 Results and Discussion -- 9 Conclusion -- References -- Adjacency Variables Formulation for the Minimum Linear Arrangement Problem -- 1 Introduction -- 2 A Linear Formulation with O(n2) Variables -- 3 Lifting Valid Inequalities -- 4 Degree Valid Equalities -- 5 Partitioning Cuts -- 5.1 Separation Problem -- 5.2 Cutting Planes Algorithm -- 5.3 Solving the Graph Partitioning Problem -- 6 Numerical Experiments -- 7 Conclusion and Perspectives -- References -- A Vessel Scheduling Problem with Special Cases -- 1 Introduction -- 2 Problem Definition -- 3 Special Cases -- 3.1 Backward Heuristic -- 3.2 Greedy Heuristic -- 3.3 Improved Greedy Heuristic -- 3.4 Bender's Type Decomposition Approach -- 4 Computational Results -- 5 Delivery with Time-Windows -- 5.1 Formulation -- 6 Conclusions -- References -- Archimedean Copulas in Joint Chance-Constrained Programming -- 1 Introduction -- 2 Dependence -- 2.1 Basic Facts About Copulas -- 2.2 Introducing Normal Distribution -- 2.3 Convexity -- 3 Main Result -- 3.1 Convex Reformulation -- 3.2 SOCP Approximation -- 4 Conclusions -- References -- Comparison of Stochastic Programming Approaches for Staffing and Scheduling Call Centers with Uncertain Demand Forecasts -- 1 Introduction -- 2 Staffing Problem Modeling -- 3 Problem Formulation -- 4 Solution Approximations -- 4.1 Definition of Function -- 4.2 Convexity of y FBt-1(py) -- 4.3 Piecewise Linear Approximation -- 4.4 Piecewise Tangent Approximation. 5 Numerical Experiments -- 5.1 Instance -- 5.2 Comparison with Other Programs -- 5.3 Results -- 6 Staffing and Scheduling Problems in Two Steps -- 6.1 The Requirements Bt as Random Normal Variables -- 6.2 Results Comparison -- 7 Conclusion -- References -- A New Look at the Covariance Matrix Estimation in Evolution Strategies -- 1 Introduction -- 1.1 Evolution Strategies -- 1.2 Covariance Matrix Adaptation -- 1.3 Step-Size Adaptation -- 2 Concerning the Covariance Estimator -- 3 Approaches for Estimating the Covariance -- 3.1 Shrinkage Estimators -- 3.2 A Maximum Entropy Covariance Estimation -- 3.3 New Covariance Estimators -- 4 Experimental Evaluation -- 4.1 Test Suite -- 4.2 Performance Measure -- 4.3 Results and Discussion -- 5 Conclusions -- References -- A Relax and Fix Approach to Solve the Fixed Charge Network Design Problem with User-Optimal Flow -- 1 Introduction -- 2 General Description of the FCNDP-UOF -- 2.1 Mathematical Formulation -- 3 Solution Approach -- 3.1 Partial Decoupling Heuristic -- 3.2 Relax and Fix Heuristic -- 3.3 PDRF -- 4 Computational Results -- 4.1 Statistical Analysis -- 5 Conclusion and Future Works -- References -- Analysis of a Downward Substitution Strategy in a Manufacturing/Remanufacturing System -- Abstract -- 1 Introduction -- 2 Literature Review -- 3 Problem Description -- 4 Numerical Experiments and Results -- 5 Conclusions -- Acknowledgements -- References -- Risk Tolerance Evaluation for an Oil and Gas Company Using a Multi-criteria Approach -- Abstract -- 1 Introduction -- 2 Problem Formulation -- 2.1 Physical Earnings Formulation -- 2.2 Derivatives Payout Formulation -- 2.3 Company Earnings Formulation -- 3 Prices Modeling -- 4 Risk Modelling -- 4.1 Risk Measures -- 4.2 Risk Tolerance -- 4.3 Risk Tolerance Evaluation Methods -- 5 Optimization Results -- 6 Multi-criteria Evaluation -- 7 Conclusions. References -- A Mathematical Programming Model for the Real Time Traffic Management of Railway Networks Under Disturbances -- 1 Introduction -- 2 Problem Formalization -- 2.1 Initial Scheduling -- 2.2 Disturbances Issues -- 3 Mathematical Modeling -- 3.1 Decision Variables -- 3.2 Linearization of Safety Constraints -- 3.3 Objective Functions -- 4 Numerical Experiments -- 4.1 One Disturbance on the Line -- 4.2 Two Disturbances on the Line -- 5 Conclusions and Perspectives -- References -- Applications -- Solving to Optimality a Discrete Lot-Sizing Problem Thanks to Multi-product Multi-period Valid Inequalities -- 1 Introduction -- 2 MILP Formulation -- 2.1 Initial MILP Formulation -- 2.2 Single-Product Valid Inequalities -- 3 New Multi-product Valid Inequalities -- 4 Separation Problem -- 4.1 Exact Separation Algorithm -- 4.2 Heuristic Separation Algorithm -- 4.3 Cutting-Plane Generation Algorithm -- 5 Computational Results -- 6 Conclusions -- References -- A Quadratic Knapsack Model for Optimizing the Media Mix of a Promotional Campaign -- 1 Introduction -- 2 Formal Problem Formulation -- 3 Quadratic Knapsack Model -- 4 Linear and Quadratic Effect Estimation -- 4.1 Considering Similarity of Campaigns -- 4.2 Estimation of Media Interaction -- 5 Budget Allocation -- 5.1 Estimation of Budget Values -- 5.2 Actual Budget Allocation -- 6 Memory Perspective -- 7 Solution of the Quadratic Knapsack Problem -- 8 Conclusions -- References -- A Decomposition Approach to Solve Large-Scale Network Design Problems in Cylinder Gas Distribution -- Abstract -- 1 Introduction -- 2 Literature Review -- 3 Problem Description -- 3.1 Multi-products Network -- 3.2 Plant Locations and Filling Tools -- 3.3 Cylinder Flows -- 3.4 Primary Transport Cost -- 3.5 Secondary Transport Cost -- 3.6 Trucks -- 3.7 Inventory Management -- 4 Mathematical Model -- 5 Solution Approach. 5.1 Mono-Product Approximation -- 5.2 Two-Steps Decomposition -- 6 Numerical Results -- 7 Conclusions -- References -- Elaboration of General Lower Bounds for the Total Completion Time in Flowshop Scheduling Problems through MaxPlus Approach -- 1 Introduction -- 2 Context and Definitions -- 2.1 MaxPlus Algebra -- 2.2 Flowshop Scheduling Problem -- 3 MaxPlus Modeling of Flowshop Scheduling Problems -- 4 Proposed Lower Bounds -- 4.1 The First Lower Bound -- 4.2 Additional Similar Lower Bounds -- 5 Branch-and-Bound Algorithm -- 5.1 Proposed Branch-and-Bound Procedure -- 5.2 Lower Bound Selection Strategy -- 6 Experimental Results -- 7 Conclusions -- References -- Author Index. |
Record Nr. | UNINA-9910299235003321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|