Loading…

Hybrid genetic algorithm for network locating problem by considering multi-purpose trip in stochastic state

In this paper, the locating problem was studied by considering a network of nodes and edges, and also two types of facilities which were defined for locating on nodes. It was assumed that there were three types of consumers, which were classified according to their demands. The first and the second...

Full description

Saved in:
Bibliographic Details
Published in:Indian journal of science and technology 2011-09, Vol.4 (9), p.1109-1112
Main Author: Najafi, Sajjad
Format: Article
Language:English
Subjects:
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c1693-9e0d8b54eb6e674a31c8c117440df77bf3436aea7838ab43c2c633c4ed09303e3
cites
container_end_page 1112
container_issue 9
container_start_page 1109
container_title Indian journal of science and technology
container_volume 4
creator Najafi, Sajjad
description In this paper, the locating problem was studied by considering a network of nodes and edges, and also two types of facilities which were defined for locating on nodes. It was assumed that there were three types of consumers, which were classified according to their demands. The first and the second types of them referred to one facility of the first or the second, but the third type of consumers needed the two facilities-the first and the second. These consumers according to their distance to the facilities based on a specified probability, referred to the facilities and solved their problems. Considering the existence of competitors in the market, the aim of this issue is to maximize market share for the new facilities. To solve the problem the hybrid genetic algorithm was used.
doi_str_mv 10.17485/ijst/2011/v4i9.23
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1031301769</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1031301769</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1693-9e0d8b54eb6e674a31c8c117440df77bf3436aea7838ab43c2c633c4ed09303e3</originalsourceid><addsrcrecordid>eNotkEFPwzAMhSMEEtPYH-CUI5duSZ2m7RFNwJAmcYFzlKbulq1tSpKB9u9p2Xyx9fT0bH-EPHK25LkospU9hLhKGeerH2HLZQo3ZMbKXCSZFNntdZaFkPdkEcKBjQVpwXI2I8fNufK2pjvsMVpDdbtz3sZ9Rxvn6aj9On-krTM62n5HB--qFjtanalxfbA1-knuTm20yXDygwtIo7cDtT0N0Zm9DlNsiDriA7lrdBtwce1z8vX68rneJNuPt_f18zYxXJaQlMjqosoEVhJlLjRwUxg-fipY3eR51YAAqVHnBRS6EmBSIwGMwJqVwABhTp4uueO13ycMUXU2GGxb3aM7BcUZcGA8H5fNSXqxGu9C8NiowdtO-_NoUv9w1QRXTXDVBFelAH9RvXDv</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1031301769</pqid></control><display><type>article</type><title>Hybrid genetic algorithm for network locating problem by considering multi-purpose trip in stochastic state</title><source>Freely Accessible Journals</source><creator>Najafi, Sajjad</creator><creatorcontrib>Najafi, Sajjad</creatorcontrib><description>In this paper, the locating problem was studied by considering a network of nodes and edges, and also two types of facilities which were defined for locating on nodes. It was assumed that there were three types of consumers, which were classified according to their demands. The first and the second types of them referred to one facility of the first or the second, but the third type of consumers needed the two facilities-the first and the second. These consumers according to their distance to the facilities based on a specified probability, referred to the facilities and solved their problems. Considering the existence of competitors in the market, the aim of this issue is to maximize market share for the new facilities. To solve the problem the hybrid genetic algorithm was used.</description><identifier>ISSN: 0974-6846</identifier><identifier>EISSN: 0974-5645</identifier><identifier>DOI: 10.17485/ijst/2011/v4i9.23</identifier><language>eng</language><subject>Consumers ; Genetic algorithms ; Indian ; Marketing ; Markets ; Networks ; Positioning ; Stochasticity</subject><ispartof>Indian journal of science and technology, 2011-09, Vol.4 (9), p.1109-1112</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c1693-9e0d8b54eb6e674a31c8c117440df77bf3436aea7838ab43c2c633c4ed09303e3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Najafi, Sajjad</creatorcontrib><title>Hybrid genetic algorithm for network locating problem by considering multi-purpose trip in stochastic state</title><title>Indian journal of science and technology</title><description>In this paper, the locating problem was studied by considering a network of nodes and edges, and also two types of facilities which were defined for locating on nodes. It was assumed that there were three types of consumers, which were classified according to their demands. The first and the second types of them referred to one facility of the first or the second, but the third type of consumers needed the two facilities-the first and the second. These consumers according to their distance to the facilities based on a specified probability, referred to the facilities and solved their problems. Considering the existence of competitors in the market, the aim of this issue is to maximize market share for the new facilities. To solve the problem the hybrid genetic algorithm was used.</description><subject>Consumers</subject><subject>Genetic algorithms</subject><subject>Indian</subject><subject>Marketing</subject><subject>Markets</subject><subject>Networks</subject><subject>Positioning</subject><subject>Stochasticity</subject><issn>0974-6846</issn><issn>0974-5645</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><recordid>eNotkEFPwzAMhSMEEtPYH-CUI5duSZ2m7RFNwJAmcYFzlKbulq1tSpKB9u9p2Xyx9fT0bH-EPHK25LkospU9hLhKGeerH2HLZQo3ZMbKXCSZFNntdZaFkPdkEcKBjQVpwXI2I8fNufK2pjvsMVpDdbtz3sZ9Rxvn6aj9On-krTM62n5HB--qFjtanalxfbA1-knuTm20yXDygwtIo7cDtT0N0Zm9DlNsiDriA7lrdBtwce1z8vX68rneJNuPt_f18zYxXJaQlMjqosoEVhJlLjRwUxg-fipY3eR51YAAqVHnBRS6EmBSIwGMwJqVwABhTp4uueO13ycMUXU2GGxb3aM7BcUZcGA8H5fNSXqxGu9C8NiowdtO-_NoUv9w1QRXTXDVBFelAH9RvXDv</recordid><startdate>20110920</startdate><enddate>20110920</enddate><creator>Najafi, Sajjad</creator><scope>AAYXX</scope><scope>CITATION</scope><scope>8BQ</scope><scope>8FD</scope><scope>JG9</scope></search><sort><creationdate>20110920</creationdate><title>Hybrid genetic algorithm for network locating problem by considering multi-purpose trip in stochastic state</title><author>Najafi, Sajjad</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1693-9e0d8b54eb6e674a31c8c117440df77bf3436aea7838ab43c2c633c4ed09303e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Consumers</topic><topic>Genetic algorithms</topic><topic>Indian</topic><topic>Marketing</topic><topic>Markets</topic><topic>Networks</topic><topic>Positioning</topic><topic>Stochasticity</topic><toplevel>online_resources</toplevel><creatorcontrib>Najafi, Sajjad</creatorcontrib><collection>CrossRef</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>Materials Research Database</collection><jtitle>Indian journal of science and technology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Najafi, Sajjad</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Hybrid genetic algorithm for network locating problem by considering multi-purpose trip in stochastic state</atitle><jtitle>Indian journal of science and technology</jtitle><date>2011-09-20</date><risdate>2011</risdate><volume>4</volume><issue>9</issue><spage>1109</spage><epage>1112</epage><pages>1109-1112</pages><issn>0974-6846</issn><eissn>0974-5645</eissn><abstract>In this paper, the locating problem was studied by considering a network of nodes and edges, and also two types of facilities which were defined for locating on nodes. It was assumed that there were three types of consumers, which were classified according to their demands. The first and the second types of them referred to one facility of the first or the second, but the third type of consumers needed the two facilities-the first and the second. These consumers according to their distance to the facilities based on a specified probability, referred to the facilities and solved their problems. Considering the existence of competitors in the market, the aim of this issue is to maximize market share for the new facilities. To solve the problem the hybrid genetic algorithm was used.</abstract><doi>10.17485/ijst/2011/v4i9.23</doi><tpages>4</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0974-6846
ispartof Indian journal of science and technology, 2011-09, Vol.4 (9), p.1109-1112
issn 0974-6846
0974-5645
language eng
recordid cdi_proquest_miscellaneous_1031301769
source Freely Accessible Journals
subjects Consumers
Genetic algorithms
Indian
Marketing
Markets
Networks
Positioning
Stochasticity
title Hybrid genetic algorithm for network locating problem by considering multi-purpose trip in stochastic state
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T23%3A56%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Hybrid%20genetic%20algorithm%20for%20network%20locating%20problem%20by%20considering%20multi-purpose%20trip%20in%20stochastic%20state&rft.jtitle=Indian%20journal%20of%20science%20and%20technology&rft.au=Najafi,%20Sajjad&rft.date=2011-09-20&rft.volume=4&rft.issue=9&rft.spage=1109&rft.epage=1112&rft.pages=1109-1112&rft.issn=0974-6846&rft.eissn=0974-5645&rft_id=info:doi/10.17485/ijst/2011/v4i9.23&rft_dat=%3Cproquest_cross%3E1031301769%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c1693-9e0d8b54eb6e674a31c8c117440df77bf3436aea7838ab43c2c633c4ed09303e3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1031301769&rft_id=info:pmid/&rfr_iscdi=true