Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Ann Oper Res

Search In Journal Title:

Abbravation: Annals of Operations Research

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1002/pola.26641

Search In DOI:

ISSN

1572-9338

Search In ISSN:
Search In Title Of Papers:

A simple model of optimal clearance of improvised

Authors: Peter Kolesar Kellen Leister Daniel Stimpson Ronald Woodaman
Publish Date: 2012/04/24
Volume: 208, Issue: 1, Pages: 451-468
PDF Link

Abstract

Motivated by experiences of coalition military forces in Iraq and Afghanistan we analyze the allocation of route clearance teams RCTs to search for and neutralize improvised explosive devices IEDs on roadways traveled by military convoys We model the interaction of a single RCT and a single convoy operating over a given roadway Our goal is to reduce IED risk by improving coordination between the RCT and the convoy We treat the distribution of IEDs along the road prior to the passage of the RCT as a nonhomogeneous Poisson process The RCT finds and clears IEDs according to a Bernoulli process Enemy forces may emplace reseed additional IEDs in the temporal gap between the RCT clearance sweep and the arrival of the convoy IED risk is defined as the expected number of IEDs encountered by the convoy We identify certain characteristics of optimal RCT schedules including the shape of the IED intensity function and the speed of reseeding substantially dictate the RCT schedule that minimizes IED risk the more rapid the IED reseeding the more critical is conformance to the optimal RCT schedule an RCT having inferior detection probability by employing superior scheduling can sometimes reduce convoy risk more than a less well scheduled RCT with superior detection probability a discretized highway version of the problem can be efficiently optimized We also briefly discuss applications of this model to the more complex problem of allocating several RCTs to protect a number of convoys scheduled to travel on a network of highways

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. A computational evaluation of a general branch-and-price framework for capacitated network location problems
  2. Index tracking with controlled number of assets using a hybrid heuristic combining genetic algorithm and non-linear programming
  3. Evolutionary coalitional games for random access control
  4. Service outsourcing under different supply chain power structures
  5. Time-dependent analysis for refused admissions in clinical wards
  6. Optimal design of container inspection strategies considering multiple objectives via an evolutionary approach
  7. A class of nonsmooth fractional multiobjective optimization problems
  8. Exploring the complexity boundary between coloring and list-coloring
  9. Lipschitz and differentiability properties of quasi-concave and singular normal distribution functions
  10. Managerial insights from service industry models: a new scenario decomposition method
  11. Curriculum-based course timetabling with SAT and MaxSAT
  12. Setting handicaps to industrial sectors in DEA illustrated by Ethiopian industry
  13. Using linear programming to analyze and optimize stochastic flow lines
  14. Retail service for mixed retail and E-tail channels
  15. Redesigning product lines in a period of economic crisis: a hybrid simulated annealing algorithm with crossover
  16. Gated polling with stationary ergodic walking times, Markovian routing and random feedback
  17. A dynamic vehicle routing problem with multiple delivery routes
  18. An empirical examination of energy consumption, behavioral intention, and situational factors: evidence from Beijing
  19. Reverse-engineering country risk ratings: a combinatorial non-recursive model
  20. A multi-stage IP-based heuristic for class timetabling and trainer rostering
  21. Scheduling preparation of doses for a chemotherapy service
  22. Scenario decomposition of risk-averse multistage stochastic programming problems
  23. A robust optimization solution to bottleneck generalized assignment problem under uncertainty
  24. The crew timetabling problem: An extension of the crew scheduling problem
  25. Relations between threshold and k -interval Boolean functions
  26. Network models and biproportional rounding for fair seat allocations in the UK elections
  27. An out-of-sample evaluation framework for DEA with application in bankruptcy prediction
  28. A study on supply chain investment decision-making and coordination in the Big Data environment
  29. An efficient model formulation for level of repair analysis
  30. Supply planning models for a remanufacturer under just-in-time manufacturing environment with reverse logistics
  31. Autonomous coalitions
  32. Spatially explicit forest harvest scheduling with difference equations
  33. An analytic framework to develop policies for testing, prevention, and treatment of two-stage contagious diseases
  34. Packet loss characteristics for M / G /1/ N queueing systems
  35. Cooperation strategy of technology licensing based on evolutionary game
  36. Tabu search approaches for solving the two-group classification problem
  37. Employee stock ownership and diversification
  38. A new decision support framework for managing foot-and-mouth disease epidemics
  39. Isomorphic scheduling problems
  40. Location of retail facilities under conditions of uncertainty
  41. Modelling either-or relations in integer programming
  42. Primal and dual bounds for the vertex p -median problem with balance constraints
  43. Evolution-inspired local improvement algorithm solving orienteering problem
  44. Nondifferentiable minimax programming problems with applications
Search Result: