<?xml version="1.0" encoding="UTF-8"?>
<doi_batch version="5.3.1" xmlns="http://www.crossref.org/schema/5.3.1" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:jats="http://www.ncbi.nlm.nih.gov/JATS1" xmlns:ai="http://www.crossref.org/AccessIndicators.xsd" xsi:schemaLocation="http://www.crossref.org/schema/5.3.1 http://www.crossref.org/schema/deposit/crossref5.3.1.xsd">
 <head>
  <doi_batch_id>aspg-1-1083-1791417451</doi_batch_id>
  <timestamp>20261007235731</timestamp>
  <depositor>
   <depositor_name>American Scientific Publishing Group</depositor_name>
   <email_address>admin@americaspg.com</email_address>
  </depositor>
  <registrant>American Scientific Publishing Group</registrant>
 </head>
 <body>
  <journal>
   <journal_metadata language="en">
    <full_title>American Journal of Business and Operations Research</full_title>
    <abbrev_title>AJBOR</abbrev_title>
    <issn media_type="print">2770-0216</issn>
    <issn media_type="electronic">2692-2967</issn>
   </journal_metadata>
   <journal_issue>
    <publication_date media_type="online">
     <year>2022</year>
    </publication_date>
    <journal_volume>
     <volume>6</volume>
    </journal_volume>
    <issue>1</issue>
   </journal_issue>
   <journal_article publication_type="full_text">
    <titles>
     <title>Expected Value of Asymmetric Coordinated Search Technique for Detecting a Randomly Located Target on the Plane</title>
    </titles>
    <contributors>
     <person_name sequence="first" contributor_role="author">
      <given_name>Sundus Naji</given_name>
      <surname>AL-Aziz</surname>
      <affiliations>
       <institution>
        <institution_name>Department of Mathematics, College of Science, Princess Nourah bint Abdulrahman University, Riyadh, KSA</institution_name>
       </institution>
      </affiliations>
     </person_name>
    </contributors>
    <jats:abstract>
     <jats:p>This paper proposes Asymmetric coordination strategy, we study coordinated search technique for a lost located object on the plan, where there are two searchers beginning their search from the same initial point (0, 0), but both sides do not have the same area. Here we introduce a model of search plan and investigate the expected value of detecting the lost target in both sides to avoid wasting time. We present an algorithm to facilitate the search technique. An illustrative application from real life has been introduced to demonstrate the applicability of this search technique. The effectiveness of this model has been illustrated by numerical results</jats:p>
    </jats:abstract>
    <publication_date media_type="online">
     <year>2022</year>
    </publication_date>
    <pages>
     <first_page>56</first_page>
     <last_page>71</last_page>
    </pages>
    <publisher_item>
     <item_number item_number_type="article-number">1083</item_number>
    </publisher_item>
    <ai:program name="AccessIndicators">
     <ai:license_ref applies_to="vor">https://creativecommons.org/licenses/by/4.0/</ai:license_ref>
    </ai:program>
    <doi_data>
     <doi>10.54216/AJBOR.060105</doi>
     <resource>https://www.americaspg.com/journal/1/article/1083</resource>
     <collection property="text-mining">
      <item>
       <resource mime_type="application/pdf">https://www.americaspg.com/storage/71761841170.pdf</resource>
      </item>
     </collection>
    </doi_data>
   </journal_article>
  </journal>
 </body>
</doi_batch>
