Operations Research and Enterprise Systems

Name: Operations Research and Enterprise Systems | 4th International Conference, ICORES 2015, Lisbon, Portugal, January 10-12, 2015, Revised Selected Papers
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

4th International Conference, ICORES 2015, Lisbon, Portugal, January 10-12, 2015, Revised Selected Papers

Dominique de Werra Greg H. Parlier Begoña Vitoriano(Herausgeber*in)

Springer (Verlag)

Erschienen am 14. Dezember 2015

XII, 249 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-319-27680-9 (ISBN)

53,49 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

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 Kosice
3.2 Benchmarks Zilina 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

Systemvoraussetzungen

Als PDF speichern Als Link merken