# Bi-directional nearness in a network by AHP (Analytic Hierarchy Process) and ANP (Analytic Network Process)

• Volume: 34, Issue: 3, page 313-330
• ISSN: 0399-0559

top

## Abstract

top
In this paper we study bi-directional nearness in a network based on AHP (Analytic Hierarchy Process) and ANP (Analytic Network Process). Usually we use forward (one-dimensional) direction nearness based on Euclidean distance. Even if the nearest point to i is point j, the nearest point to j is not necessarily point i. Sowe propose the concept of bi-directional nearness defined by AHP'ssynthesizing of weights “for” direction and “from” direction. This concept of distance is a relative distance based on the configuration ofthe set of points located on a plane or network. In order to confirm the usefulness of our study we apply the proposed nearness to solving methods of TSP (Traveling Salesman Problem), where to find an approximate solution of TSP we improved Nearest-Neighbor Method. Some numerical experiments of TSP were carried out. To decide a nearest point we used two kind of nearness, forward direction nearness and bi-directional nearness. As a result, by using bi-directional nearness,we obtained good approximate solution of TSP. Moreover, the relation between AHP and ANP, through an example, is considered.

## How to cite

top

Nishizawa, Kazutomo. "Bi-directional nearness in a network by AHP (Analytic Hierarchy Process) and ANP (Analytic Network Process)." RAIRO - Operations Research 34.3 (2010): 313-330. <http://eudml.org/doc/197835>.

@article{Nishizawa2010,
abstract = { In this paper we study bi-directional nearness in a network based on AHP (Analytic Hierarchy Process) and ANP (Analytic Network Process). Usually we use forward (one-dimensional) direction nearness based on Euclidean distance. Even if the nearest point to i is point j, the nearest point to j is not necessarily point i. Sowe propose the concept of bi-directional nearness defined by AHP'ssynthesizing of weights “for” direction and “from” direction. This concept of distance is a relative distance based on the configuration ofthe set of points located on a plane or network. In order to confirm the usefulness of our study we apply the proposed nearness to solving methods of TSP (Traveling Salesman Problem), where to find an approximate solution of TSP we improved Nearest-Neighbor Method. Some numerical experiments of TSP were carried out. To decide a nearest point we used two kind of nearness, forward direction nearness and bi-directional nearness. As a result, by using bi-directional nearness,we obtained good approximate solution of TSP. Moreover, the relation between AHP and ANP, through an example, is considered. },
author = {Nishizawa, Kazutomo},
journal = {RAIRO - Operations Research},
keywords = {AHP; ANP; TSP.},
language = {eng},
month = {3},
number = {3},
pages = {313-330},
publisher = {EDP Sciences},
title = {Bi-directional nearness in a network by AHP (Analytic Hierarchy Process) and ANP (Analytic Network Process)},
url = {http://eudml.org/doc/197835},
volume = {34},
year = {2010},
}

TY - JOUR
AU - Nishizawa, Kazutomo
TI - Bi-directional nearness in a network by AHP (Analytic Hierarchy Process) and ANP (Analytic Network Process)
JO - RAIRO - Operations Research
DA - 2010/3//
PB - EDP Sciences
VL - 34
IS - 3
SP - 313
EP - 330
AB - In this paper we study bi-directional nearness in a network based on AHP (Analytic Hierarchy Process) and ANP (Analytic Network Process). Usually we use forward (one-dimensional) direction nearness based on Euclidean distance. Even if the nearest point to i is point j, the nearest point to j is not necessarily point i. Sowe propose the concept of bi-directional nearness defined by AHP'ssynthesizing of weights “for” direction and “from” direction. This concept of distance is a relative distance based on the configuration ofthe set of points located on a plane or network. In order to confirm the usefulness of our study we apply the proposed nearness to solving methods of TSP (Traveling Salesman Problem), where to find an approximate solution of TSP we improved Nearest-Neighbor Method. Some numerical experiments of TSP were carried out. To decide a nearest point we used two kind of nearness, forward direction nearness and bi-directional nearness. As a result, by using bi-directional nearness,we obtained good approximate solution of TSP. Moreover, the relation between AHP and ANP, through an example, is considered.
LA - eng
KW - AHP; ANP; TSP.
UR - http://eudml.org/doc/197835
ER -

## NotesEmbed?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.