Optimization Theory, Decision Making, and Operations Research Applications

Name: Optimization Theory, Decision Making, and Operations Research Applications | Proceedings of the 1st International Symposium and 10th Balkan Conference on Operational Research
Brand: Springer
Price: 96.29 EUR
Availability: OnlineOnly

Proceedings of the 1st International Symposium and 10th Balkan Conference on Operational Research

Athanasios Migdalas Angelo Sifaleras Christos K. Georgiadis Jason Papathanasiou Emmanouil Stiakakis(Herausgeber*in)

Springer (Verlag)

1. Auflage

Erschienen am 28. November 2012

XVIII, 362 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-1-4614-5134-1 (ISBN)

96,29 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Intro
Optimization Theory, Decision Making, and Operations Research Applications
Preface
Contents
Contributors
BALCOR 2011
Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation
1 Introduction
2 What Is Moderately Exponential Approximation?
3 Generating a ``Small'' Number of Candidate Solutions or Exhaustively Searching a Small Part of Instance
4 Divide-and-Approximate
5 Approximately Pruning the Search Tree
6 Randomization
7 Final Remarks
References
Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem
1 Introduction
2 Mathematical Programming Formulations for ADVRP
2.1 Flow-Based Formulation
2.2 TSP Formulation
3 Branch and Bound for ADVRP
3.1 Lower Bounds
3.2 Tolerance-Based Branching Rule
3.3 Algorithm
3.4 Illustrative Example
4 Multistart Method
4.1 Algorithm
4.2 Illustrative Example
5 An Efficient Implementation: Data Structure
6 Computational Results
7 Conclusions
References
On a Relationship Between Graph Realizability and Distance Matrix Completion
1 Introduction
2 The Distance Geometry Problem
3 The Euclidean Distance Matrix Completion Problem
4 Rigidity and Henneberg type graphs
5 Branch-and-Prune
5.1 Partial reflections
6 BP in distance space
6.1 The main idea
6.2 Formalization and properties
6.3 A dual Branch-and-Prune
References
Effect Oriented Planning of Joint Attacks
1 Introduction
1.1 Network Centric Framework
1.2 Mission Planning
1.3 Paper Overview
2 The Joint Attack Problem
2.1 Tactics and Angles of Attack
2.2 The Objective
3 Mathematical Models
3.1 A Generic Model
3.2 Optimistic Model
3.3 Pessimistic Model
4 Simulation Details
4.1 Specifications of the Defensive System
4.2 Specification of the Objective
4.3 An Illustrative Example
5 Heuristic Solution Methods
5.1 Local Search
5.2 A Constructive Heuristic
5.3 Simulated Annealing
6 Numerical Experiments
6.1 Case 105
6.2 Results for Case 105
6.3 Results for Larger Instances
7 Conclusions and Future Work
References
Competitive Multilevel Capacity Allocation
1 Introduction
2 Bilevel Programming
3 Optimal Facilities Location and Capacity Assignment Under Customer Competition
3.1 Optimal System Location
3.2 Bilevel Problem Formulation Under Customer Competition
3.3 Numerical Comparison of the Models
4 Duopoly
4.1 Competitive Facility Location when Customers Participate in Their Competitive Game
4.2 The Impact of the Duopoly in the Service Level
5 Conclusion
References
A Hybrid Particle Swarm Optimization Algorithmfor the Permutation Flowshop Scheduling Problem
1 Introduction
2 The Permutation Flowshop Scheduling Problem
3 Hybrid Particle Swarm Optimization Algorithm
3.1 General Description
3.2 Variable Neighborhood Search
3.3 Path Relinking
4 Results and Discussion
5 Conclusions
References
Optimization Over Stochastic Integer Efficient Set
1 Introduction
2 Passage to Deterministic Equivalent Problem of MOISLP
3 Theoretical Results
3.1 Feasibility Test
3.2 Optimality Test
4 The Method
5 The Algorithm
6 Didactic Example
7 Conclusion
References
Open-Pit Mining with Uncertainty: A Conditional Value-at-RiskApproach
1 Introduction
2 Problem Formulation
2.1 A CVaR Open-Pit Investment Model
2.2 A CVaR Open-Pit Design Model
2.3 Nested Pit Contours Based on the CVaR Concept
3 Numerical Study
3.1 Test Problem
3.2 Number of Scenarios Needed
3.3 Results for the Investment Model
3.4 Results for the Design Model
3.5 Results for the Nested Pit Contours
4 Conclusion
References
Incidence Graphs of Bipartite G-Graphs
1 Introduction
2 Definitions
2.1 Group Definitions
2.2 Graphs Definitions
3 G-Graphs Characterization
3.1 G-Graphs Definition
3.2 G-Graph Characterization
4 Incidence Graphs of G-Graphs
5 Mesh of d-ary Tree
References
A Tight Bound on the Worst-Case Number of Comparisonsfor Floyd's Heap Construction Algorithm
1 Introduction
2 Floyd's Heap Construction Algorithm
3 A Tight Bound on the Worst-Case Number of Comparisons
4 Conclusion
References
A Parallel Implementation of the Revised Simplex Algorithm Using OpenMP: Some Preliminary Results
1 Introduction
2 Revised Simplex Algorithm
3 Methods Used for Basis Inversion
3.1 Product Form of the Inverse
3.2 A Modification of Product Form of the Inverse
4 Parallel Revised Simplex Algorithm
5 Computational Experiments
5.1 Problem Instances
5.2 Computational Results
6 Conclusions
References
Maximum Induced Matchings in Grids
1 Introduction
2 Maximum Induced Matching in Grids
3 Conclusion
References
Determining the Minimum Number of Warehousesand their Space-Size for Storing Compatible Items
1 Introduction
2 Algorithm AGC
2.1 Algorithm: General Description
2.1.1 Branching
2.1.2 Backtracking
2.2 Formal Statement of Algorithm AGC
3 Number and Size of Warehouses
4 Conclusions
References
Duality for Multiple Objective Fractional Programmingwith Generalized Type-I Univexity
1 Introduction
2 Definitions and Preliminaries
3 A Zalmai's Semiparametric Duality Model
4 Conclusions
References
A Markov-Based Decision Model of Tax Evasion for Risk-AverseFirms in Greece
1 Introduction
1.1 Related Work
2 Model Description
2.1 The Greek Tax System for Firms
2.2 The Model
3 Optimal Firm Behavior
3.1 Charting the (p,) Parameter Space
3.2 Parameter Selection
3.3 Risk-Neutral Firm (= 0)
3.4 Risk-Averse Firm (= 6)
4 Conclusions
References
Stochastic Decentralized Control of a Platoon of Vehicles Based on the Inclusion Principle
1 Introduction
2 Model Formulation
3 Stochastic Inclusion Principle
3.1 General Aspects
3.2 Inclusion of Estimators
3.3 Contractibility of Dynamic Controllers
3.4 Inclusion of Performance Indices
3.5 Overlapping Decentralized Control
4 Decentralized LQG Suboptimal Platoon Control
4.1 Leading Vehicle Control
4.2 General Subsystem Control
4.3 Platoon Control
5 Experimental Results
6 Conclusion
References
Homogeneous and Non-homogeneous Algorithms
1 Introduction
2 Description of the Two Classes
3 Algorithm Classification
4 Additional Results and Discussion
References
Service Quality Evaluation in the Tourism Industry: A SWOT Analysis Approach
1 Introduction
2 Methodology
2.1 MUSA Method
2.2 SWOT Analysis
3 Survey and Results
3.1 Satisfaction Criteria and Questionnaire
3.2 Sample and Tourists' Profile
3.3 Satisfaction Analysis
3.4 Statistical Analyses
4 Conclusions
References
Correcting Certain Estimation Methods for the Generalized Pareto Distribution
1 Introduction
2 Estimating GPD Parameters and Quantiles
2.1 Method of Moments
2.2 Method of Probability Weighted Moments
2.3 Estimating GPD Quantiles
3 Inconsistency with the Data and Correction Techniques
3.1 Proposed Corrections
4 Simulation Results
4.1 Simulation Study for Particular a and ß Choices
5 An Example-Fish River Data
6 Conclusions and Future Work
References
Consistent Sequences of Tests Defined by Bans
1 Introduction
2 Mathematical Models and Examples
3 Conditions for the Existence of Consistent Sequences of Tests Depending on the Ban
4 Properties of the Bans
5 Consistent Sequences of Tests for Finite Markov Chains
6 Conclusion
References
Impact Assessment Through Collaborative Asset Modeling: The STORM-RM Approach
1 Introduction
2 The STORM-RM Organization Cartography Phase
2.1 Modeling Users and Assets in STORM-RM
2.1.1 User Group Model
2.1.2 Asset Group Model
2.2 Identifying the Users and Assets of the Organization
2.2.1 Assigning the Organization Users to User Groups
2.2.2 Linking the Organization Assets to Asset Groups
3 The STORM-RM Impact Assessment Phase
3.1 Assigning and Weighting User Groups to Asset Categories
3.1.1 Data Assets
3.1.2 Systems
3.2 Calculating the Impact of Each Asset
3.2.1 Calculating the Impact of Each Data Asset
3.2.2 Calculating the Impact of Each System
3.3 Implied Values and Finalization
4 Conclusions
References
Testing the Homoskedasticity/Heteroskedasticity of the Errors Using the White Test: Pattern Classification by k-Variances and Informational Criteria
1 Introduction
2 Informational Criteria and Classification
3 Applications
4 Conclusions
References
An Innovative Decision Making e-key ApplicationFor the Identification of Fish Species
1 Introduction
2 Methodology
3 The Developed Information System
4 The User Interface
5 Conclusions and Further Research
References
Primal-Dual Algorithms for P*() Linear Complementarity ProblemsBased on Kernel-Function with Trigonometric Barrier Term
1 Introduction
2 Preliminaries
3 Properties of the New Proximity Function
3.1 Some Technical Results
3.2 Relations Between Proximity Measure and Norm-Based Proximity Measure
3.3 Growth Behavior of the Barrier Function
4 Analysis of the Algorithm
5 Iteration Complexity
5.1 Upper Bound for the Total Number of Iterations
5.2 Large-Update
5.3 Small-Update Methods
6 Concluding Remarks
References
An Approximation Algorithm for the Three Depots Hamiltonian Path Problem
1 Introduction
2 An Approximation Algorithm for the 3DHPP
3 Example
4 Conclusion
References

Inhalt (PDF)

Systemvoraussetzungen

Als PDF speichern Als Link merken